/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013_variant-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:11:52,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:11:52,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:11:52,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:11:52,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:11:52,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:11:52,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:11:52,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:11:52,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:11:52,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:11:52,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:11:52,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:11:52,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:11:52,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:11:52,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:11:52,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:11:52,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:11:52,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:11:52,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:11:52,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:11:52,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:11:52,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:11:52,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:11:52,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:11:52,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:11:52,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:11:52,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:11:52,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:11:52,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:11:52,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:11:52,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:11:52,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:11:52,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:11:52,454 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:11:52,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:11:52,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:11:52,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:11:52,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:11:52,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:11:52,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:11:52,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:11:52,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 19:11:52,495 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:11:52,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:11:52,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:11:52,497 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:11:52,497 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:11:52,501 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:11:52,501 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:11:52,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:11:52,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:11:52,502 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:11:52,502 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:11:52,502 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:11:52,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:11:52,502 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:11:52,503 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:11:52,503 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:11:52,503 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:11:52,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:11:52,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:11:52,503 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:11:52,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:11:52,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:11:52,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:11:52,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:11:52,506 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:11:52,507 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:11:52,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:11:52,507 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:11:52,507 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:11:52,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:11:52,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:11:52,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:11:52,849 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:11:52,849 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:11:52,850 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fkp2013_variant-1.i [2019-12-18 19:11:52,918 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bb732429/ef3bc6b7655e45efacfb98a63d307056/FLAG14eb59e07 [2019-12-18 19:11:53,422 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:11:53,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013_variant-1.i [2019-12-18 19:11:53,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bb732429/ef3bc6b7655e45efacfb98a63d307056/FLAG14eb59e07 [2019-12-18 19:11:53,747 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bb732429/ef3bc6b7655e45efacfb98a63d307056 [2019-12-18 19:11:53,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:11:53,759 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:11:53,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:11:53,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:11:53,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:11:53,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:11:53" (1/1) ... [2019-12-18 19:11:53,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70dbd6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:53, skipping insertion in model container [2019-12-18 19:11:53,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:11:53" (1/1) ... [2019-12-18 19:11:53,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:11:53,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:11:54,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:11:54,296 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:11:54,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:11:54,410 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:11:54,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54 WrapperNode [2019-12-18 19:11:54,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:11:54,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:11:54,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:11:54,412 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:11:54,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,440 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:11:54,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:11:54,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:11:54,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:11:54,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:11:54,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:11:54,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:11:54,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:11:54,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (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 19:11:54,590 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-18 19:11:54,590 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-18 19:11:54,590 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-18 19:11:54,590 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-18 19:11:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:11:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:11:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:11:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:11:54,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:11:54,593 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 19:11:54,943 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:11:54,944 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-18 19:11:54,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:11:54 BoogieIcfgContainer [2019-12-18 19:11:54,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:11:54,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:11:54,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:11:54,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:11:54,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:11:53" (1/3) ... [2019-12-18 19:11:54,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ff5dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:11:54, skipping insertion in model container [2019-12-18 19:11:54,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (2/3) ... [2019-12-18 19:11:54,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ff5dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:11:54, skipping insertion in model container [2019-12-18 19:11:54,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:11:54" (3/3) ... [2019-12-18 19:11:54,953 INFO L109 eAbstractionObserver]: Analyzing ICFG fkp2013_variant-1.i [2019-12-18 19:11:54,962 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:11:54,962 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:11:54,970 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 19:11:54,971 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:11:54,996 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,997 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,997 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,997 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,998 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,998 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,998 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,999 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,999 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,000 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,000 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,001 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,001 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,001 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,002 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,002 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,002 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,002 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,003 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,003 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,003 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,011 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,012 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,012 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,012 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,012 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,019 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,019 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,019 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,020 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,020 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,020 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,035 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-18 19:11:55,053 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:11:55,054 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:11:55,054 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:11:55,054 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:11:55,054 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:11:55,055 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:11:55,055 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:11:55,055 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:11:55,068 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 56 transitions [2019-12-18 19:11:55,071 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 60 places, 56 transitions [2019-12-18 19:11:55,117 INFO L126 PetriNetUnfolder]: 3/66 cut-off events. [2019-12-18 19:11:55,117 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:55,128 INFO L76 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 66 events. 3/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs. 8/68 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-18 19:11:55,131 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 60 places, 56 transitions [2019-12-18 19:11:55,152 INFO L126 PetriNetUnfolder]: 3/66 cut-off events. [2019-12-18 19:11:55,152 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:55,154 INFO L76 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 66 events. 3/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs. 8/68 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-18 19:11:55,157 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 692 [2019-12-18 19:11:55,158 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:11:56,549 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-12-18 19:11:56,818 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-12-18 19:11:56,908 INFO L206 etLargeBlockEncoding]: Checked pairs total: 524 [2019-12-18 19:11:56,909 INFO L214 etLargeBlockEncoding]: Total number of compositions: 47 [2019-12-18 19:11:56,913 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-18 19:11:56,923 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-18 19:11:56,926 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-18 19:11:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:11:56,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:56,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:11:56,936 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:11:56,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:56,945 INFO L82 PathProgramCache]: Analyzing trace with hash 219913, now seen corresponding path program 1 times [2019-12-18 19:11:56,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:56,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855659367] [2019-12-18 19:11:56,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:11:57,216 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 19:11:57,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855659367] [2019-12-18 19:11:57,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:11:57,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:11:57,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995536855] [2019-12-18 19:11:57,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:11:57,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:11:57,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:11:57,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:11:57,251 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-18 19:11:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:11:57,315 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-18 19:11:57,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:11:57,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:11:57,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:11:57,342 INFO L225 Difference]: With dead ends: 35 [2019-12-18 19:11:57,345 INFO L226 Difference]: Without dead ends: 31 [2019-12-18 19:11:57,346 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 19:11:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-18 19:11:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-18 19:11:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-18 19:11:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-18 19:11:57,394 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-18 19:11:57,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:11:57,394 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-18 19:11:57,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:11:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-18 19:11:57,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 19:11:57,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:57,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:11:57,396 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:11:57,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:57,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1212750904, now seen corresponding path program 1 times [2019-12-18 19:11:57,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:57,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340560638] [2019-12-18 19:11:57,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:11:57,508 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 19:11:57,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340560638] [2019-12-18 19:11:57,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:11:57,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:11:57,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372677789] [2019-12-18 19:11:57,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:11:57,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:11:57,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:11:57,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:11:57,512 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-18 19:11:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:11:57,529 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-18 19:11:57,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:11:57,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-18 19:11:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:11:57,531 INFO L225 Difference]: With dead ends: 26 [2019-12-18 19:11:57,531 INFO L226 Difference]: Without dead ends: 24 [2019-12-18 19:11:57,532 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 19:11:57,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-18 19:11:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-18 19:11:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-18 19:11:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-18 19:11:57,536 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-18 19:11:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:11:57,536 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-18 19:11:57,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:11:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-18 19:11:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-18 19:11:57,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:57,537 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-18 19:11:57,538 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:11:57,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:57,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1059432955, now seen corresponding path program 1 times [2019-12-18 19:11:57,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:57,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683788780] [2019-12-18 19:11:57,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:11:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:11:57,603 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:11:57,603 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:11:57,603 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 19:11:57,603 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-18 19:11:57,612 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,612 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,612 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,613 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,613 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,613 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,613 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,613 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,614 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,614 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,614 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,614 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,614 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,615 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,615 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,615 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,615 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,615 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,616 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,616 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,616 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,616 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,617 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,617 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,617 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,617 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,617 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,618 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,618 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,618 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,618 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,619 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,619 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,619 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,619 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,619 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,620 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,620 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,620 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,620 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,620 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,621 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,621 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,621 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,621 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,622 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,622 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,623 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,624 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,624 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,626 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,626 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,626 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,627 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,627 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,627 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,628 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,629 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,629 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,629 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,629 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,629 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,631 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 19:11:57,631 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:11:57,631 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:11:57,632 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:11:57,632 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:11:57,632 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:11:57,632 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:11:57,632 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:11:57,632 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:11:57,635 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 74 transitions [2019-12-18 19:11:57,635 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 81 places, 74 transitions [2019-12-18 19:11:57,652 INFO L126 PetriNetUnfolder]: 4/88 cut-off events. [2019-12-18 19:11:57,653 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:57,655 INFO L76 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 88 events. 4/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs. 20/100 useless extension candidates. Maximal degree in co-relation 97. Up to 6 conditions per place. [2019-12-18 19:11:57,659 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 81 places, 74 transitions [2019-12-18 19:11:57,675 INFO L126 PetriNetUnfolder]: 4/88 cut-off events. [2019-12-18 19:11:57,675 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:57,677 INFO L76 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 88 events. 4/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs. 20/100 useless extension candidates. Maximal degree in co-relation 97. Up to 6 conditions per place. [2019-12-18 19:11:57,681 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1108 [2019-12-18 19:11:57,681 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:11:59,207 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-18 19:11:59,280 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1223 [2019-12-18 19:11:59,280 INFO L214 etLargeBlockEncoding]: Total number of compositions: 61 [2019-12-18 19:11:59,281 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-18 19:11:59,293 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-18 19:11:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-18 19:11:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:11:59,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:59,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:11:59,294 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:11:59,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:59,295 INFO L82 PathProgramCache]: Analyzing trace with hash 374327, now seen corresponding path program 1 times [2019-12-18 19:11:59,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:59,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801701649] [2019-12-18 19:11:59,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:11:59,333 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 19:11:59,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801701649] [2019-12-18 19:11:59,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:11:59,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:11:59,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246450224] [2019-12-18 19:11:59,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:11:59,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:11:59,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:11:59,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:11:59,336 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-18 19:11:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:11:59,372 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-18 19:11:59,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:11:59,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:11:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:11:59,378 INFO L225 Difference]: With dead ends: 185 [2019-12-18 19:11:59,378 INFO L226 Difference]: Without dead ends: 171 [2019-12-18 19:11:59,378 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 19:11:59,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-18 19:11:59,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-18 19:11:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-18 19:11:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-18 19:11:59,405 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-18 19:11:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:11:59,405 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-18 19:11:59,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:11:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-18 19:11:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:11:59,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:59,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:11:59,407 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:11:59,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:59,407 INFO L82 PathProgramCache]: Analyzing trace with hash -857862729, now seen corresponding path program 1 times [2019-12-18 19:11:59,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:59,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421700816] [2019-12-18 19:11:59,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:11:59,487 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 19:11:59,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421700816] [2019-12-18 19:11:59,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:11:59,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:11:59,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182651759] [2019-12-18 19:11:59,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:11:59,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:11:59,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:11:59,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:11:59,491 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-18 19:11:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:11:59,607 INFO L93 Difference]: Finished difference Result 224 states and 491 transitions. [2019-12-18 19:11:59,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:11:59,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 19:11:59,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:11:59,611 INFO L225 Difference]: With dead ends: 224 [2019-12-18 19:11:59,612 INFO L226 Difference]: Without dead ends: 221 [2019-12-18 19:11:59,612 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 19:11:59,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-12-18 19:11:59,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 162. [2019-12-18 19:11:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-18 19:11:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-18 19:11:59,632 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-18 19:11:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:11:59,633 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-18 19:11:59,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:11:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-18 19:11:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:11:59,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:59,634 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:11:59,635 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:11:59,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:59,635 INFO L82 PathProgramCache]: Analyzing trace with hash -924776041, now seen corresponding path program 1 times [2019-12-18 19:11:59,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:59,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10749130] [2019-12-18 19:11:59,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:11:59,683 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 19:11:59,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10749130] [2019-12-18 19:11:59,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:11:59,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:11:59,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396776227] [2019-12-18 19:11:59,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:11:59,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:11:59,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:11:59,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:11:59,685 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-18 19:11:59,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:11:59,774 INFO L93 Difference]: Finished difference Result 213 states and 458 transitions. [2019-12-18 19:11:59,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:11:59,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 19:11:59,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:11:59,777 INFO L225 Difference]: With dead ends: 213 [2019-12-18 19:11:59,777 INFO L226 Difference]: Without dead ends: 209 [2019-12-18 19:11:59,778 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 19:11:59,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-18 19:11:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 153. [2019-12-18 19:11:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-18 19:11:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-18 19:11:59,797 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-18 19:11:59,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:11:59,799 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-18 19:11:59,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:11:59,799 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-18 19:11:59,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 19:11:59,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:59,801 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:11:59,801 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:11:59,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:59,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1393798314, now seen corresponding path program 1 times [2019-12-18 19:11:59,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:59,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155605343] [2019-12-18 19:11:59,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:11:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:11:59,835 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:11:59,835 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:11:59,836 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 19:11:59,836 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-18 19:11:59,845 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,846 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,846 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,846 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,846 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,847 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,847 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,847 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,847 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,847 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,847 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,848 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,848 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,848 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,848 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,848 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,849 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,849 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,849 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,849 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,849 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,849 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,850 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,850 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,850 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,850 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,850 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,851 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,851 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,851 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,851 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,852 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,852 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,852 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,852 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,852 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,852 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,853 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,853 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,853 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,853 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,854 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,854 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,854 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,854 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,854 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,855 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,855 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,855 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,855 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,855 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,856 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,856 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,856 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,856 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,856 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,857 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,857 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,857 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,857 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,857 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,858 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,858 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,858 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,858 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,859 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,859 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,859 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,861 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,861 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,861 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,861 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,862 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,863 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,863 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,864 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,864 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,864 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,865 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,866 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,866 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,866 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,866 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,866 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,868 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,868 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,868 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,868 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,869 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,870 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,870 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,871 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,871 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,871 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,871 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:59,873 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 19:11:59,873 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:11:59,873 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:11:59,873 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:11:59,873 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:11:59,874 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:11:59,874 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:11:59,874 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:11:59,874 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:11:59,876 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 92 transitions [2019-12-18 19:11:59,877 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 102 places, 92 transitions [2019-12-18 19:11:59,895 INFO L126 PetriNetUnfolder]: 5/110 cut-off events. [2019-12-18 19:11:59,895 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:59,898 INFO L76 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 5/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 188 event pairs. 36/136 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2019-12-18 19:11:59,902 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 102 places, 92 transitions [2019-12-18 19:11:59,933 INFO L126 PetriNetUnfolder]: 5/110 cut-off events. [2019-12-18 19:11:59,933 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:59,937 INFO L76 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 5/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 188 event pairs. 36/136 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2019-12-18 19:11:59,940 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1608 [2019-12-18 19:11:59,940 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:12:01,364 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-12-18 19:12:01,652 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-12-18 19:12:01,773 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1840 [2019-12-18 19:12:01,774 INFO L214 etLargeBlockEncoding]: Total number of compositions: 80 [2019-12-18 19:12:01,774 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-18 19:12:01,795 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-18 19:12:01,796 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-18 19:12:01,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:12:01,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:01,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:12:01,797 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 19:12:01,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:01,797 INFO L82 PathProgramCache]: Analyzing trace with hash 564387, now seen corresponding path program 1 times [2019-12-18 19:12:01,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:01,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286926515] [2019-12-18 19:12:01,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:01,836 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 19:12:01,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286926515] [2019-12-18 19:12:01,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:01,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:12:01,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866514986] [2019-12-18 19:12:01,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:12:01,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:01,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:12:01,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:12:01,838 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-18 19:12:01,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:01,871 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-18 19:12:01,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:12:01,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:12:01,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:01,880 INFO L225 Difference]: With dead ends: 600 [2019-12-18 19:12:01,880 INFO L226 Difference]: Without dead ends: 559 [2019-12-18 19:12:01,881 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 19:12:01,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-18 19:12:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-18 19:12:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-18 19:12:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-18 19:12:01,932 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-18 19:12:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:01,932 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-18 19:12:01,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:12:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-18 19:12:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:12:01,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:01,933 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:01,933 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 19:12:01,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:01,933 INFO L82 PathProgramCache]: Analyzing trace with hash -2099227938, now seen corresponding path program 1 times [2019-12-18 19:12:01,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:01,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398737684] [2019-12-18 19:12:01,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:01,999 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 19:12:01,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398737684] [2019-12-18 19:12:01,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:01,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:02,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971319437] [2019-12-18 19:12:02,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:02,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:02,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:02,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:02,001 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-18 19:12:02,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:02,116 INFO L93 Difference]: Finished difference Result 918 states and 2567 transitions. [2019-12-18 19:12:02,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:12:02,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 19:12:02,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:02,123 INFO L225 Difference]: With dead ends: 918 [2019-12-18 19:12:02,123 INFO L226 Difference]: Without dead ends: 915 [2019-12-18 19: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 19:12:02,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-12-18 19:12:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 576. [2019-12-18 19:12:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-18 19:12:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-18 19:12:02,149 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-18 19:12:02,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:02,149 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-18 19:12:02,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-18 19:12:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:12:02,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:02,151 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:02,151 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 19:12:02,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:02,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1126341274, now seen corresponding path program 1 times [2019-12-18 19:12:02,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:02,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999643944] [2019-12-18 19:12:02,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:02,218 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 19:12:02,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999643944] [2019-12-18 19:12:02,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:02,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:02,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840970371] [2019-12-18 19:12:02,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:02,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:02,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:02,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:02,221 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-18 19:12:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:02,346 INFO L93 Difference]: Finished difference Result 952 states and 2666 transitions. [2019-12-18 19:12:02,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:12:02,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 19:12:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:02,354 INFO L225 Difference]: With dead ends: 952 [2019-12-18 19:12:02,354 INFO L226 Difference]: Without dead ends: 948 [2019-12-18 19:12:02,354 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 19:12:02,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-12-18 19:12:02,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 605. [2019-12-18 19:12:02,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 19:12:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-18 19:12:02,382 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-18 19:12:02,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:02,383 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-18 19:12:02,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-18 19:12:02,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:02,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:02,388 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:02,389 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 19:12:02,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:02,389 INFO L82 PathProgramCache]: Analyzing trace with hash -821622243, now seen corresponding path program 1 times [2019-12-18 19:12:02,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:02,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484945315] [2019-12-18 19:12:02,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:02,518 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 19:12:02,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484945315] [2019-12-18 19:12:02,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915449899] [2019-12-18 19:12:02,520 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 19:12:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:02,598 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:12:02,604 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:02,742 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 19:12:02,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:02,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 19:12:02,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482773286] [2019-12-18 19:12:02,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 19:12:02,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:02,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 19:12:02,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:12:02,745 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 18 states. [2019-12-18 19:12:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:03,708 INFO L93 Difference]: Finished difference Result 1315 states and 3284 transitions. [2019-12-18 19:12:03,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 19:12:03,709 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 19:12:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:03,717 INFO L225 Difference]: With dead ends: 1315 [2019-12-18 19:12:03,718 INFO L226 Difference]: Without dead ends: 1310 [2019-12-18 19:12:03,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1430, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 19:12:03,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2019-12-18 19:12:03,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 591. [2019-12-18 19:12:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-12-18 19:12:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1849 transitions. [2019-12-18 19:12:03,747 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1849 transitions. Word has length 15 [2019-12-18 19:12:03,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:03,748 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 1849 transitions. [2019-12-18 19:12:03,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 19:12:03,748 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1849 transitions. [2019-12-18 19:12:03,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:03,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:03,749 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:03,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:03,961 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 19:12:03,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:03,962 INFO L82 PathProgramCache]: Analyzing trace with hash 82199709, now seen corresponding path program 2 times [2019-12-18 19:12:03,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:03,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664133282] [2019-12-18 19:12:03,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:04,058 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 19:12:04,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664133282] [2019-12-18 19:12:04,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029388122] [2019-12-18 19:12:04,058 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 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 19:12:04,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:12:04,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:04,123 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:12:04,126 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:04,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:04,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 19:12:04,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676614028] [2019-12-18 19:12:04,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 19:12:04,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:04,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 19:12:04,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:12:04,246 INFO L87 Difference]: Start difference. First operand 591 states and 1849 transitions. Second operand 18 states. [2019-12-18 19:12:05,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:05,126 INFO L93 Difference]: Finished difference Result 1803 states and 4638 transitions. [2019-12-18 19:12:05,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:05,127 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 19:12:05,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:05,138 INFO L225 Difference]: With dead ends: 1803 [2019-12-18 19:12:05,138 INFO L226 Difference]: Without dead ends: 1798 [2019-12-18 19:12:05,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=373, Invalid=1267, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 19:12:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2019-12-18 19:12:05,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 540. [2019-12-18 19:12:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-12-18 19:12:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 1700 transitions. [2019-12-18 19:12:05,170 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 1700 transitions. Word has length 15 [2019-12-18 19:12:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:05,170 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 1700 transitions. [2019-12-18 19:12:05,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 19:12:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 1700 transitions. [2019-12-18 19:12:05,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:12:05,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:05,172 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:05,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:05,384 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 19:12:05,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:05,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1885947986, now seen corresponding path program 1 times [2019-12-18 19:12:05,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:05,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625944210] [2019-12-18 19:12:05,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:05,445 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 19:12:05,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625944210] [2019-12-18 19:12:05,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:05,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:05,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699414992] [2019-12-18 19:12:05,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:05,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:05,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:05,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:05,447 INFO L87 Difference]: Start difference. First operand 540 states and 1700 transitions. Second operand 5 states. [2019-12-18 19:12:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:05,547 INFO L93 Difference]: Finished difference Result 864 states and 2410 transitions. [2019-12-18 19:12:05,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:12:05,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 19:12:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:05,553 INFO L225 Difference]: With dead ends: 864 [2019-12-18 19:12:05,553 INFO L226 Difference]: Without dead ends: 856 [2019-12-18 19:12:05,554 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 19:12:05,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-12-18 19:12:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 549. [2019-12-18 19:12:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-18 19:12:05,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1686 transitions. [2019-12-18 19:12:05,573 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1686 transitions. Word has length 17 [2019-12-18 19:12:05,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:05,573 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1686 transitions. [2019-12-18 19:12:05,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:05,574 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1686 transitions. [2019-12-18 19:12:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:12:05,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:05,575 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:05,575 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 19:12:05,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:05,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1661426381, now seen corresponding path program 1 times [2019-12-18 19:12:05,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:05,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763745436] [2019-12-18 19:12:05,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:12:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:12:05,603 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:12:05,604 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:12:05,604 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 19:12:05,604 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-18 19:12:05,618 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,619 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,619 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,619 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,619 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,619 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,620 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,620 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,620 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,620 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,620 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,620 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,622 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,623 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,623 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,623 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,623 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,623 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,623 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,624 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,625 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,625 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,626 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,626 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,627 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,627 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,627 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,627 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,627 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,627 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,628 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,628 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,628 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,628 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,628 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,628 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,629 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,629 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,629 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,629 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,629 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,629 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,629 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,630 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,631 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,631 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,632 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,632 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,632 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,632 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,633 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,633 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,635 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,635 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,635 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,635 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,635 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,635 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,635 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,636 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,636 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,636 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,636 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,636 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,636 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,637 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,637 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,637 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,637 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,643 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,643 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,644 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,644 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,644 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,646 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,646 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,646 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,647 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,647 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,649 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,649 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,649 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,650 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,650 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,653 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,653 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,653 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,654 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,654 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,654 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,657 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,657 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,658 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,658 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,658 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,658 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,661 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,661 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,662 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,662 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,662 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,662 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,665 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,665 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,665 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,666 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,666 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,666 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:05,672 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 19:12:05,673 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:12:05,673 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:12:05,673 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:12:05,673 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:12:05,673 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:12:05,673 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:12:05,674 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:12:05,674 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:12:05,677 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 110 transitions [2019-12-18 19:12:05,677 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 123 places, 110 transitions [2019-12-18 19:12:05,709 INFO L126 PetriNetUnfolder]: 6/132 cut-off events. [2019-12-18 19:12:05,709 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:12:05,712 INFO L76 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 132 events. 6/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 235 event pairs. 56/176 useless extension candidates. Maximal degree in co-relation 152. Up to 10 conditions per place. [2019-12-18 19:12:05,718 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 123 places, 110 transitions [2019-12-18 19:12:05,744 INFO L126 PetriNetUnfolder]: 6/132 cut-off events. [2019-12-18 19:12:05,745 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:12:05,747 INFO L76 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 132 events. 6/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 235 event pairs. 56/176 useless extension candidates. Maximal degree in co-relation 152. Up to 10 conditions per place. [2019-12-18 19:12:05,752 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2192 [2019-12-18 19:12:05,752 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:12:07,308 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-18 19:12:07,720 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2220 [2019-12-18 19:12:07,721 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-18 19:12:07,721 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-18 19:12:07,835 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-18 19:12:07,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-18 19:12:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:12:07,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:07,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:12:07,837 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 19:12:07,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:07,838 INFO L82 PathProgramCache]: Analyzing trace with hash 792177, now seen corresponding path program 1 times [2019-12-18 19:12:07,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:07,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472080298] [2019-12-18 19:12:07,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:07,882 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 19:12:07,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472080298] [2019-12-18 19:12:07,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:07,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:12:07,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918119257] [2019-12-18 19:12:07,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:12:07,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:07,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:12:07,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:12:07,884 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-18 19:12:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:07,926 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-18 19:12:07,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:12:07,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:12:07,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:07,942 INFO L225 Difference]: With dead ends: 1889 [2019-12-18 19:12:07,942 INFO L226 Difference]: Without dead ends: 1767 [2019-12-18 19:12:07,943 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 19:12:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-18 19:12:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-18 19:12:07,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-18 19:12:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-18 19:12:08,005 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-18 19:12:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:08,005 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-18 19:12:08,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:12:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-18 19:12:08,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:12:08,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:08,006 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:08,006 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 19:12:08,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:08,006 INFO L82 PathProgramCache]: Analyzing trace with hash -982045597, now seen corresponding path program 1 times [2019-12-18 19:12:08,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:08,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210320946] [2019-12-18 19:12:08,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:08,048 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 19:12:08,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210320946] [2019-12-18 19:12:08,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:08,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:08,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422266793] [2019-12-18 19:12:08,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:08,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:08,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:08,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:08,050 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-18 19:12:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:08,149 INFO L93 Difference]: Finished difference Result 3302 states and 11435 transitions. [2019-12-18 19:12:08,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:12:08,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 19:12:08,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:08,174 INFO L225 Difference]: With dead ends: 3302 [2019-12-18 19:12:08,175 INFO L226 Difference]: Without dead ends: 3299 [2019-12-18 19:12:08,175 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 19:12:08,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2019-12-18 19:12:08,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 1914. [2019-12-18 19:12:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-18 19:12:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-18 19:12:08,253 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-18 19:12:08,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:08,253 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-18 19:12:08,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:08,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-18 19:12:08,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:12:08,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:08,254 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:08,254 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 19:12:08,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:08,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1476250518, now seen corresponding path program 1 times [2019-12-18 19:12:08,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:08,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250451414] [2019-12-18 19:12:08,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:08,292 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 19:12:08,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250451414] [2019-12-18 19:12:08,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:08,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:08,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138603631] [2019-12-18 19:12:08,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:08,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:08,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:08,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:08,294 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-18 19:12:08,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:08,395 INFO L93 Difference]: Finished difference Result 3604 states and 12619 transitions. [2019-12-18 19:12:08,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:12:08,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 19:12:08,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:08,430 INFO L225 Difference]: With dead ends: 3604 [2019-12-18 19:12:08,430 INFO L226 Difference]: Without dead ends: 3600 [2019-12-18 19:12:08,430 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 19:12:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3600 states. [2019-12-18 19:12:08,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3600 to 2147. [2019-12-18 19:12:08,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-18 19:12:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-18 19:12:08,509 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-18 19:12:08,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:08,510 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-18 19:12:08,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-18 19:12:08,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:08,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:08,511 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:08,511 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 19:12:08,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:08,512 INFO L82 PathProgramCache]: Analyzing trace with hash 65367165, now seen corresponding path program 1 times [2019-12-18 19:12:08,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:08,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024416441] [2019-12-18 19:12:08,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:08,604 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 19:12:08,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024416441] [2019-12-18 19:12:08,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373336719] [2019-12-18 19:12:08,605 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 19:12:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:08,720 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:12:08,722 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:08,826 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 19:12:08,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:08,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 19:12:08,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307593829] [2019-12-18 19:12:08,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 19:12:08,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:08,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 19:12:08,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:12:08,828 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 18 states. [2019-12-18 19:12:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:09,669 INFO L93 Difference]: Finished difference Result 6596 states and 21956 transitions. [2019-12-18 19:12:09,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 19:12:09,670 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 19:12:09,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:09,694 INFO L225 Difference]: With dead ends: 6596 [2019-12-18 19:12:09,694 INFO L226 Difference]: Without dead ends: 6592 [2019-12-18 19:12:09,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=284, Invalid=976, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 19:12:09,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6592 states. [2019-12-18 19:12:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6592 to 2291. [2019-12-18 19:12:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2019-12-18 19:12:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 9027 transitions. [2019-12-18 19:12:09,804 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 9027 transitions. Word has length 15 [2019-12-18 19:12:09,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:09,804 INFO L462 AbstractCegarLoop]: Abstraction has 2291 states and 9027 transitions. [2019-12-18 19:12:09,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 19:12:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 9027 transitions. [2019-12-18 19:12:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:09,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:09,806 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:10,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:10,019 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 19:12:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:10,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1209341565, now seen corresponding path program 2 times [2019-12-18 19:12:10,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:10,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948705194] [2019-12-18 19:12:10,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:10,110 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 19:12:10,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948705194] [2019-12-18 19:12:10,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759046867] [2019-12-18 19:12:10,111 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:10,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:12:10,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:10,192 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:12:10,193 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:10,365 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 19:12:10,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:10,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 19:12:10,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180719626] [2019-12-18 19:12:10,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 19:12:10,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:10,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 19:12:10,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:12:10,368 INFO L87 Difference]: Start difference. First operand 2291 states and 9027 transitions. Second operand 18 states. [2019-12-18 19:12:11,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:11,325 INFO L93 Difference]: Finished difference Result 7121 states and 23244 transitions. [2019-12-18 19:12:11,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 19:12:11,326 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 19:12:11,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:11,351 INFO L225 Difference]: With dead ends: 7121 [2019-12-18 19:12:11,351 INFO L226 Difference]: Without dead ends: 7117 [2019-12-18 19:12:11,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=340, Invalid=1142, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 19:12:11,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7117 states. [2019-12-18 19:12:11,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7117 to 2292. [2019-12-18 19:12:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2292 states. [2019-12-18 19:12:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 9029 transitions. [2019-12-18 19:12:11,468 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 9029 transitions. Word has length 15 [2019-12-18 19:12:11,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:11,469 INFO L462 AbstractCegarLoop]: Abstraction has 2292 states and 9029 transitions. [2019-12-18 19:12:11,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 19:12:11,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 9029 transitions. [2019-12-18 19:12:11,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:11,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:11,470 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:11,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:11,675 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 19:12:11,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:11,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1337558845, now seen corresponding path program 3 times [2019-12-18 19:12:11,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:11,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830710635] [2019-12-18 19:12:11,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:11,769 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 19:12:11,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830710635] [2019-12-18 19:12:11,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389846540] [2019-12-18 19:12:11,769 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:11,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 19:12:11,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:11,846 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:12:11,847 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:11,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:11,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 19:12:11,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638167699] [2019-12-18 19:12:11,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 19:12:11,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:11,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 19:12:11,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:12:11,954 INFO L87 Difference]: Start difference. First operand 2292 states and 9029 transitions. Second operand 18 states. [2019-12-18 19:12:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:12,866 INFO L93 Difference]: Finished difference Result 8074 states and 26184 transitions. [2019-12-18 19:12:12,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:12,867 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 19:12:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:12,886 INFO L225 Difference]: With dead ends: 8074 [2019-12-18 19:12:12,886 INFO L226 Difference]: Without dead ends: 8069 [2019-12-18 19:12:12,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=373, Invalid=1267, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 19:12:12,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8069 states. [2019-12-18 19:12:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8069 to 2253. [2019-12-18 19:12:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2019-12-18 19:12:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 8861 transitions. [2019-12-18 19:12:13,009 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 8861 transitions. Word has length 15 [2019-12-18 19:12:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:13,009 INFO L462 AbstractCegarLoop]: Abstraction has 2253 states and 8861 transitions. [2019-12-18 19:12:13,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 19:12:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 8861 transitions. [2019-12-18 19:12:13,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:13,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:13,010 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:13,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:13,215 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 19:12:13,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:13,216 INFO L82 PathProgramCache]: Analyzing trace with hash 46933139, now seen corresponding path program 4 times [2019-12-18 19:12:13,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:13,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803905820] [2019-12-18 19:12:13,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:13,289 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 19:12:13,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803905820] [2019-12-18 19:12:13,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565764962] [2019-12-18 19:12:13,290 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:13,363 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:12:13,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:13,364 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:12:13,365 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:13,469 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 19:12:13,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:13,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 19:12:13,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782130091] [2019-12-18 19:12:13,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 19:12:13,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:13,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 19:12:13,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:12:13,472 INFO L87 Difference]: Start difference. First operand 2253 states and 8861 transitions. Second operand 18 states. [2019-12-18 19:12:15,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:15,072 INFO L93 Difference]: Finished difference Result 12415 states and 40135 transitions. [2019-12-18 19:12:15,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 19:12:15,072 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 19:12:15,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:15,103 INFO L225 Difference]: With dead ends: 12415 [2019-12-18 19:12:15,103 INFO L226 Difference]: Without dead ends: 12411 [2019-12-18 19:12:15,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=722, Invalid=2700, Unknown=0, NotChecked=0, Total=3422 [2019-12-18 19:12:15,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12411 states. [2019-12-18 19:12:15,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12411 to 2148. [2019-12-18 19:12:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2148 states. [2019-12-18 19:12:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 8359 transitions. [2019-12-18 19:12:15,250 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 8359 transitions. Word has length 15 [2019-12-18 19:12:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:15,250 INFO L462 AbstractCegarLoop]: Abstraction has 2148 states and 8359 transitions. [2019-12-18 19:12:15,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 19:12:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 8359 transitions. [2019-12-18 19:12:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:15,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:15,251 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:15,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:15,458 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 19:12:15,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:15,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1190907539, now seen corresponding path program 5 times [2019-12-18 19:12:15,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:15,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312625780] [2019-12-18 19:12:15,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:15,555 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 19:12:15,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312625780] [2019-12-18 19:12:15,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353458250] [2019-12-18 19:12:15,556 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:15,635 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:12:15,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:15,636 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:12:15,639 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:15,758 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 19:12:15,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:15,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 19:12:15,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755203327] [2019-12-18 19:12:15,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 19:12:15,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:15,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 19:12:15,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:12:15,760 INFO L87 Difference]: Start difference. First operand 2148 states and 8359 transitions. Second operand 18 states. [2019-12-18 19:12:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:16,820 INFO L93 Difference]: Finished difference Result 6358 states and 20204 transitions. [2019-12-18 19:12:16,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:16,821 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 19:12:16,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:16,832 INFO L225 Difference]: With dead ends: 6358 [2019-12-18 19:12:16,833 INFO L226 Difference]: Without dead ends: 6354 [2019-12-18 19:12:16,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=369, Invalid=1353, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 19:12:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6354 states. [2019-12-18 19:12:16,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6354 to 2147. [2019-12-18 19:12:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-18 19:12:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8356 transitions. [2019-12-18 19:12:16,909 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8356 transitions. Word has length 15 [2019-12-18 19:12:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:16,910 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8356 transitions. [2019-12-18 19:12:16,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 19:12:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8356 transitions. [2019-12-18 19:12:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:16,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:16,911 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:17,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:17,114 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 19:12:17,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:17,114 INFO L82 PathProgramCache]: Analyzing trace with hash -526841521, now seen corresponding path program 6 times [2019-12-18 19:12:17,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:17,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827065578] [2019-12-18 19:12:17,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:17,178 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 19:12:17,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827065578] [2019-12-18 19:12:17,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289223117] [2019-12-18 19:12:17,179 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:17,244 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-18 19:12:17,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:17,245 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:12:17,246 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:17,337 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 19:12:17,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:17,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 19:12:17,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240100843] [2019-12-18 19:12:17,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 19:12:17,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:17,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 19:12:17,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:12:17,339 INFO L87 Difference]: Start difference. First operand 2147 states and 8356 transitions. Second operand 18 states. [2019-12-18 19:12:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:18,489 INFO L93 Difference]: Finished difference Result 6157 states and 19308 transitions. [2019-12-18 19:12:18,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 19:12:18,492 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 19:12:18,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:18,506 INFO L225 Difference]: With dead ends: 6157 [2019-12-18 19:12:18,507 INFO L226 Difference]: Without dead ends: 6153 [2019-12-18 19:12:18,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1430, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 19:12:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6153 states. [2019-12-18 19:12:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6153 to 1998. [2019-12-18 19:12:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-18 19:12:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-18 19:12:18,564 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-18 19:12:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:18,564 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-18 19:12:18,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 19:12:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-18 19:12:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:12:18,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:18,565 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:18,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:18,766 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 19:12:18,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:18,767 INFO L82 PathProgramCache]: Analyzing trace with hash -773481600, now seen corresponding path program 1 times [2019-12-18 19:12:18,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:18,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384262637] [2019-12-18 19:12:18,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:18,808 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 19:12:18,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384262637] [2019-12-18 19:12:18,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:18,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:18,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353137223] [2019-12-18 19:12:18,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:18,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:18,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:18,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:18,810 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-18 19:12:18,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:18,920 INFO L93 Difference]: Finished difference Result 3692 states and 13037 transitions. [2019-12-18 19:12:18,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:12:18,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 19:12:18,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:18,928 INFO L225 Difference]: With dead ends: 3692 [2019-12-18 19:12:18,928 INFO L226 Difference]: Without dead ends: 3684 [2019-12-18 19:12:18,928 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 19:12:18,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2019-12-18 19:12:18,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 2245. [2019-12-18 19:12:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-18 19:12:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-18 19:12:18,991 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-18 19:12:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:18,992 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-18 19:12:18,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-18 19:12:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:18,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:18,993 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:18,994 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 19:12:18,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:18,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2045174229, now seen corresponding path program 1 times [2019-12-18 19:12:18,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:18,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684532218] [2019-12-18 19:12:18,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:19,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684532218] [2019-12-18 19:12:19,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648478293] [2019-12-18 19:12:19,086 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 19:12:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:19,191 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 19:12:19,193 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:19,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:19,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 19:12:19,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512283035] [2019-12-18 19:12:19,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 19:12:19,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:19,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 19:12:19,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:12:19,391 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 20 states. [2019-12-18 19:12:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:20,738 INFO L93 Difference]: Finished difference Result 9631 states and 33006 transitions. [2019-12-18 19:12:20,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 19:12:20,738 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 19:12:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:20,757 INFO L225 Difference]: With dead ends: 9631 [2019-12-18 19:12:20,757 INFO L226 Difference]: Without dead ends: 9625 [2019-12-18 19:12:20,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=535, Invalid=1817, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 19:12:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9625 states. [2019-12-18 19:12:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9625 to 2467. [2019-12-18 19:12:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2019-12-18 19:12:20,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 9739 transitions. [2019-12-18 19:12:20,874 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 9739 transitions. Word has length 19 [2019-12-18 19:12:20,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:20,874 INFO L462 AbstractCegarLoop]: Abstraction has 2467 states and 9739 transitions. [2019-12-18 19:12:20,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 19:12:20,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 9739 transitions. [2019-12-18 19:12:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:20,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:20,876 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:21,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:21,080 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 19:12:21,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:21,081 INFO L82 PathProgramCache]: Analyzing trace with hash -902093559, now seen corresponding path program 2 times [2019-12-18 19:12:21,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:21,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853171449] [2019-12-18 19:12:21,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:21,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853171449] [2019-12-18 19:12:21,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394587342] [2019-12-18 19:12:21,172 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:21,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:12:21,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:21,238 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 19:12:21,239 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:21,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:21,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 19:12:21,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813724756] [2019-12-18 19:12:21,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 19:12:21,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:21,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 19:12:21,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:12:21,378 INFO L87 Difference]: Start difference. First operand 2467 states and 9739 transitions. Second operand 20 states. [2019-12-18 19:12:22,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:22,504 INFO L93 Difference]: Finished difference Result 6850 states and 23581 transitions. [2019-12-18 19:12:22,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 19:12:22,505 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 19:12:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:22,519 INFO L225 Difference]: With dead ends: 6850 [2019-12-18 19:12:22,519 INFO L226 Difference]: Without dead ends: 6842 [2019-12-18 19:12:22,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=441, Invalid=1539, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 19:12:22,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6842 states. [2019-12-18 19:12:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6842 to 2518. [2019-12-18 19:12:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2518 states. [2019-12-18 19:12:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 9974 transitions. [2019-12-18 19:12:22,644 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 9974 transitions. Word has length 19 [2019-12-18 19:12:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:22,644 INFO L462 AbstractCegarLoop]: Abstraction has 2518 states and 9974 transitions. [2019-12-18 19:12:22,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 19:12:22,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 9974 transitions. [2019-12-18 19:12:22,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:22,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:22,646 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:22,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:22,850 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 19:12:22,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:22,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1675124677, now seen corresponding path program 3 times [2019-12-18 19:12:22,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:22,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982913642] [2019-12-18 19:12:22,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:22,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982913642] [2019-12-18 19:12:22,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467340695] [2019-12-18 19:12:22,940 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:23,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 19:12:23,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:23,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 19:12:23,025 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:23,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:23,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 19:12:23,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017750366] [2019-12-18 19:12:23,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 19:12:23,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:23,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 19:12:23,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:12:23,168 INFO L87 Difference]: Start difference. First operand 2518 states and 9974 transitions. Second operand 20 states. [2019-12-18 19:12:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:24,696 INFO L93 Difference]: Finished difference Result 7202 states and 24414 transitions. [2019-12-18 19:12:24,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 19:12:24,697 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 19:12:24,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:24,712 INFO L225 Difference]: With dead ends: 7202 [2019-12-18 19:12:24,712 INFO L226 Difference]: Without dead ends: 7192 [2019-12-18 19:12:24,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=505, Invalid=1751, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 19:12:24,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7192 states. [2019-12-18 19:12:24,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7192 to 2526. [2019-12-18 19:12:24,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2526 states. [2019-12-18 19:12:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 9994 transitions. [2019-12-18 19:12:24,823 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 9994 transitions. Word has length 19 [2019-12-18 19:12:24,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:24,824 INFO L462 AbstractCegarLoop]: Abstraction has 2526 states and 9994 transitions. [2019-12-18 19:12:24,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 19:12:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 9994 transitions. [2019-12-18 19:12:24,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:24,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:24,826 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:25,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:25,037 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 19:12:25,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:25,038 INFO L82 PathProgramCache]: Analyzing trace with hash -287060421, now seen corresponding path program 1 times [2019-12-18 19:12:25,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:25,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064215293] [2019-12-18 19:12:25,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:25,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064215293] [2019-12-18 19:12:25,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014442293] [2019-12-18 19:12:25,123 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 19:12:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:25,203 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 19:12:25,204 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:25,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:25,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 19:12:25,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417017253] [2019-12-18 19:12:25,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 19:12:25,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:25,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 19:12:25,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:12:25,317 INFO L87 Difference]: Start difference. First operand 2526 states and 9994 transitions. Second operand 20 states. [2019-12-18 19:12:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:26,076 INFO L93 Difference]: Finished difference Result 6238 states and 22108 transitions. [2019-12-18 19:12:26,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:12:26,076 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 19:12:26,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:26,088 INFO L225 Difference]: With dead ends: 6238 [2019-12-18 19:12:26,088 INFO L226 Difference]: Without dead ends: 6229 [2019-12-18 19:12:26,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=858, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:26,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6229 states. [2019-12-18 19:12:26,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6229 to 2774. [2019-12-18 19:12:26,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2019-12-18 19:12:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 11179 transitions. [2019-12-18 19:12:26,193 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 11179 transitions. Word has length 19 [2019-12-18 19:12:26,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:26,193 INFO L462 AbstractCegarLoop]: Abstraction has 2774 states and 11179 transitions. [2019-12-18 19:12:26,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 19:12:26,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 11179 transitions. [2019-12-18 19:12:26,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:26,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:26,197 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:26,407 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:26,408 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 19:12:26,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:26,409 INFO L82 PathProgramCache]: Analyzing trace with hash -286456665, now seen corresponding path program 4 times [2019-12-18 19:12:26,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:26,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287304299] [2019-12-18 19:12:26,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:26,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287304299] [2019-12-18 19:12:26,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662465681] [2019-12-18 19:12:26,493 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 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 19:12:26,561 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:12:26,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:26,562 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 19:12:26,563 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:26,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:26,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 19:12:26,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143061133] [2019-12-18 19:12:26,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 19:12:26,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:26,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 19:12:26,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:12:26,688 INFO L87 Difference]: Start difference. First operand 2774 states and 11179 transitions. Second operand 20 states. [2019-12-18 19:12:27,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:27,525 INFO L93 Difference]: Finished difference Result 9226 states and 32233 transitions. [2019-12-18 19:12:27,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 19:12:27,525 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 19:12:27,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:27,542 INFO L225 Difference]: With dead ends: 9226 [2019-12-18 19:12:27,542 INFO L226 Difference]: Without dead ends: 9217 [2019-12-18 19:12:27,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=403, Invalid=1319, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 19:12:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9217 states. [2019-12-18 19:12:27,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9217 to 2779. [2019-12-18 19:12:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2779 states. [2019-12-18 19:12:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 11190 transitions. [2019-12-18 19:12:27,698 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 11190 transitions. Word has length 19 [2019-12-18 19:12:27,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:27,699 INFO L462 AbstractCegarLoop]: Abstraction has 2779 states and 11190 transitions. [2019-12-18 19:12:27,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 19:12:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 11190 transitions. [2019-12-18 19:12:27,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:27,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:27,701 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:27,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:27,904 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 19:12:27,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:27,905 INFO L82 PathProgramCache]: Analyzing trace with hash -286465221, now seen corresponding path program 2 times [2019-12-18 19:12:27,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:27,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712393216] [2019-12-18 19:12:27,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:28,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712393216] [2019-12-18 19:12:28,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932650350] [2019-12-18 19:12:28,001 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 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 19:12:28,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:12:28,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:28,073 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:12:28,074 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 19:12:28,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:28,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-18 19:12:28,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536140389] [2019-12-18 19:12:28,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 19:12:28,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:28,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 19:12:28,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:12:28,164 INFO L87 Difference]: Start difference. First operand 2779 states and 11190 transitions. Second operand 19 states. [2019-12-18 19:12:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:29,009 INFO L93 Difference]: Finished difference Result 5581 states and 19502 transitions. [2019-12-18 19:12:29,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 19:12:29,010 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-18 19:12:29,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:29,020 INFO L225 Difference]: With dead ends: 5581 [2019-12-18 19:12:29,020 INFO L226 Difference]: Without dead ends: 5572 [2019-12-18 19:12:29,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 19:12:29,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5572 states. [2019-12-18 19:12:29,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5572 to 2800. [2019-12-18 19:12:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2800 states. [2019-12-18 19:12:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 11271 transitions. [2019-12-18 19:12:29,079 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 11271 transitions. Word has length 19 [2019-12-18 19:12:29,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:29,079 INFO L462 AbstractCegarLoop]: Abstraction has 2800 states and 11271 transitions. [2019-12-18 19:12:29,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 19:12:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 11271 transitions. [2019-12-18 19:12:29,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:29,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:29,080 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:29,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:29,281 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 19:12:29,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:29,282 INFO L82 PathProgramCache]: Analyzing trace with hash 244420411, now seen corresponding path program 3 times [2019-12-18 19:12:29,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:29,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95119752] [2019-12-18 19:12:29,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:29,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95119752] [2019-12-18 19:12:29,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185243729] [2019-12-18 19:12:29,385 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 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 19:12:29,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 19:12:29,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:29,466 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 19:12:29,469 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:29,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:29,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 19:12:29,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353676177] [2019-12-18 19:12:29,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 19:12:29,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:29,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 19:12:29,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:12:29,658 INFO L87 Difference]: Start difference. First operand 2800 states and 11271 transitions. Second operand 20 states. [2019-12-18 19:12:30,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:30,631 INFO L93 Difference]: Finished difference Result 6966 states and 24484 transitions. [2019-12-18 19:12:30,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 19:12:30,632 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 19:12:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:30,730 INFO L225 Difference]: With dead ends: 6966 [2019-12-18 19:12:30,730 INFO L226 Difference]: Without dead ends: 6957 [2019-12-18 19:12:30,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=354, Invalid=1206, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 19:12:30,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6957 states. [2019-12-18 19:12:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6957 to 2951. [2019-12-18 19:12:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2951 states. [2019-12-18 19:12:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 12035 transitions. [2019-12-18 19:12:30,835 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 12035 transitions. Word has length 19 [2019-12-18 19:12:30,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:30,836 INFO L462 AbstractCegarLoop]: Abstraction has 2951 states and 12035 transitions. [2019-12-18 19:12:30,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 19:12:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 12035 transitions. [2019-12-18 19:12:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:30,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:30,839 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:31,042 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:31,043 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 19:12:31,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:31,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1118161091, now seen corresponding path program 4 times [2019-12-18 19:12:31,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:31,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103082493] [2019-12-18 19:12:31,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:31,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103082493] [2019-12-18 19:12:31,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087619072] [2019-12-18 19:12:31,131 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 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 19:12:31,197 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:12:31,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:31,198 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 19:12:31,199 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:31,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:31,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 19:12:31,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589521318] [2019-12-18 19:12:31,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 19:12:31,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:31,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 19:12:31,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:12:31,343 INFO L87 Difference]: Start difference. First operand 2951 states and 12035 transitions. Second operand 20 states. [2019-12-18 19:12:32,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:32,351 INFO L93 Difference]: Finished difference Result 6602 states and 22963 transitions. [2019-12-18 19:12:32,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:32,351 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 19:12:32,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:32,364 INFO L225 Difference]: With dead ends: 6602 [2019-12-18 19:12:32,365 INFO L226 Difference]: Without dead ends: 6593 [2019-12-18 19:12:32,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=423, Invalid=1469, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 19:12:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6593 states. [2019-12-18 19:12:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6593 to 2829. [2019-12-18 19:12:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2829 states. [2019-12-18 19:12:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 11387 transitions. [2019-12-18 19:12:32,435 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 11387 transitions. Word has length 19 [2019-12-18 19:12:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:32,435 INFO L462 AbstractCegarLoop]: Abstraction has 2829 states and 11387 transitions. [2019-12-18 19:12:32,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 19:12:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 11387 transitions. [2019-12-18 19:12:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:32,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:32,436 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:32,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:32,637 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]=== [2019-12-18 19:12:32,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:32,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1977035621, now seen corresponding path program 5 times [2019-12-18 19:12:32,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:32,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650650929] [2019-12-18 19:12:32,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:32,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650650929] [2019-12-18 19:12:32,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772410288] [2019-12-18 19:12:32,719 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:12:32,796 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 19:12:32,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:32,797 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:12:32,799 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:32,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:32,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-18 19:12:32,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391278068] [2019-12-18 19:12:32,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 19:12:32,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:32,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 19:12:32,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:12:32,970 INFO L87 Difference]: Start difference. First operand 2829 states and 11387 transitions. Second operand 19 states. [2019-12-18 19:12:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:34,697 INFO L93 Difference]: Finished difference Result 7580 states and 25385 transitions. [2019-12-18 19:12:34,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 19:12:34,697 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-18 19:12:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:34,712 INFO L225 Difference]: With dead ends: 7580 [2019-12-18 19:12:34,712 INFO L226 Difference]: Without dead ends: 7556 [2019-12-18 19:12:34,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=549, Invalid=1901, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 19:12:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7556 states. [2019-12-18 19:12:34,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7556 to 2498. [2019-12-18 19:12:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2498 states. [2019-12-18 19:12:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 9874 transitions. [2019-12-18 19:12:34,785 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 9874 transitions. Word has length 19 [2019-12-18 19:12:34,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:34,785 INFO L462 AbstractCegarLoop]: Abstraction has 2498 states and 9874 transitions. [2019-12-18 19:12:34,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 19:12:34,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 9874 transitions. [2019-12-18 19:12:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:34,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:34,786 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:34,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:34,988 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]=== [2019-12-18 19:12:34,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:34,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1004938431, now seen corresponding path program 5 times [2019-12-18 19:12:34,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:34,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008606157] [2019-12-18 19:12:34,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:35,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008606157] [2019-12-18 19:12:35,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203480212] [2019-12-18 19:12:35,074 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:12:35,168 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 19:12:35,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:35,168 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 19:12:35,169 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:35,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:35,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:35,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 19:12:35,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492538775] [2019-12-18 19:12:35,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 19:12:35,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:35,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 19:12:35,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:12:35,317 INFO L87 Difference]: Start difference. First operand 2498 states and 9874 transitions. Second operand 20 states. [2019-12-18 19:12:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:37,003 INFO L93 Difference]: Finished difference Result 11643 states and 40400 transitions. [2019-12-18 19:12:37,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 19:12:37,003 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 19:12:37,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:37,026 INFO L225 Difference]: With dead ends: 11643 [2019-12-18 19:12:37,026 INFO L226 Difference]: Without dead ends: 11634 [2019-12-18 19:12:37,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=768, Invalid=2892, Unknown=0, NotChecked=0, Total=3660 [2019-12-18 19:12:37,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11634 states. [2019-12-18 19:12:37,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11634 to 2444. [2019-12-18 19:12:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2444 states. [2019-12-18 19:12:37,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 9584 transitions. [2019-12-18 19:12:37,116 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 9584 transitions. Word has length 19 [2019-12-18 19:12:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:37,116 INFO L462 AbstractCegarLoop]: Abstraction has 2444 states and 9584 transitions. [2019-12-18 19:12:37,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 19:12:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 9584 transitions. [2019-12-18 19:12:37,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:37,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:37,118 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:37,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:37,322 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]=== [2019-12-18 19:12:37,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:37,323 INFO L82 PathProgramCache]: Analyzing trace with hash 138142239, now seen corresponding path program 6 times [2019-12-18 19:12:37,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:37,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246846040] [2019-12-18 19:12:37,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:37,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246846040] [2019-12-18 19:12:37,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134614897] [2019-12-18 19:12:37,425 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:12:37,500 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 19:12:37,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:37,501 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 19:12:37,502 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:37,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:37,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 19:12:37,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188732281] [2019-12-18 19:12:37,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 19:12:37,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:37,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 19:12:37,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:12:37,657 INFO L87 Difference]: Start difference. First operand 2444 states and 9584 transitions. Second operand 20 states. [2019-12-18 19:12:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:38,952 INFO L93 Difference]: Finished difference Result 6283 states and 21343 transitions. [2019-12-18 19:12:38,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 19:12:38,952 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 19:12:38,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:38,964 INFO L225 Difference]: With dead ends: 6283 [2019-12-18 19:12:38,964 INFO L226 Difference]: Without dead ends: 6274 [2019-12-18 19:12:38,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=445, Invalid=1625, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 19:12:38,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6274 states. [2019-12-18 19:12:39,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6274 to 2441. [2019-12-18 19:12:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2441 states. [2019-12-18 19:12:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 9573 transitions. [2019-12-18 19:12:39,024 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 9573 transitions. Word has length 19 [2019-12-18 19:12:39,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:39,024 INFO L462 AbstractCegarLoop]: Abstraction has 2441 states and 9573 transitions. [2019-12-18 19:12:39,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 19:12:39,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 9573 transitions. [2019-12-18 19:12:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:39,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:39,026 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:39,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:39,226 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]=== [2019-12-18 19:12:39,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:39,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1579606821, now seen corresponding path program 7 times [2019-12-18 19:12:39,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:39,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181631853] [2019-12-18 19:12:39,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:39,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181631853] [2019-12-18 19:12:39,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140418925] [2019-12-18 19:12:39,303 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:12:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:39,370 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 19:12:39,371 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:39,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:39,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 19:12:39,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033496986] [2019-12-18 19:12:39,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 19:12:39,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:39,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 19:12:39,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:12:39,503 INFO L87 Difference]: Start difference. First operand 2441 states and 9573 transitions. Second operand 20 states. [2019-12-18 19:12:41,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:41,069 INFO L93 Difference]: Finished difference Result 6551 states and 21720 transitions. [2019-12-18 19:12:41,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 19:12:41,069 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 19:12:41,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:41,081 INFO L225 Difference]: With dead ends: 6551 [2019-12-18 19:12:41,082 INFO L226 Difference]: Without dead ends: 6540 [2019-12-18 19:12:41,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=505, Invalid=1847, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 19:12:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6540 states. [2019-12-18 19:12:41,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6540 to 2413. [2019-12-18 19:12:41,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2413 states. [2019-12-18 19:12:41,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 9460 transitions. [2019-12-18 19:12:41,146 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 9460 transitions. Word has length 19 [2019-12-18 19:12:41,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:41,147 INFO L462 AbstractCegarLoop]: Abstraction has 2413 states and 9460 transitions. [2019-12-18 19:12:41,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 19:12:41,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 9460 transitions. [2019-12-18 19:12:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:41,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:41,148 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:41,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:41,352 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]=== [2019-12-18 19:12:41,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:41,353 INFO L82 PathProgramCache]: Analyzing trace with hash -87468871, now seen corresponding path program 8 times [2019-12-18 19:12:41,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:41,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623201411] [2019-12-18 19:12:41,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:41,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623201411] [2019-12-18 19:12:41,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144139575] [2019-12-18 19:12:41,444 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 19:12:41,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:12:41,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:41,513 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:12:41,513 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:41,625 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 19:12:41,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:41,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-18 19:12:41,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488277738] [2019-12-18 19:12:41,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 19:12:41,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:41,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 19:12:41,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:12:41,627 INFO L87 Difference]: Start difference. First operand 2413 states and 9460 transitions. Second operand 19 states. [2019-12-18 19:12:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:43,124 INFO L93 Difference]: Finished difference Result 6388 states and 21017 transitions. [2019-12-18 19:12:43,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 19:12:43,124 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-18 19:12:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:43,137 INFO L225 Difference]: With dead ends: 6388 [2019-12-18 19:12:43,137 INFO L226 Difference]: Without dead ends: 6382 [2019-12-18 19:12:43,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=503, Invalid=1947, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 19:12:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6382 states. [2019-12-18 19:12:43,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6382 to 2259. [2019-12-18 19:12:43,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2259 states. [2019-12-18 19:12:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 8835 transitions. [2019-12-18 19:12:43,255 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 8835 transitions. Word has length 19 [2019-12-18 19:12:43,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:43,256 INFO L462 AbstractCegarLoop]: Abstraction has 2259 states and 8835 transitions. [2019-12-18 19:12:43,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 19:12:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 8835 transitions. [2019-12-18 19:12:43,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:43,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:43,257 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 19:12:43,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:43,458 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]=== [2019-12-18 19:12:43,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:43,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1682002470, now seen corresponding path program 1 times [2019-12-18 19:12:43,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:43,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030669592] [2019-12-18 19:12:43,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:43,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030669592] [2019-12-18 19:12:43,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793062411] [2019-12-18 19:12:43,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 19:12:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:43,637 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:12:43,638 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:43,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:43,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:12:43,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093779274] [2019-12-18 19:12:43,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:12:43,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:43,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:12:43,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:12:43,883 INFO L87 Difference]: Start difference. First operand 2259 states and 8835 transitions. Second operand 24 states. [2019-12-18 19:12:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:47,860 INFO L93 Difference]: Finished difference Result 17049 states and 52657 transitions. [2019-12-18 19:12:47,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-12-18 19:12:47,861 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:12:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:47,887 INFO L225 Difference]: With dead ends: 17049 [2019-12-18 19:12:47,888 INFO L226 Difference]: Without dead ends: 17045 [2019-12-18 19:12:47,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4372 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2727, Invalid=10383, Unknown=0, NotChecked=0, Total=13110 [2019-12-18 19:12:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17045 states. [2019-12-18 19:12:47,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17045 to 2311. [2019-12-18 19:12:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2311 states. [2019-12-18 19:12:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 9078 transitions. [2019-12-18 19:12:48,005 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 9078 transitions. Word has length 21 [2019-12-18 19:12:48,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:48,005 INFO L462 AbstractCegarLoop]: Abstraction has 2311 states and 9078 transitions. [2019-12-18 19:12:48,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:12:48,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 9078 transitions. [2019-12-18 19:12:48,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:48,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:48,006 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 19:12:48,207 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:48,207 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]=== [2019-12-18 19:12:48,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:48,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1682597670, now seen corresponding path program 2 times [2019-12-18 19:12:48,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:48,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374356053] [2019-12-18 19:12:48,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:48,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374356053] [2019-12-18 19:12:48,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209894209] [2019-12-18 19:12:48,324 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 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 19:12:48,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:12:48,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:48,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:12:48,401 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:48,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:48,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:12:48,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832381519] [2019-12-18 19:12:48,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:12:48,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:48,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:12:48,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:12:48,546 INFO L87 Difference]: Start difference. First operand 2311 states and 9078 transitions. Second operand 24 states. [2019-12-18 19:12:52,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:52,113 INFO L93 Difference]: Finished difference Result 16849 states and 52108 transitions. [2019-12-18 19:12:52,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-12-18 19:12:52,114 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:12:52,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:52,148 INFO L225 Difference]: With dead ends: 16849 [2019-12-18 19:12:52,148 INFO L226 Difference]: Without dead ends: 16843 [2019-12-18 19:12:52,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4352 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2727, Invalid=10383, Unknown=0, NotChecked=0, Total=13110 [2019-12-18 19:12:52,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16843 states. [2019-12-18 19:12:52,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16843 to 2309. [2019-12-18 19:12:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2309 states. [2019-12-18 19:12:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 9072 transitions. [2019-12-18 19:12:52,283 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 9072 transitions. Word has length 21 [2019-12-18 19:12:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:52,283 INFO L462 AbstractCegarLoop]: Abstraction has 2309 states and 9072 transitions. [2019-12-18 19:12:52,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:12:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 9072 transitions. [2019-12-18 19:12:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:52,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:52,285 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 19:12:52,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:52,489 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]=== [2019-12-18 19:12:52,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:52,489 INFO L82 PathProgramCache]: Analyzing trace with hash 670898564, now seen corresponding path program 3 times [2019-12-18 19:12:52,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:52,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690201785] [2019-12-18 19:12:52,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:52,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690201785] [2019-12-18 19:12:52,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135530767] [2019-12-18 19:12:52,577 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 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 19:12:52,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 19:12:52,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:52,642 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:12:52,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:52,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:52,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:52,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:12:52,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536765544] [2019-12-18 19:12:52,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:12:52,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:52,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:12:52,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:12:52,786 INFO L87 Difference]: Start difference. First operand 2309 states and 9072 transitions. Second operand 24 states. [2019-12-18 19:12:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:56,455 INFO L93 Difference]: Finished difference Result 15997 states and 49097 transitions. [2019-12-18 19:12:56,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-12-18 19:12:56,455 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:12:56,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:56,482 INFO L225 Difference]: With dead ends: 15997 [2019-12-18 19:12:56,482 INFO L226 Difference]: Without dead ends: 15983 [2019-12-18 19:12:56,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5491 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2630, Invalid=12622, Unknown=0, NotChecked=0, Total=15252 [2019-12-18 19:12:56,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15983 states. [2019-12-18 19:12:56,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15983 to 2348. [2019-12-18 19:12:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2348 states. [2019-12-18 19:12:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 9252 transitions. [2019-12-18 19:12:56,592 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 9252 transitions. Word has length 21 [2019-12-18 19:12:56,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:56,593 INFO L462 AbstractCegarLoop]: Abstraction has 2348 states and 9252 transitions. [2019-12-18 19:12:56,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:12:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 9252 transitions. [2019-12-18 19:12:56,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:56,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:56,594 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 19:12:56,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:56,795 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]=== [2019-12-18 19:12:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:56,795 INFO L82 PathProgramCache]: Analyzing trace with hash 671493764, now seen corresponding path program 4 times [2019-12-18 19:12:56,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:56,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173090234] [2019-12-18 19:12:56,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:56,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:56,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173090234] [2019-12-18 19:12:56,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307836932] [2019-12-18 19:12:56,899 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 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 19:12:56,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:12:56,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:56,990 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:12:56,991 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:57,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:57,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:57,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:12:57,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128852206] [2019-12-18 19:12:57,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:12:57,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:57,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:12:57,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:12:57,246 INFO L87 Difference]: Start difference. First operand 2348 states and 9252 transitions. Second operand 24 states. [2019-12-18 19:13:00,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:00,895 INFO L93 Difference]: Finished difference Result 14430 states and 45115 transitions. [2019-12-18 19:13:00,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-12-18 19:13:00,896 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:13:00,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:00,922 INFO L225 Difference]: With dead ends: 14430 [2019-12-18 19:13:00,922 INFO L226 Difference]: Without dead ends: 14422 [2019-12-18 19:13:00,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3725 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2076, Invalid=9054, Unknown=0, NotChecked=0, Total=11130 [2019-12-18 19:13:00,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14422 states. [2019-12-18 19:13:01,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14422 to 2323. [2019-12-18 19:13:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2019-12-18 19:13:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 9145 transitions. [2019-12-18 19:13:01,028 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 9145 transitions. Word has length 21 [2019-12-18 19:13:01,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:01,029 INFO L462 AbstractCegarLoop]: Abstraction has 2323 states and 9145 transitions. [2019-12-18 19:13:01,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:13:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 9145 transitions. [2019-12-18 19:13:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:01,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:01,030 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 19:13:01,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:01,231 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]=== [2019-12-18 19:13:01,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:01,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1202379396, now seen corresponding path program 5 times [2019-12-18 19:13:01,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:01,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585211808] [2019-12-18 19:13:01,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:01,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:01,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585211808] [2019-12-18 19:13:01,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670638854] [2019-12-18 19:13:01,352 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:13:01,412 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 19:13:01,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:13:01,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:13:01,414 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:01,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:01,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:13:01,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332621713] [2019-12-18 19:13:01,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:13:01,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:01,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:13:01,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:13:01,559 INFO L87 Difference]: Start difference. First operand 2323 states and 9145 transitions. Second operand 24 states. [2019-12-18 19:13:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:06,893 INFO L93 Difference]: Finished difference Result 20287 states and 61616 transitions. [2019-12-18 19:13:06,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-12-18 19:13:06,894 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:13:06,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:06,935 INFO L225 Difference]: With dead ends: 20287 [2019-12-18 19:13:06,935 INFO L226 Difference]: Without dead ends: 20271 [2019-12-18 19:13:06,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10500 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4366, Invalid=22694, Unknown=0, NotChecked=0, Total=27060 [2019-12-18 19:13:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20271 states. [2019-12-18 19:13:07,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20271 to 2422. [2019-12-18 19:13:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2422 states. [2019-12-18 19:13:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 9627 transitions. [2019-12-18 19:13:07,094 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 9627 transitions. Word has length 21 [2019-12-18 19:13:07,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:07,094 INFO L462 AbstractCegarLoop]: Abstraction has 2422 states and 9627 transitions. [2019-12-18 19:13:07,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:13:07,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 9627 transitions. [2019-12-18 19:13:07,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:07,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:07,096 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 19:13:07,296 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:07,297 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]=== [2019-12-18 19:13:07,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:07,297 INFO L82 PathProgramCache]: Analyzing trace with hash -818506432, now seen corresponding path program 6 times [2019-12-18 19:13:07,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:07,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22067338] [2019-12-18 19:13:07,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:07,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22067338] [2019-12-18 19:13:07,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128489438] [2019-12-18 19:13:07,401 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:13:07,472 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 19:13:07,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:13:07,473 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:13:07,474 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:07,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:07,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:13:07,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848913420] [2019-12-18 19:13:07,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:13:07,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:07,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:13:07,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:13:07,614 INFO L87 Difference]: Start difference. First operand 2422 states and 9627 transitions. Second operand 24 states. [2019-12-18 19:13:12,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:12,157 INFO L93 Difference]: Finished difference Result 16146 states and 49018 transitions. [2019-12-18 19:13:12,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-12-18 19:13:12,157 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:13:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:12,186 INFO L225 Difference]: With dead ends: 16146 [2019-12-18 19:13:12,186 INFO L226 Difference]: Without dead ends: 16137 [2019-12-18 19:13:12,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8079 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3329, Invalid=17263, Unknown=0, NotChecked=0, Total=20592 [2019-12-18 19:13:12,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16137 states. [2019-12-18 19:13:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16137 to 2429. [2019-12-18 19:13:12,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2429 states. [2019-12-18 19:13:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 9652 transitions. [2019-12-18 19:13:12,301 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 9652 transitions. Word has length 21 [2019-12-18 19:13:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:12,301 INFO L462 AbstractCegarLoop]: Abstraction has 2429 states and 9652 transitions. [2019-12-18 19:13:12,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:13:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 9652 transitions. [2019-12-18 19:13:12,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:12,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:12,303 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 19:13:12,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:12,503 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]=== [2019-12-18 19:13:12,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:12,504 INFO L82 PathProgramCache]: Analyzing trace with hash -817911232, now seen corresponding path program 7 times [2019-12-18 19:13:12,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:12,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338395219] [2019-12-18 19:13:12,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:12,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338395219] [2019-12-18 19:13:12,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627578758] [2019-12-18 19:13:12,588 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:13:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:12,663 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:13:12,663 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:12,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:12,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:13:12,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964497457] [2019-12-18 19:13:12,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:13:12,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:12,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:13:12,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:13:12,809 INFO L87 Difference]: Start difference. First operand 2429 states and 9652 transitions. Second operand 24 states. [2019-12-18 19:13:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:16,691 INFO L93 Difference]: Finished difference Result 15056 states and 46587 transitions. [2019-12-18 19:13:16,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-12-18 19:13:16,691 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:13:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:16,719 INFO L225 Difference]: With dead ends: 15056 [2019-12-18 19:13:16,719 INFO L226 Difference]: Without dead ends: 15046 [2019-12-18 19:13:16,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5695 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2679, Invalid=12573, Unknown=0, NotChecked=0, Total=15252 [2019-12-18 19:13:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15046 states. [2019-12-18 19:13:16,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15046 to 2411. [2019-12-18 19:13:16,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2019-12-18 19:13:16,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 9575 transitions. [2019-12-18 19:13:16,839 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 9575 transitions. Word has length 21 [2019-12-18 19:13:16,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:16,839 INFO L462 AbstractCegarLoop]: Abstraction has 2411 states and 9575 transitions. [2019-12-18 19:13:16,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:13:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 9575 transitions. [2019-12-18 19:13:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:16,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:16,840 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 19:13:17,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:17,041 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]=== [2019-12-18 19:13:17,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:17,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1450662060, now seen corresponding path program 8 times [2019-12-18 19:13:17,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:17,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028008338] [2019-12-18 19:13:17,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:17,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028008338] [2019-12-18 19:13:17,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289559297] [2019-12-18 19:13:17,122 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 19:13:17,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:13:17,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:13:17,191 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:13:17,191 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:17,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:17,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:13:17,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897232419] [2019-12-18 19:13:17,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:13:17,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:17,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:13:17,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:13:17,357 INFO L87 Difference]: Start difference. First operand 2411 states and 9575 transitions. Second operand 24 states. [2019-12-18 19:13:23,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:23,871 INFO L93 Difference]: Finished difference Result 18846 states and 56797 transitions. [2019-12-18 19:13:23,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-12-18 19:13:23,872 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:13:23,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:23,902 INFO L225 Difference]: With dead ends: 18846 [2019-12-18 19:13:23,902 INFO L226 Difference]: Without dead ends: 18831 [2019-12-18 19:13:23,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13427 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5009, Invalid=28297, Unknown=0, NotChecked=0, Total=33306 [2019-12-18 19:13:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18831 states. [2019-12-18 19:13:24,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18831 to 2327. [2019-12-18 19:13:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2019-12-18 19:13:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 9155 transitions. [2019-12-18 19:13:24,023 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 9155 transitions. Word has length 21 [2019-12-18 19:13:24,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:24,023 INFO L462 AbstractCegarLoop]: Abstraction has 2327 states and 9155 transitions. [2019-12-18 19:13:24,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:13:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 9155 transitions. [2019-12-18 19:13:24,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:24,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:24,024 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 19:13:24,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:24,228 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]=== [2019-12-18 19:13:24,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:24,228 INFO L82 PathProgramCache]: Analyzing trace with hash 586715080, now seen corresponding path program 9 times [2019-12-18 19:13:24,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:24,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597188182] [2019-12-18 19:13:24,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:24,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597188182] [2019-12-18 19:13:24,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834445139] [2019-12-18 19:13:24,309 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 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 19:13:24,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 19:13:24,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:13:24,385 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:13:24,385 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:24,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:24,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-18 19:13:24,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138975128] [2019-12-18 19:13:24,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 19:13:24,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:24,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 19:13:24,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-12-18 19:13:24,527 INFO L87 Difference]: Start difference. First operand 2327 states and 9155 transitions. Second operand 23 states. [2019-12-18 19:13:28,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:28,551 INFO L93 Difference]: Finished difference Result 11985 states and 35942 transitions. [2019-12-18 19:13:28,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-12-18 19:13:28,551 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 19:13:28,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:28,569 INFO L225 Difference]: With dead ends: 11985 [2019-12-18 19:13:28,569 INFO L226 Difference]: Without dead ends: 11976 [2019-12-18 19:13:28,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6318 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2715, Invalid=14055, Unknown=0, NotChecked=0, Total=16770 [2019-12-18 19:13:28,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11976 states. [2019-12-18 19:13:28,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11976 to 2332. [2019-12-18 19:13:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2332 states. [2019-12-18 19:13:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 9185 transitions. [2019-12-18 19:13:28,660 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 9185 transitions. Word has length 21 [2019-12-18 19:13:28,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:28,660 INFO L462 AbstractCegarLoop]: Abstraction has 2332 states and 9185 transitions. [2019-12-18 19:13:28,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 19:13:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 9185 transitions. [2019-12-18 19:13:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:28,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:28,661 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 19:13:28,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:28,862 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]=== [2019-12-18 19:13:28,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:28,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1445589610, now seen corresponding path program 10 times [2019-12-18 19:13:28,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:28,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248265090] [2019-12-18 19:13:28,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:28,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248265090] [2019-12-18 19:13:28,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374543962] [2019-12-18 19:13:28,945 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 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 19:13:29,012 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:13:29,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:13:29,013 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:13:29,014 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:29,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:29,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-18 19:13:29,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248808502] [2019-12-18 19:13:29,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 19:13:29,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:29,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 19:13:29,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-12-18 19:13:29,144 INFO L87 Difference]: Start difference. First operand 2332 states and 9185 transitions. Second operand 23 states. [2019-12-18 19:13:33,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:33,196 INFO L93 Difference]: Finished difference Result 12278 states and 36913 transitions. [2019-12-18 19:13:33,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-12-18 19:13:33,197 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 19:13:33,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:33,216 INFO L225 Difference]: With dead ends: 12278 [2019-12-18 19:13:33,216 INFO L226 Difference]: Without dead ends: 12273 [2019-12-18 19:13:33,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6146 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2633, Invalid=13369, Unknown=0, NotChecked=0, Total=16002 [2019-12-18 19:13:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12273 states. [2019-12-18 19:13:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12273 to 2332. [2019-12-18 19:13:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2332 states. [2019-12-18 19:13:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 9185 transitions. [2019-12-18 19:13:33,306 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 9185 transitions. Word has length 21 [2019-12-18 19:13:33,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:33,306 INFO L462 AbstractCegarLoop]: Abstraction has 2332 states and 9185 transitions. [2019-12-18 19:13:33,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 19:13:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 9185 transitions. [2019-12-18 19:13:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:33,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:33,308 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:33,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:33,508 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]=== [2019-12-18 19:13:33,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:33,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1343161106, now seen corresponding path program 1 times [2019-12-18 19:13:33,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:33,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815812661] [2019-12-18 19:13:33,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:33,541 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 19:13:33,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815812661] [2019-12-18 19:13:33,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:33,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:13:33,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381545450] [2019-12-18 19:13:33,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:13:33,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:33,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:13:33,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:13:33,542 INFO L87 Difference]: Start difference. First operand 2332 states and 9185 transitions. Second operand 5 states. [2019-12-18 19:13:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:33,645 INFO L93 Difference]: Finished difference Result 3954 states and 14252 transitions. [2019-12-18 19:13:33,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:13:33,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 19:13:33,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:33,652 INFO L225 Difference]: With dead ends: 3954 [2019-12-18 19:13:33,652 INFO L226 Difference]: Without dead ends: 3938 [2019-12-18 19:13:33,652 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 19:13:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2019-12-18 19:13:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 2601. [2019-12-18 19:13:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2601 states. [2019-12-18 19:13:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 10077 transitions. [2019-12-18 19:13:33,695 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 10077 transitions. Word has length 21 [2019-12-18 19:13:33,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:33,695 INFO L462 AbstractCegarLoop]: Abstraction has 2601 states and 10077 transitions. [2019-12-18 19:13:33,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:13:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 10077 transitions. [2019-12-18 19:13:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:33,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:33,698 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 19:13:33,699 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]=== [2019-12-18 19:13:33,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:33,699 INFO L82 PathProgramCache]: Analyzing trace with hash -979520350, now seen corresponding path program 11 times [2019-12-18 19:13:33,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:33,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389464521] [2019-12-18 19:13:33,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:33,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389464521] [2019-12-18 19:13:33,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114633573] [2019-12-18 19:13:33,797 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:13:33,870 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 19:13:33,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:13:33,871 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:13:33,872 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:34,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:34,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:13:34,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359247318] [2019-12-18 19:13:34,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:13:34,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:34,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:13:34,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:13:34,011 INFO L87 Difference]: Start difference. First operand 2601 states and 10077 transitions. Second operand 24 states. [2019-12-18 19:13:36,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:36,491 INFO L93 Difference]: Finished difference Result 15951 states and 51064 transitions. [2019-12-18 19:13:36,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-12-18 19:13:36,492 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:13:36,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:36,521 INFO L225 Difference]: With dead ends: 15951 [2019-12-18 19:13:36,521 INFO L226 Difference]: Without dead ends: 15936 [2019-12-18 19:13:36,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2589 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1410, Invalid=6246, Unknown=0, NotChecked=0, Total=7656 [2019-12-18 19:13:36,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15936 states. [2019-12-18 19:13:36,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15936 to 2560. [2019-12-18 19:13:36,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2560 states. [2019-12-18 19:13:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 9859 transitions. [2019-12-18 19:13:36,696 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 9859 transitions. Word has length 21 [2019-12-18 19:13:36,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:36,696 INFO L462 AbstractCegarLoop]: Abstraction has 2560 states and 9859 transitions. [2019-12-18 19:13:36,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:13:36,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 9859 transitions. [2019-12-18 19:13:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:36,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:36,698 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 19:13:36,898 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:36,898 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]=== [2019-12-18 19:13:36,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:36,899 INFO L82 PathProgramCache]: Analyzing trace with hash -987138910, now seen corresponding path program 12 times [2019-12-18 19:13:36,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:36,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981702065] [2019-12-18 19:13:36,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:37,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981702065] [2019-12-18 19:13:37,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278689242] [2019-12-18 19:13:37,003 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:13:37,070 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 19:13:37,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:13:37,070 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:13:37,071 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:37,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:37,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:13:37,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404107401] [2019-12-18 19:13:37,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:13:37,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:37,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:13:37,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:13:37,210 INFO L87 Difference]: Start difference. First operand 2560 states and 9859 transitions. Second operand 24 states. [2019-12-18 19:13:39,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:39,508 INFO L93 Difference]: Finished difference Result 13295 states and 42191 transitions. [2019-12-18 19:13:39,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-18 19:13:39,508 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:13:39,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:39,535 INFO L225 Difference]: With dead ends: 13295 [2019-12-18 19:13:39,535 INFO L226 Difference]: Without dead ends: 13286 [2019-12-18 19:13:39,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1937 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1182, Invalid=4980, Unknown=0, NotChecked=0, Total=6162 [2019-12-18 19:13:39,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13286 states. [2019-12-18 19:13:39,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13286 to 2558. [2019-12-18 19:13:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2019-12-18 19:13:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 9852 transitions. [2019-12-18 19:13:39,646 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 9852 transitions. Word has length 21 [2019-12-18 19:13:39,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:39,647 INFO L462 AbstractCegarLoop]: Abstraction has 2558 states and 9852 transitions. [2019-12-18 19:13:39,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:13:39,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 9852 transitions. [2019-12-18 19:13:39,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:39,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:39,648 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 19:13:39,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:39,849 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]=== [2019-12-18 19:13:39,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:39,850 INFO L82 PathProgramCache]: Analyzing trace with hash -406937950, now seen corresponding path program 13 times [2019-12-18 19:13:39,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:39,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988780422] [2019-12-18 19:13:39,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:39,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988780422] [2019-12-18 19:13:39,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093225442] [2019-12-18 19:13:39,950 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:13:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:40,025 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:13:40,025 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:40,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:40,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:40,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:13:40,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833005192] [2019-12-18 19:13:40,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:13:40,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:40,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:13:40,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:13:40,172 INFO L87 Difference]: Start difference. First operand 2558 states and 9852 transitions. Second operand 24 states. [2019-12-18 19:13:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:43,445 INFO L93 Difference]: Finished difference Result 19063 states and 59545 transitions. [2019-12-18 19:13:43,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-12-18 19:13:43,446 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:13:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:43,486 INFO L225 Difference]: With dead ends: 19063 [2019-12-18 19:13:43,486 INFO L226 Difference]: Without dead ends: 19056 [2019-12-18 19:13:43,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4154 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2116, Invalid=9656, Unknown=0, NotChecked=0, Total=11772 [2019-12-18 19:13:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19056 states. [2019-12-18 19:13:43,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19056 to 2518. [2019-12-18 19:13:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2518 states. [2019-12-18 19:13:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 9680 transitions. [2019-12-18 19:13:43,630 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 9680 transitions. Word has length 21 [2019-12-18 19:13:43,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:43,631 INFO L462 AbstractCegarLoop]: Abstraction has 2518 states and 9680 transitions. [2019-12-18 19:13:43,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:13:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 9680 transitions. [2019-12-18 19:13:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:43,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:43,632 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 19:13:43,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:43,833 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]=== [2019-12-18 19:13:43,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:43,834 INFO L82 PathProgramCache]: Analyzing trace with hash -415151710, now seen corresponding path program 14 times [2019-12-18 19:13:43,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:43,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317687489] [2019-12-18 19:13:43,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:43,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317687489] [2019-12-18 19:13:43,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236382416] [2019-12-18 19:13:43,921 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 19:13:43,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:13:43,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:13:43,982 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:13:43,983 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:44,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:44,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:13:44,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656190631] [2019-12-18 19:13:44,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:13:44,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:44,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:13:44,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:13:44,115 INFO L87 Difference]: Start difference. First operand 2518 states and 9680 transitions. Second operand 24 states. [2019-12-18 19:13:47,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:47,262 INFO L93 Difference]: Finished difference Result 16308 states and 49886 transitions. [2019-12-18 19:13:47,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-12-18 19:13:47,263 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:13:47,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:47,289 INFO L225 Difference]: With dead ends: 16308 [2019-12-18 19:13:47,289 INFO L226 Difference]: Without dead ends: 16298 [2019-12-18 19:13:47,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4358 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2157, Invalid=10053, Unknown=0, NotChecked=0, Total=12210 [2019-12-18 19:13:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16298 states. [2019-12-18 19:13:47,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16298 to 2475. [2019-12-18 19:13:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2019-12-18 19:13:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 9501 transitions. [2019-12-18 19:13:47,402 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 9501 transitions. Word has length 21 [2019-12-18 19:13:47,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:47,403 INFO L462 AbstractCegarLoop]: Abstraction has 2475 states and 9501 transitions. [2019-12-18 19:13:47,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:13:47,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 9501 transitions. [2019-12-18 19:13:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:47,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:47,404 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 19:13:47,604 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:47,605 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]=== [2019-12-18 19:13:47,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:47,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1659307204, now seen corresponding path program 15 times [2019-12-18 19:13:47,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:47,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918168780] [2019-12-18 19:13:47,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:47,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918168780] [2019-12-18 19:13:47,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141814297] [2019-12-18 19:13:47,695 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 19:13:47,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 19:13:47,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:13:47,759 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:13:47,760 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:47,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:47,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:13:47,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442664727] [2019-12-18 19:13:47,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:13:47,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:47,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:13:47,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:13:47,905 INFO L87 Difference]: Start difference. First operand 2475 states and 9501 transitions. Second operand 24 states. [2019-12-18 19:13:51,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:51,656 INFO L93 Difference]: Finished difference Result 18693 states and 58623 transitions. [2019-12-18 19:13:51,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-12-18 19:13:51,657 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:13:51,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:51,693 INFO L225 Difference]: With dead ends: 18693 [2019-12-18 19:13:51,693 INFO L226 Difference]: Without dead ends: 18683 [2019-12-18 19:13:51,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5324 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2478, Invalid=12284, Unknown=0, NotChecked=0, Total=14762 [2019-12-18 19:13:51,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18683 states. [2019-12-18 19:13:51,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18683 to 2531. [2019-12-18 19:13:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2531 states. [2019-12-18 19:13:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 9759 transitions. [2019-12-18 19:13:51,826 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 9759 transitions. Word has length 21 [2019-12-18 19:13:51,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:51,826 INFO L462 AbstractCegarLoop]: Abstraction has 2531 states and 9759 transitions. [2019-12-18 19:13:51,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:13:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 9759 transitions. [2019-12-18 19:13:51,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:51,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:51,828 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 19:13:52,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:52,028 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]=== [2019-12-18 19:13:52,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:52,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1492579422, now seen corresponding path program 16 times [2019-12-18 19:13:52,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:52,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064129489] [2019-12-18 19:13:52,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:52,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064129489] [2019-12-18 19:13:52,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856554296] [2019-12-18 19:13:52,126 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 19:13:52,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:13:52,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:13:52,216 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:13:52,217 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:52,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:52,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:52,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:13:52,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49179508] [2019-12-18 19:13:52,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:13:52,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:52,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:13:52,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:13:52,360 INFO L87 Difference]: Start difference. First operand 2531 states and 9759 transitions. Second operand 24 states. [2019-12-18 19:13:57,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:57,225 INFO L93 Difference]: Finished difference Result 21288 states and 66116 transitions. [2019-12-18 19:13:57,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-12-18 19:13:57,226 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:13:57,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:57,268 INFO L225 Difference]: With dead ends: 21288 [2019-12-18 19:13:57,268 INFO L226 Difference]: Without dead ends: 21284 [2019-12-18 19:13:57,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8454 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3579, Invalid=18473, Unknown=0, NotChecked=0, Total=22052 [2019-12-18 19:13:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21284 states. [2019-12-18 19:13:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21284 to 2548. [2019-12-18 19:13:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2548 states. [2019-12-18 19:13:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 9832 transitions. [2019-12-18 19:13:57,421 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 9832 transitions. Word has length 21 [2019-12-18 19:13:57,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:57,421 INFO L462 AbstractCegarLoop]: Abstraction has 2548 states and 9832 transitions. [2019-12-18 19:13:57,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:13:57,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 9832 transitions. [2019-12-18 19:13:57,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:57,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:57,422 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 19:13:57,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:57,624 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]=== [2019-12-18 19:13:57,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:57,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1335167582, now seen corresponding path program 17 times [2019-12-18 19:13:57,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:57,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721999735] [2019-12-18 19:13:57,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:57,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:57,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721999735] [2019-12-18 19:13:57,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601896068] [2019-12-18 19:13:57,716 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:13:57,783 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 19:13:57,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:13:57,784 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:13:57,785 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:13:57,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:57,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:13:57,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779089885] [2019-12-18 19:13:57,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:13:57,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:57,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:13:57,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:13:57,919 INFO L87 Difference]: Start difference. First operand 2548 states and 9832 transitions. Second operand 24 states. [2019-12-18 19:14:00,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:00,836 INFO L93 Difference]: Finished difference Result 14142 states and 44431 transitions. [2019-12-18 19:14:00,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-12-18 19:14:00,837 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:14:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:00,860 INFO L225 Difference]: With dead ends: 14142 [2019-12-18 19:14:00,860 INFO L226 Difference]: Without dead ends: 14130 [2019-12-18 19:14:00,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3087 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1681, Invalid=7439, Unknown=0, NotChecked=0, Total=9120 [2019-12-18 19:14:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14130 states. [2019-12-18 19:14:00,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14130 to 2503. [2019-12-18 19:14:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2503 states. [2019-12-18 19:14:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2503 states and 9642 transitions. [2019-12-18 19:14:00,966 INFO L78 Accepts]: Start accepts. Automaton has 2503 states and 9642 transitions. Word has length 21 [2019-12-18 19:14:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:00,966 INFO L462 AbstractCegarLoop]: Abstraction has 2503 states and 9642 transitions. [2019-12-18 19:14:00,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:14:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 9642 transitions. [2019-12-18 19:14:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:14:00,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:00,968 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 19:14:01,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:01,171 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]=== [2019-12-18 19:14:01,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:01,171 INFO L82 PathProgramCache]: Analyzing trace with hash -489489332, now seen corresponding path program 18 times [2019-12-18 19:14:01,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:01,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475177995] [2019-12-18 19:14:01,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:01,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475177995] [2019-12-18 19:14:01,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880489899] [2019-12-18 19:14:01,267 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:14:01,341 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 19:14:01,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:01,342 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:14:01,342 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:01,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:01,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:14:01,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529063546] [2019-12-18 19:14:01,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:14:01,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:01,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:14:01,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:14:01,488 INFO L87 Difference]: Start difference. First operand 2503 states and 9642 transitions. Second operand 24 states. [2019-12-18 19:14:06,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:06,236 INFO L93 Difference]: Finished difference Result 17125 states and 52678 transitions. [2019-12-18 19:14:06,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-12-18 19:14:06,236 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:14:06,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:06,266 INFO L225 Difference]: With dead ends: 17125 [2019-12-18 19:14:06,266 INFO L226 Difference]: Without dead ends: 17115 [2019-12-18 19:14:06,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6084 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2900, Invalid=14130, Unknown=0, NotChecked=0, Total=17030 [2019-12-18 19:14:06,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17115 states. [2019-12-18 19:14:06,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17115 to 2513. [2019-12-18 19:14:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-12-18 19:14:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 9683 transitions. [2019-12-18 19:14:06,383 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 9683 transitions. Word has length 21 [2019-12-18 19:14:06,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:06,383 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 9683 transitions. [2019-12-18 19:14:06,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:14:06,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 9683 transitions. [2019-12-18 19:14:06,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:14:06,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:06,385 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 19:14:06,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:06,585 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]=== [2019-12-18 19:14:06,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:06,586 INFO L82 PathProgramCache]: Analyzing trace with hash 653591338, now seen corresponding path program 19 times [2019-12-18 19:14:06,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:06,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290752986] [2019-12-18 19:14:06,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:06,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290752986] [2019-12-18 19:14:06,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582333244] [2019-12-18 19:14:06,679 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:06,746 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:14:06,747 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:06,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:06,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:14:06,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862585453] [2019-12-18 19:14:06,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:14:06,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:06,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:14:06,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:14:06,896 INFO L87 Difference]: Start difference. First operand 2513 states and 9683 transitions. Second operand 24 states. [2019-12-18 19:14:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:12,238 INFO L93 Difference]: Finished difference Result 20020 states and 60843 transitions. [2019-12-18 19:14:12,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-12-18 19:14:12,238 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:14:12,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:12,273 INFO L225 Difference]: With dead ends: 20020 [2019-12-18 19:14:12,273 INFO L226 Difference]: Without dead ends: 20012 [2019-12-18 19:14:12,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10655 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4446, Invalid=22944, Unknown=0, NotChecked=0, Total=27390 [2019-12-18 19:14:12,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20012 states. [2019-12-18 19:14:12,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20012 to 2553. [2019-12-18 19:14:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-12-18 19:14:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 9855 transitions. [2019-12-18 19:14:12,413 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 9855 transitions. Word has length 21 [2019-12-18 19:14:12,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:12,413 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 9855 transitions. [2019-12-18 19:14:12,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:14:12,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 9855 transitions. [2019-12-18 19:14:12,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:14:12,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:12,414 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 19:14:12,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:12,615 INFO L410 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:14:12,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:12,616 INFO L82 PathProgramCache]: Analyzing trace with hash 811003178, now seen corresponding path program 20 times [2019-12-18 19:14:12,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:12,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565421963] [2019-12-18 19:14:12,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:12,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565421963] [2019-12-18 19:14:12,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088345479] [2019-12-18 19:14:12,703 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:12,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:14:12,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:12,768 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:14:12,768 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:12,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:12,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:14:12,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698449998] [2019-12-18 19:14:12,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:14:12,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:12,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:14:12,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:14:12,907 INFO L87 Difference]: Start difference. First operand 2553 states and 9855 transitions. Second operand 24 states. [2019-12-18 19:14:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:16,192 INFO L93 Difference]: Finished difference Result 12600 states and 38777 transitions. [2019-12-18 19:14:16,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-12-18 19:14:16,193 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:14:16,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:16,218 INFO L225 Difference]: With dead ends: 12600 [2019-12-18 19:14:16,218 INFO L226 Difference]: Without dead ends: 12588 [2019-12-18 19:14:16,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3793 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2039, Invalid=9091, Unknown=0, NotChecked=0, Total=11130 [2019-12-18 19:14:16,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12588 states. [2019-12-18 19:14:16,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12588 to 2459. [2019-12-18 19:14:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2459 states. [2019-12-18 19:14:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 9444 transitions. [2019-12-18 19:14:16,328 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 9444 transitions. Word has length 21 [2019-12-18 19:14:16,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:16,328 INFO L462 AbstractCegarLoop]: Abstraction has 2459 states and 9444 transitions. [2019-12-18 19:14:16,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:14:16,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 9444 transitions. [2019-12-18 19:14:16,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:14:16,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:16,330 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 19:14:16,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:16,534 INFO L410 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:14:16,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:16,534 INFO L82 PathProgramCache]: Analyzing trace with hash 255213166, now seen corresponding path program 21 times [2019-12-18 19:14:16,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:16,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465920101] [2019-12-18 19:14:16,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:16,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:16,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465920101] [2019-12-18 19:14:16,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926925109] [2019-12-18 19:14:16,619 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:16,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 19:14:16,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:16,688 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:14:16,689 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:16,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:16,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:14:16,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294720089] [2019-12-18 19:14:16,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:14:16,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:16,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:14:16,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:14:16,837 INFO L87 Difference]: Start difference. First operand 2459 states and 9444 transitions. Second operand 24 states. [2019-12-18 19:14:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:23,294 INFO L93 Difference]: Finished difference Result 18582 states and 55698 transitions. [2019-12-18 19:14:23,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-12-18 19:14:23,295 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:14:23,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:23,327 INFO L225 Difference]: With dead ends: 18582 [2019-12-18 19:14:23,327 INFO L226 Difference]: Without dead ends: 18575 [2019-12-18 19:14:23,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14530 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5259, Invalid=30273, Unknown=0, NotChecked=0, Total=35532 [2019-12-18 19:14:23,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18575 states. [2019-12-18 19:14:23,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18575 to 2434. [2019-12-18 19:14:23,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2019-12-18 19:14:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 9333 transitions. [2019-12-18 19:14:23,465 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 9333 transitions. Word has length 21 [2019-12-18 19:14:23,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:23,466 INFO L462 AbstractCegarLoop]: Abstraction has 2434 states and 9333 transitions. [2019-12-18 19:14:23,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:14:23,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 9333 transitions. [2019-12-18 19:14:23,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:14:23,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:23,467 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 19:14:23,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:23,669 INFO L410 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:14:23,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:23,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1555705676, now seen corresponding path program 22 times [2019-12-18 19:14:23,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:23,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308925127] [2019-12-18 19:14:23,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:23,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:23,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308925127] [2019-12-18 19:14:23,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282100990] [2019-12-18 19:14:23,763 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:23,830 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:14:23,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:23,831 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:14:23,831 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:23,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:23,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:14:23,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916192376] [2019-12-18 19:14:23,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:14:23,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:23,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:14:23,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:14:23,979 INFO L87 Difference]: Start difference. First operand 2434 states and 9333 transitions. Second operand 24 states. [2019-12-18 19:14:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:28,156 INFO L93 Difference]: Finished difference Result 13277 states and 40283 transitions. [2019-12-18 19:14:28,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-12-18 19:14:28,156 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:14:28,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:28,178 INFO L225 Difference]: With dead ends: 13277 [2019-12-18 19:14:28,179 INFO L226 Difference]: Without dead ends: 13267 [2019-12-18 19:14:28,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5850 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2692, Invalid=12808, Unknown=0, NotChecked=0, Total=15500 [2019-12-18 19:14:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13267 states. [2019-12-18 19:14:28,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13267 to 2361. [2019-12-18 19:14:28,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2361 states. [2019-12-18 19:14:28,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 9038 transitions. [2019-12-18 19:14:28,276 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 9038 transitions. Word has length 21 [2019-12-18 19:14:28,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:28,277 INFO L462 AbstractCegarLoop]: Abstraction has 2361 states and 9038 transitions. [2019-12-18 19:14:28,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:14:28,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 9038 transitions. [2019-12-18 19:14:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:14:28,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:28,278 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 19:14:28,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:28,479 INFO L410 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:14:28,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:28,479 INFO L82 PathProgramCache]: Analyzing trace with hash 236779140, now seen corresponding path program 23 times [2019-12-18 19:14:28,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:28,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173622864] [2019-12-18 19:14:28,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:28,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173622864] [2019-12-18 19:14:28,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013310109] [2019-12-18 19:14:28,575 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:28,668 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 19:14:28,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:28,669 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:14:28,670 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:28,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:28,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:14:28,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398048873] [2019-12-18 19:14:28,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:14:28,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:28,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:14:28,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:14:28,860 INFO L87 Difference]: Start difference. First operand 2361 states and 9038 transitions. Second operand 24 states. [2019-12-18 19:14:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:35,370 INFO L93 Difference]: Finished difference Result 23694 states and 71543 transitions. [2019-12-18 19:14:35,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2019-12-18 19:14:35,370 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:14:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:35,412 INFO L225 Difference]: With dead ends: 23694 [2019-12-18 19:14:35,412 INFO L226 Difference]: Without dead ends: 23685 [2019-12-18 19:14:35,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16133 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6860, Invalid=32146, Unknown=0, NotChecked=0, Total=39006 [2019-12-18 19:14:35,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23685 states. [2019-12-18 19:14:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23685 to 2337. [2019-12-18 19:14:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2337 states. [2019-12-18 19:14:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 8931 transitions. [2019-12-18 19:14:35,575 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 8931 transitions. Word has length 21 [2019-12-18 19:14:35,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:35,575 INFO L462 AbstractCegarLoop]: Abstraction has 2337 states and 8931 transitions. [2019-12-18 19:14:35,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:14:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 8931 transitions. [2019-12-18 19:14:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:14:35,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:35,576 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 19:14:35,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:35,777 INFO L410 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:14:35,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:35,778 INFO L82 PathProgramCache]: Analyzing trace with hash -337889250, now seen corresponding path program 24 times [2019-12-18 19:14:35,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:35,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782445197] [2019-12-18 19:14:35,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:35,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782445197] [2019-12-18 19:14:35,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996791780] [2019-12-18 19:14:35,884 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:35,965 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 19:14:35,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:35,966 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:14:35,967 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:36,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:36,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-18 19:14:36,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072392240] [2019-12-18 19:14:36,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 19:14:36,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:36,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 19:14:36,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-12-18 19:14:36,116 INFO L87 Difference]: Start difference. First operand 2337 states and 8931 transitions. Second operand 23 states. [2019-12-18 19:14:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:40,181 INFO L93 Difference]: Finished difference Result 11571 states and 34108 transitions. [2019-12-18 19:14:40,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-12-18 19:14:40,181 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 19:14:40,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:40,200 INFO L225 Difference]: With dead ends: 11571 [2019-12-18 19:14:40,201 INFO L226 Difference]: Without dead ends: 11566 [2019-12-18 19:14:40,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6899 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2919, Invalid=14903, Unknown=0, NotChecked=0, Total=17822 [2019-12-18 19:14:40,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11566 states. [2019-12-18 19:14:40,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11566 to 2335. [2019-12-18 19:14:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2335 states. [2019-12-18 19:14:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 8925 transitions. [2019-12-18 19:14:40,338 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 8925 transitions. Word has length 21 [2019-12-18 19:14:40,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:40,338 INFO L462 AbstractCegarLoop]: Abstraction has 2335 states and 8925 transitions. [2019-12-18 19:14:40,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 19:14:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 8925 transitions. [2019-12-18 19:14:40,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:14:40,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:40,339 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 19:14:40,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:40,540 INFO L410 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:14:40,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:40,541 INFO L82 PathProgramCache]: Analyzing trace with hash 621224380, now seen corresponding path program 25 times [2019-12-18 19:14:40,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:40,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069608852] [2019-12-18 19:14:40,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:40,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069608852] [2019-12-18 19:14:40,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261917119] [2019-12-18 19:14:40,643 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:40,709 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:14:40,710 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:40,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:40,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:14:40,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784043931] [2019-12-18 19:14:40,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:14:40,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:40,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:14:40,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:14:40,861 INFO L87 Difference]: Start difference. First operand 2335 states and 8925 transitions. Second operand 24 states. [2019-12-18 19:14:46,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:46,456 INFO L93 Difference]: Finished difference Result 24068 states and 75584 transitions. [2019-12-18 19:14:46,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-12-18 19:14:46,457 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:14:46,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:46,500 INFO L225 Difference]: With dead ends: 24068 [2019-12-18 19:14:46,500 INFO L226 Difference]: Without dead ends: 24061 [2019-12-18 19:14:46,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10912 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5105, Invalid=23287, Unknown=0, NotChecked=0, Total=28392 [2019-12-18 19:14:46,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24061 states. [2019-12-18 19:14:46,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24061 to 2331. [2019-12-18 19:14:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2331 states. [2019-12-18 19:14:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 2331 states and 8915 transitions. [2019-12-18 19:14:46,662 INFO L78 Accepts]: Start accepts. Automaton has 2331 states and 8915 transitions. Word has length 21 [2019-12-18 19:14:46,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:46,662 INFO L462 AbstractCegarLoop]: Abstraction has 2331 states and 8915 transitions. [2019-12-18 19:14:46,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:14:46,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 8915 transitions. [2019-12-18 19:14:46,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:14:46,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:46,664 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 19:14:46,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:46,865 INFO L410 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:14:46,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:46,866 INFO L82 PathProgramCache]: Analyzing trace with hash 621819580, now seen corresponding path program 26 times [2019-12-18 19:14:46,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:46,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974798286] [2019-12-18 19:14:46,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:46,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974798286] [2019-12-18 19:14:46,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626330227] [2019-12-18 19:14:46,972 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:47,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:14:47,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:47,051 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:14:47,053 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:47,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:47,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:14:47,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835775322] [2019-12-18 19:14:47,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:14:47,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:47,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:14:47,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:14:47,222 INFO L87 Difference]: Start difference. First operand 2331 states and 8915 transitions. Second operand 24 states. [2019-12-18 19:14:52,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:52,666 INFO L93 Difference]: Finished difference Result 22747 states and 71581 transitions. [2019-12-18 19:14:52,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-12-18 19:14:52,666 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:14:52,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:52,707 INFO L225 Difference]: With dead ends: 22747 [2019-12-18 19:14:52,708 INFO L226 Difference]: Without dead ends: 22738 [2019-12-18 19:14:52,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9659 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4688, Invalid=21072, Unknown=0, NotChecked=0, Total=25760 [2019-12-18 19:14:52,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22738 states. [2019-12-18 19:14:52,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22738 to 2248. [2019-12-18 19:14:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2019-12-18 19:14:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 8554 transitions. [2019-12-18 19:14:52,864 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 8554 transitions. Word has length 21 [2019-12-18 19:14:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:52,864 INFO L462 AbstractCegarLoop]: Abstraction has 2248 states and 8554 transitions. [2019-12-18 19:14:52,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:14:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 8554 transitions. [2019-12-18 19:14:52,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:14:52,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:52,866 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 19:14:53,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:53,067 INFO L410 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:14:53,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:53,067 INFO L82 PathProgramCache]: Analyzing trace with hash -389879526, now seen corresponding path program 27 times [2019-12-18 19:14:53,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:53,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041516982] [2019-12-18 19:14:53,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:53,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041516982] [2019-12-18 19:14:53,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929807850] [2019-12-18 19:14:53,162 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:53,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 19:14:53,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:53,229 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:14:53,230 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:53,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:53,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:14:53,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762257135] [2019-12-18 19:14:53,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:14:53,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:53,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:14:53,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:14:53,385 INFO L87 Difference]: Start difference. First operand 2248 states and 8554 transitions. Second operand 24 states. [2019-12-18 19:14:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:57,148 INFO L93 Difference]: Finished difference Result 14023 states and 42219 transitions. [2019-12-18 19:14:57,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-12-18 19:14:57,148 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:14:57,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:57,172 INFO L225 Difference]: With dead ends: 14023 [2019-12-18 19:14:57,172 INFO L226 Difference]: Without dead ends: 14017 [2019-12-18 19:14:57,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5584 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2666, Invalid=13084, Unknown=0, NotChecked=0, Total=15750 [2019-12-18 19:14:57,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14017 states. [2019-12-18 19:14:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14017 to 2267. [2019-12-18 19:14:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-18 19:14:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8634 transitions. [2019-12-18 19:14:57,273 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8634 transitions. Word has length 21 [2019-12-18 19:14:57,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:57,273 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8634 transitions. [2019-12-18 19:14:57,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:14:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8634 transitions. [2019-12-18 19:14:57,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:14:57,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:57,274 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 19:14:57,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:57,475 INFO L410 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:14:57,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:57,476 INFO L82 PathProgramCache]: Analyzing trace with hash -389284326, now seen corresponding path program 28 times [2019-12-18 19:14:57,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:57,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955277226] [2019-12-18 19:14:57,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:57,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955277226] [2019-12-18 19:14:57,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440977869] [2019-12-18 19:14:57,582 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:57,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:14:57,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:57,658 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:14:57,658 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:14:57,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:57,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:14:57,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608104671] [2019-12-18 19:14:57,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:14:57,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:57,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:14:57,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:14:57,826 INFO L87 Difference]: Start difference. First operand 2267 states and 8634 transitions. Second operand 24 states. [2019-12-18 19:15:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:01,097 INFO L93 Difference]: Finished difference Result 12677 states and 38921 transitions. [2019-12-18 19:15:01,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-12-18 19:15:01,097 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:15:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:01,119 INFO L225 Difference]: With dead ends: 12677 [2019-12-18 19:15:01,119 INFO L226 Difference]: Without dead ends: 12670 [2019-12-18 19:15:01,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3792 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2101, Invalid=9455, Unknown=0, NotChecked=0, Total=11556 [2019-12-18 19:15:01,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12670 states. [2019-12-18 19:15:01,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12670 to 2249. [2019-12-18 19:15:01,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2249 states. [2019-12-18 19:15:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 8557 transitions. [2019-12-18 19:15:01,220 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 8557 transitions. Word has length 21 [2019-12-18 19:15:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:01,220 INFO L462 AbstractCegarLoop]: Abstraction has 2249 states and 8557 transitions. [2019-12-18 19:15:01,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:15:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 8557 transitions. [2019-12-18 19:15:01,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:15:01,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:01,221 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 19:15:01,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:01,422 INFO L410 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:15:01,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:01,422 INFO L82 PathProgramCache]: Analyzing trace with hash 141601306, now seen corresponding path program 29 times [2019-12-18 19:15:01,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:01,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142006861] [2019-12-18 19:15:01,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:01,515 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:01,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142006861] [2019-12-18 19:15:01,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783141243] [2019-12-18 19:15:01,516 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:01,582 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 19:15:01,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:15:01,583 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:15:01,584 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:15:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:01,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:15:01,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:15:01,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422367198] [2019-12-18 19:15:01,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:15:01,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:01,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:15:01,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:15:01,739 INFO L87 Difference]: Start difference. First operand 2249 states and 8557 transitions. Second operand 24 states. [2019-12-18 19:15:07,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:07,468 INFO L93 Difference]: Finished difference Result 17894 states and 53668 transitions. [2019-12-18 19:15:07,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-12-18 19:15:07,469 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:15:07,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:07,498 INFO L225 Difference]: With dead ends: 17894 [2019-12-18 19:15:07,499 INFO L226 Difference]: Without dead ends: 17883 [2019-12-18 19:15:07,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10760 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4487, Invalid=23569, Unknown=0, NotChecked=0, Total=28056 [2019-12-18 19:15:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17883 states. [2019-12-18 19:15:07,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17883 to 2288. [2019-12-18 19:15:07,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2288 states. [2019-12-18 19:15:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 8718 transitions. [2019-12-18 19:15:07,623 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 8718 transitions. Word has length 21 [2019-12-18 19:15:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:07,623 INFO L462 AbstractCegarLoop]: Abstraction has 2288 states and 8718 transitions. [2019-12-18 19:15:07,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:15:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 8718 transitions. [2019-12-18 19:15:07,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:15:07,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:07,625 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 19:15:07,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:07,827 INFO L410 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:15:07,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:07,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1879284522, now seen corresponding path program 30 times [2019-12-18 19:15:07,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:07,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048118974] [2019-12-18 19:15:07,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:07,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048118974] [2019-12-18 19:15:07,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245738450] [2019-12-18 19:15:07,924 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:07,990 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 19:15:07,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:15:07,991 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:15:07,991 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:15:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:08,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:15:08,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:15:08,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15724304] [2019-12-18 19:15:08,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:15:08,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:08,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:15:08,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:15:08,177 INFO L87 Difference]: Start difference. First operand 2288 states and 8718 transitions. Second operand 24 states. [2019-12-18 19:15:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:13,644 INFO L93 Difference]: Finished difference Result 14223 states and 42268 transitions. [2019-12-18 19:15:13,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-12-18 19:15:13,645 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:15:13,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:13,669 INFO L225 Difference]: With dead ends: 14223 [2019-12-18 19:15:13,669 INFO L226 Difference]: Without dead ends: 14214 [2019-12-18 19:15:13,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8336 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3428, Invalid=18034, Unknown=0, NotChecked=0, Total=21462 [2019-12-18 19:15:13,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14214 states. [2019-12-18 19:15:13,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14214 to 2295. [2019-12-18 19:15:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2295 states. [2019-12-18 19:15:13,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 8743 transitions. [2019-12-18 19:15:13,776 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 8743 transitions. Word has length 21 [2019-12-18 19:15:13,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:13,776 INFO L462 AbstractCegarLoop]: Abstraction has 2295 states and 8743 transitions. [2019-12-18 19:15:13,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:15:13,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 8743 transitions. [2019-12-18 19:15:13,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:15:13,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:13,778 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 19:15:13,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:13,979 INFO L410 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:15:13,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:13,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1878689322, now seen corresponding path program 31 times [2019-12-18 19:15:13,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:13,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138028943] [2019-12-18 19:15:13,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:14,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138028943] [2019-12-18 19:15:14,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905989923] [2019-12-18 19:15:14,068 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:14,138 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:15:14,138 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:15:14,338 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:14,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:15:14,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:15:14,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674342681] [2019-12-18 19:15:14,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:15:14,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:14,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:15:14,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:15:14,340 INFO L87 Difference]: Start difference. First operand 2295 states and 8743 transitions. Second operand 24 states. [2019-12-18 19:15:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:18,447 INFO L93 Difference]: Finished difference Result 13463 states and 40671 transitions. [2019-12-18 19:15:18,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-12-18 19:15:18,448 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:15:18,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:18,474 INFO L225 Difference]: With dead ends: 13463 [2019-12-18 19:15:18,474 INFO L226 Difference]: Without dead ends: 13453 [2019-12-18 19:15:18,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5880 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2757, Invalid=13245, Unknown=0, NotChecked=0, Total=16002 [2019-12-18 19:15:18,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13453 states. [2019-12-18 19:15:18,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13453 to 2277. [2019-12-18 19:15:18,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2277 states. [2019-12-18 19:15:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 8666 transitions. [2019-12-18 19:15:18,577 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 8666 transitions. Word has length 21 [2019-12-18 19:15:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:18,577 INFO L462 AbstractCegarLoop]: Abstraction has 2277 states and 8666 transitions. [2019-12-18 19:15:18,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:15:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 8666 transitions. [2019-12-18 19:15:18,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:15:18,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:18,578 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 19:15:18,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:18,779 INFO L410 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:15:18,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:18,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1783527146, now seen corresponding path program 32 times [2019-12-18 19:15:18,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:18,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469665116] [2019-12-18 19:15:18,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:18,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469665116] [2019-12-18 19:15:18,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181378953] [2019-12-18 19:15:18,866 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:18,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:15:18,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:15:18,933 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:15:18,934 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:15:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:19,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:15:19,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:15:19,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522034074] [2019-12-18 19:15:19,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:15:19,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:19,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:15:19,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:15:19,134 INFO L87 Difference]: Start difference. First operand 2277 states and 8666 transitions. Second operand 24 states. [2019-12-18 19:15:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:25,860 INFO L93 Difference]: Finished difference Result 16514 states and 48887 transitions. [2019-12-18 19:15:25,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-12-18 19:15:25,860 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:15:25,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:25,889 INFO L225 Difference]: With dead ends: 16514 [2019-12-18 19:15:25,889 INFO L226 Difference]: Without dead ends: 16507 [2019-12-18 19:15:25,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13770 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5147, Invalid=29263, Unknown=0, NotChecked=0, Total=34410 [2019-12-18 19:15:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16507 states. [2019-12-18 19:15:26,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16507 to 2251. [2019-12-18 19:15:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2251 states. [2019-12-18 19:15:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 8560 transitions. [2019-12-18 19:15:26,007 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 8560 transitions. Word has length 21 [2019-12-18 19:15:26,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:26,007 INFO L462 AbstractCegarLoop]: Abstraction has 2251 states and 8560 transitions. [2019-12-18 19:15:26,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:15:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 8560 transitions. [2019-12-18 19:15:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:15:26,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:26,008 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 19:15:26,208 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:26,209 INFO L410 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:15:26,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:26,209 INFO L82 PathProgramCache]: Analyzing trace with hash -474063010, now seen corresponding path program 33 times [2019-12-18 19:15:26,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:26,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545399921] [2019-12-18 19:15:26,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:26,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:26,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545399921] [2019-12-18 19:15:26,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126054652] [2019-12-18 19:15:26,282 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:26,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 19:15:26,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:15:26,350 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:15:26,351 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:15:26,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:26,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:15:26,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-18 19:15:26,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108346143] [2019-12-18 19:15:26,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 19:15:26,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:26,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 19:15:26,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-12-18 19:15:26,499 INFO L87 Difference]: Start difference. First operand 2251 states and 8560 transitions. Second operand 23 states. [2019-12-18 19:15:30,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:30,698 INFO L93 Difference]: Finished difference Result 10482 states and 30730 transitions. [2019-12-18 19:15:30,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-12-18 19:15:30,698 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 19:15:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:30,714 INFO L225 Difference]: With dead ends: 10482 [2019-12-18 19:15:30,714 INFO L226 Difference]: Without dead ends: 10477 [2019-12-18 19:15:30,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6783 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2908, Invalid=15182, Unknown=0, NotChecked=0, Total=18090 [2019-12-18 19:15:30,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10477 states. [2019-12-18 19:15:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10477 to 2253. [2019-12-18 19:15:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2019-12-18 19:15:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 8566 transitions. [2019-12-18 19:15:30,794 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 8566 transitions. Word has length 21 [2019-12-18 19:15:30,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:30,795 INFO L462 AbstractCegarLoop]: Abstraction has 2253 states and 8566 transitions. [2019-12-18 19:15:30,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 19:15:30,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 8566 transitions. [2019-12-18 19:15:30,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:15:30,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:30,796 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 19:15:30,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:30,997 INFO L410 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:15:30,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:30,998 INFO L82 PathProgramCache]: Analyzing trace with hash 384811520, now seen corresponding path program 34 times [2019-12-18 19:15:30,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:30,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219969149] [2019-12-18 19:15:30,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:31,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219969149] [2019-12-18 19:15:31,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642797665] [2019-12-18 19:15:31,097 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:31,178 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:15:31,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:15:31,179 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:15:31,180 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:15:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:31,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:15:31,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-18 19:15:31,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671126902] [2019-12-18 19:15:31,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 19:15:31,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:31,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 19:15:31,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2019-12-18 19:15:31,343 INFO L87 Difference]: Start difference. First operand 2253 states and 8566 transitions. Second operand 23 states. [2019-12-18 19:15:35,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:35,460 INFO L93 Difference]: Finished difference Result 10560 states and 31108 transitions. [2019-12-18 19:15:35,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-12-18 19:15:35,460 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 19:15:35,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:35,478 INFO L225 Difference]: With dead ends: 10560 [2019-12-18 19:15:35,478 INFO L226 Difference]: Without dead ends: 10554 [2019-12-18 19:15:35,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6240 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2677, Invalid=13835, Unknown=0, NotChecked=0, Total=16512 [2019-12-18 19:15:35,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10554 states. [2019-12-18 19:15:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10554 to 2232. [2019-12-18 19:15:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2232 states. [2019-12-18 19:15:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 8512 transitions. [2019-12-18 19:15:35,560 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 8512 transitions. Word has length 21 [2019-12-18 19:15:35,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:35,560 INFO L462 AbstractCegarLoop]: Abstraction has 2232 states and 8512 transitions. [2019-12-18 19:15:35,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 19:15:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 8512 transitions. [2019-12-18 19:15:35,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:15:35,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:35,562 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 19:15:35,762 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:35,762 INFO L410 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:15:35,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:35,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1841771060, now seen corresponding path program 35 times [2019-12-18 19:15:35,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:35,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359043325] [2019-12-18 19:15:35,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:35,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359043325] [2019-12-18 19:15:35,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169901504] [2019-12-18 19:15:35,860 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:35,927 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 19:15:35,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:15:35,928 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:15:35,929 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:15:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:36,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:15:36,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:15:36,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041349371] [2019-12-18 19:15:36,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:15:36,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:36,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:15:36,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:15:36,094 INFO L87 Difference]: Start difference. First operand 2232 states and 8512 transitions. Second operand 24 states. [2019-12-18 19:15:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:40,319 INFO L93 Difference]: Finished difference Result 12790 states and 38778 transitions. [2019-12-18 19:15:40,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-12-18 19:15:40,320 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 19:15:40,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:40,341 INFO L225 Difference]: With dead ends: 12790 [2019-12-18 19:15:40,341 INFO L226 Difference]: Without dead ends: 12780 [2019-12-18 19:15:40,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6264 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2803, Invalid=13967, Unknown=0, NotChecked=0, Total=16770 [2019-12-18 19:15:40,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12780 states. [2019-12-18 19:15:40,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12780 to 2115. [2019-12-18 19:15:40,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2019-12-18 19:15:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 8089 transitions. [2019-12-18 19:15:40,434 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 8089 transitions. Word has length 21 [2019-12-18 19:15:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:40,434 INFO L462 AbstractCegarLoop]: Abstraction has 2115 states and 8089 transitions. [2019-12-18 19:15:40,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 19:15:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 8089 transitions. [2019-12-18 19:15:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:15:40,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:40,436 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:15:40,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:40,636 INFO L410 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:15:40,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:40,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1316541292, now seen corresponding path program 1 times [2019-12-18 19:15:40,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:40,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437508982] [2019-12-18 19:15:40,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:15:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:15:40,654 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:15:40,654 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:15:40,654 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 19:15:40,654 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-18 19:15:40,670 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,671 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,671 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,671 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,671 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,671 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,671 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,671 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,672 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,672 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,672 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,672 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,672 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,672 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,672 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,672 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,673 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,673 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,673 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,673 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,673 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,673 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,673 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,673 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,674 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,674 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,674 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,674 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,674 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,674 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,674 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,674 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,675 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,675 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,675 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,675 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,675 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,675 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,675 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,675 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,676 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,676 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,676 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,676 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,676 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,676 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,676 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,677 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,677 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,677 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,677 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,677 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,677 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,677 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,678 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,678 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,678 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,678 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,678 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,678 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,678 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,679 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,679 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,679 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,679 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,679 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,679 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,679 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,680 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,680 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,681 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,681 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,681 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,681 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,681 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,681 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,681 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,681 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,682 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,682 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,682 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,682 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,683 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,683 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,683 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,683 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,683 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,683 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,683 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,683 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,684 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,684 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,684 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,684 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,684 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,685 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,685 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,685 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,685 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,685 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,685 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,685 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,686 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,686 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,686 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,686 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,686 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,686 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,687 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,687 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,688 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,688 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,688 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,688 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,689 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,690 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,690 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,690 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,690 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,690 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,691 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,691 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,691 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,691 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,691 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,692 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,692 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,692 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,692 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,692 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,693 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,693 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,693 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,693 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,693 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,694 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,694 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,694 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,695 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,695 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,695 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,695 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,696 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,696 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,696 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,696 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,696 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,696 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,697 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,697 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,697 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,697 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,697 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,697 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,698 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,698 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,698 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,698 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,698 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,698 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:15:40,699 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-18 19:15:40,699 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:15:40,700 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:15:40,700 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:15:40,700 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:15:40,700 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:15:40,700 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:15:40,700 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:15:40,700 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:15:40,702 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 128 transitions [2019-12-18 19:15:40,702 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 144 places, 128 transitions [2019-12-18 19:15:40,718 INFO L126 PetriNetUnfolder]: 7/154 cut-off events. [2019-12-18 19:15:40,718 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:15:40,721 INFO L76 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 154 events. 7/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 281 event pairs. 80/220 useless extension candidates. Maximal degree in co-relation 181. Up to 12 conditions per place. [2019-12-18 19:15:40,728 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 144 places, 128 transitions [2019-12-18 19:15:40,743 INFO L126 PetriNetUnfolder]: 7/154 cut-off events. [2019-12-18 19:15:40,744 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:15:40,747 INFO L76 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 154 events. 7/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 281 event pairs. 80/220 useless extension candidates. Maximal degree in co-relation 181. Up to 12 conditions per place. [2019-12-18 19:15:40,753 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2860 [2019-12-18 19:15:40,753 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:15:42,863 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-12-18 19:15:42,962 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3419 [2019-12-18 19:15:42,962 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-18 19:15:42,962 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-18 19:15:43,250 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-18 19:15:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-18 19:15:43,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:15:43,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:43,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:15:43,250 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 19:15:43,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:43,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1051879, now seen corresponding path program 1 times [2019-12-18 19:15:43,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:43,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707936483] [2019-12-18 19:15:43,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:43,274 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 19:15:43,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707936483] [2019-12-18 19:15:43,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:15:43,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:15:43,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308947719] [2019-12-18 19:15:43,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:15:43,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:43,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:15:43,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:15:43,276 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-18 19:15:43,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:43,402 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-18 19:15:43,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:15:43,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:15:43,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:43,419 INFO L225 Difference]: With dead ends: 5844 [2019-12-18 19:15:43,419 INFO L226 Difference]: Without dead ends: 5479 [2019-12-18 19:15:43,420 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 19:15:43,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-18 19:15:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-18 19:15:43,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-18 19:15:43,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-18 19:15:43,525 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-18 19:15:43,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:43,526 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-18 19:15:43,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:15:43,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-18 19:15:43,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:15:43,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:43,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:15:43,526 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 19:15:43,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:43,526 INFO L82 PathProgramCache]: Analyzing trace with hash -598137854, now seen corresponding path program 1 times [2019-12-18 19:15:43,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:43,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035381638] [2019-12-18 19:15:43,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:43,551 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 19:15:43,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035381638] [2019-12-18 19:15:43,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:15:43,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:15:43,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161744199] [2019-12-18 19:15:43,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:15:43,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:43,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:15:43,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:15:43,552 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-18 19:15:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:43,695 INFO L93 Difference]: Finished difference Result 11058 states and 45915 transitions. [2019-12-18 19:15:43,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:15:43,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 19:15:43,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:43,720 INFO L225 Difference]: With dead ends: 11058 [2019-12-18 19:15:43,720 INFO L226 Difference]: Without dead ends: 11055 [2019-12-18 19:15:43,720 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 19:15:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11055 states. [2019-12-18 19:15:43,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11055 to 6120. [2019-12-18 19:15:43,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-18 19:15:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-18 19:15:43,869 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-18 19:15:43,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:43,869 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-18 19:15:43,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:15:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-18 19:15:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:15:43,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:43,870 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:15:43,870 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 19:15:43,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:43,870 INFO L82 PathProgramCache]: Analyzing trace with hash 63286460, now seen corresponding path program 1 times [2019-12-18 19:15:43,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:43,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667705884] [2019-12-18 19:15:43,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:43,899 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 19:15:43,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667705884] [2019-12-18 19:15:43,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:15:43,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:15:43,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773071288] [2019-12-18 19:15:43,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:15:43,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:43,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:15:43,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:15:43,902 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-18 19:15:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:44,064 INFO L93 Difference]: Finished difference Result 12424 states and 52328 transitions. [2019-12-18 19:15:44,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:15:44,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 19:15:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:44,101 INFO L225 Difference]: With dead ends: 12424 [2019-12-18 19:15:44,101 INFO L226 Difference]: Without dead ends: 12420 [2019-12-18 19:15:44,101 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 19:15:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12420 states. [2019-12-18 19:15:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12420 to 7145. [2019-12-18 19:15:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-18 19:15:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-18 19:15:44,278 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-18 19:15:44,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:44,278 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-18 19:15:44,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:15:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-18 19:15:44,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:15:44,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:44,279 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:15:44,279 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 19:15:44,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:44,279 INFO L82 PathProgramCache]: Analyzing trace with hash -697924765, now seen corresponding path program 1 times [2019-12-18 19:15:44,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:44,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993086327] [2019-12-18 19:15:44,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:44,334 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 19:15:44,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993086327] [2019-12-18 19:15:44,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495947379] [2019-12-18 19:15:44,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:44,409 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:15:44,410 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:15:44,500 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 19:15:44,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:15:44,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 19:15:44,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562677013] [2019-12-18 19:15:44,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 19:15:44,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:44,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 19:15:44,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:15:44,501 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 18 states. [2019-12-18 19:15:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:45,588 INFO L93 Difference]: Finished difference Result 22393 states and 85334 transitions. [2019-12-18 19:15:45,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 19:15:45,588 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 19:15:45,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:45,638 INFO L225 Difference]: With dead ends: 22393 [2019-12-18 19:15:45,638 INFO L226 Difference]: Without dead ends: 22388 [2019-12-18 19:15:45,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1430, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 19:15:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22388 states. [2019-12-18 19:15:46,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22388 to 7191. [2019-12-18 19:15:46,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7191 states. [2019-12-18 19:15:46,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7191 states to 7191 states and 33225 transitions. [2019-12-18 19:15:46,702 INFO L78 Accepts]: Start accepts. Automaton has 7191 states and 33225 transitions. Word has length 15 [2019-12-18 19:15:46,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:46,702 INFO L462 AbstractCegarLoop]: Abstraction has 7191 states and 33225 transitions. [2019-12-18 19:15:46,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 19:15:46,702 INFO L276 IsEmpty]: Start isEmpty. Operand 7191 states and 33225 transitions. [2019-12-18 19:15:46,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:15:46,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:46,702 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:15:46,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:46,903 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 19:15:46,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:46,904 INFO L82 PathProgramCache]: Analyzing trace with hash 688753653, now seen corresponding path program 2 times [2019-12-18 19:15:46,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:46,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089770073] [2019-12-18 19:15:46,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:46,966 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 19:15:46,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089770073] [2019-12-18 19:15:46,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37254519] [2019-12-18 19:15:46,967 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:47,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:15:47,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:15:47,048 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:15:47,049 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:15:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:47,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:15:47,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 19:15:47,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420147370] [2019-12-18 19:15:47,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 19:15:47,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:47,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 19:15:47,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:15:47,150 INFO L87 Difference]: Start difference. First operand 7191 states and 33225 transitions. Second operand 18 states. [2019-12-18 19:15:48,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:48,227 INFO L93 Difference]: Finished difference Result 28893 states and 112630 transitions. [2019-12-18 19:15:48,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:15:48,227 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 19:15:48,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:48,296 INFO L225 Difference]: With dead ends: 28893 [2019-12-18 19:15:48,296 INFO L226 Difference]: Without dead ends: 28888 [2019-12-18 19:15:48,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=373, Invalid=1267, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 19:15:48,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28888 states. [2019-12-18 19:15:48,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28888 to 6960. [2019-12-18 19:15:48,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6960 states. [2019-12-18 19:15:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6960 states to 6960 states and 32150 transitions. [2019-12-18 19:15:48,589 INFO L78 Accepts]: Start accepts. Automaton has 6960 states and 32150 transitions. Word has length 15 [2019-12-18 19:15:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:48,589 INFO L462 AbstractCegarLoop]: Abstraction has 6960 states and 32150 transitions. [2019-12-18 19:15:48,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 19:15:48,590 INFO L276 IsEmpty]: Start isEmpty. Operand 6960 states and 32150 transitions. [2019-12-18 19:15:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:15:48,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:48,590 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:15:48,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:48,791 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 19:15:48,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:48,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1133625120, now seen corresponding path program 1 times [2019-12-18 19:15:48,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:48,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079189349] [2019-12-18 19:15:48,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:48,825 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 19:15:48,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079189349] [2019-12-18 19:15:48,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:15:48,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:15:48,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876944649] [2019-12-18 19:15:48,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:15:48,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:48,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:15:48,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:15:48,826 INFO L87 Difference]: Start difference. First operand 6960 states and 32150 transitions. Second operand 5 states. [2019-12-18 19:15:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:48,996 INFO L93 Difference]: Finished difference Result 13762 states and 58788 transitions. [2019-12-18 19:15:48,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:15:48,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 19:15:48,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:49,030 INFO L225 Difference]: With dead ends: 13762 [2019-12-18 19:15:49,030 INFO L226 Difference]: Without dead ends: 13754 [2019-12-18 19:15:49,030 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 19:15:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13754 states. [2019-12-18 19:15:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13754 to 8211. [2019-12-18 19:15:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8211 states. [2019-12-18 19:15:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8211 states to 8211 states and 38231 transitions. [2019-12-18 19:15:49,407 INFO L78 Accepts]: Start accepts. Automaton has 8211 states and 38231 transitions. Word has length 17 [2019-12-18 19:15:49,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:49,408 INFO L462 AbstractCegarLoop]: Abstraction has 8211 states and 38231 transitions. [2019-12-18 19:15:49,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:15:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 8211 states and 38231 transitions. [2019-12-18 19:15:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:15:49,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:49,409 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:15:49,409 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 19:15:49,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash 266693639, now seen corresponding path program 1 times [2019-12-18 19:15:49,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:49,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038026415] [2019-12-18 19:15:49,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:49,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038026415] [2019-12-18 19:15:49,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586538973] [2019-12-18 19:15:49,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:49,547 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 19:15:49,547 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:15:49,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:49,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:15:49,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 19:15:49,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225579889] [2019-12-18 19:15:49,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 19:15:49,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:49,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 19:15:49,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:15:49,653 INFO L87 Difference]: Start difference. First operand 8211 states and 38231 transitions. Second operand 20 states. [2019-12-18 19:15:51,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:51,311 INFO L93 Difference]: Finished difference Result 22564 states and 89916 transitions. [2019-12-18 19:15:51,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 19:15:51,311 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 19:15:51,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:51,363 INFO L225 Difference]: With dead ends: 22564 [2019-12-18 19:15:51,364 INFO L226 Difference]: Without dead ends: 22557 [2019-12-18 19:15:51,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=521, Invalid=2029, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 19:15:51,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22557 states. [2019-12-18 19:15:51,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22557 to 8273. [2019-12-18 19:15:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8273 states. [2019-12-18 19:15:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8273 states to 8273 states and 38415 transitions. [2019-12-18 19:15:51,635 INFO L78 Accepts]: Start accepts. Automaton has 8273 states and 38415 transitions. Word has length 19 [2019-12-18 19:15:51,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:51,635 INFO L462 AbstractCegarLoop]: Abstraction has 8273 states and 38415 transitions. [2019-12-18 19:15:51,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 19:15:51,636 INFO L276 IsEmpty]: Start isEmpty. Operand 8273 states and 38415 transitions. [2019-12-18 19:15:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:15:51,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:51,636 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:15:51,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:51,838 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 19:15:51,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:51,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1890641739, now seen corresponding path program 1 times [2019-12-18 19:15:51,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:51,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164661305] [2019-12-18 19:15:51,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:51,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164661305] [2019-12-18 19:15:51,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085072943] [2019-12-18 19:15:51,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:51,982 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 19:15:51,982 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:15:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:52,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:15:52,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 19:15:52,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21989461] [2019-12-18 19:15:52,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 19:15:52,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:52,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 19:15:52,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:15:52,087 INFO L87 Difference]: Start difference. First operand 8273 states and 38415 transitions. Second operand 20 states. [2019-12-18 19:15:53,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:53,894 INFO L93 Difference]: Finished difference Result 24099 states and 95744 transitions. [2019-12-18 19:15:53,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 19:15:53,894 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 19:15:53,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:53,951 INFO L225 Difference]: With dead ends: 24099 [2019-12-18 19:15:53,951 INFO L226 Difference]: Without dead ends: 24089 [2019-12-18 19:15:53,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=484, Invalid=1678, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 19:15:53,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24089 states. [2019-12-18 19:15:54,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24089 to 8359. [2019-12-18 19:15:54,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8359 states. [2019-12-18 19:15:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8359 states to 8359 states and 38734 transitions. [2019-12-18 19:15:54,220 INFO L78 Accepts]: Start accepts. Automaton has 8359 states and 38734 transitions. Word has length 19 [2019-12-18 19:15:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:54,220 INFO L462 AbstractCegarLoop]: Abstraction has 8359 states and 38734 transitions. [2019-12-18 19:15:54,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 19:15:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 8359 states and 38734 transitions. [2019-12-18 19:15:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:15:54,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:54,222 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:15:54,422 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:54,422 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 19:15:54,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:54,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1507971637, now seen corresponding path program 2 times [2019-12-18 19:15:54,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:54,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769407674] [2019-12-18 19:15:54,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:54,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769407674] [2019-12-18 19:15:54,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096219008] [2019-12-18 19:15:54,528 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:54,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:15:54,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:15:54,600 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:15:54,600 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:15:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 19:15:54,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:15:54,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-18 19:15:54,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552742700] [2019-12-18 19:15:54,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 19:15:54,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:54,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 19:15:54,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:15:54,685 INFO L87 Difference]: Start difference. First operand 8359 states and 38734 transitions. Second operand 19 states. [2019-12-18 19:15:55,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:55,693 INFO L93 Difference]: Finished difference Result 19471 states and 79365 transitions. [2019-12-18 19:15:55,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 19:15:55,694 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-18 19:15:55,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:55,741 INFO L225 Difference]: With dead ends: 19471 [2019-12-18 19:15:55,741 INFO L226 Difference]: Without dead ends: 19464 [2019-12-18 19:15:55,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 19:15:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19464 states. [2019-12-18 19:15:55,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19464 to 8266. [2019-12-18 19:15:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8266 states. [2019-12-18 19:15:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8266 states to 8266 states and 38293 transitions. [2019-12-18 19:15:55,983 INFO L78 Accepts]: Start accepts. Automaton has 8266 states and 38293 transitions. Word has length 19 [2019-12-18 19:15:55,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:55,983 INFO L462 AbstractCegarLoop]: Abstraction has 8266 states and 38293 transitions. [2019-12-18 19:15:55,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 19:15:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 8266 states and 38293 transitions. [2019-12-18 19:15:55,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:15:55,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:55,984 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:15:56,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:56,185 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 19:15:56,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:56,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1507960601, now seen corresponding path program 2 times [2019-12-18 19:15:56,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:56,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820824341] [2019-12-18 19:15:56,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:56,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:56,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820824341] [2019-12-18 19:15:56,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151646337] [2019-12-18 19:15:56,258 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:56,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:15:56,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:15:56,337 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:15:56,338 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:15:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 19:15:56,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:15:56,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-18 19:15:56,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760726966] [2019-12-18 19:15:56,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 19:15:56,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:56,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 19:15:56,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-18 19:15:56,428 INFO L87 Difference]: Start difference. First operand 8266 states and 38293 transitions. Second operand 19 states. [2019-12-18 19:15:57,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:57,407 INFO L93 Difference]: Finished difference Result 22340 states and 93099 transitions. [2019-12-18 19:15:57,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 19:15:57,408 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-18 19:15:57,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:57,462 INFO L225 Difference]: With dead ends: 22340 [2019-12-18 19:15:57,463 INFO L226 Difference]: Without dead ends: 22331 [2019-12-18 19:15:57,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 19:15:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22331 states. [2019-12-18 19:15:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22331 to 8151. [2019-12-18 19:15:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8151 states. [2019-12-18 19:15:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8151 states to 8151 states and 37770 transitions. [2019-12-18 19:15:57,712 INFO L78 Accepts]: Start accepts. Automaton has 8151 states and 37770 transitions. Word has length 19 [2019-12-18 19:15:57,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:57,712 INFO L462 AbstractCegarLoop]: Abstraction has 8151 states and 37770 transitions. [2019-12-18 19:15:57,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 19:15:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 8151 states and 37770 transitions. [2019-12-18 19:15:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:15:57,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:57,713 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 19:15:57,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:57,914 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 19:15:57,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:57,914 INFO L82 PathProgramCache]: Analyzing trace with hash -509077988, now seen corresponding path program 1 times [2019-12-18 19:15:57,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:57,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763640659] [2019-12-18 19:15:57,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:57,991 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 19:15:57,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763640659] [2019-12-18 19:15:57,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280059144] [2019-12-18 19:15:57,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:15:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:58,068 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:15:58,068 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:15:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:15:58,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:15:58,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-18 19:15:58,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299837251] [2019-12-18 19:15:58,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 19:15:58,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:58,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 19:15:58,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2019-12-18 19:15:58,212 INFO L87 Difference]: Start difference. First operand 8151 states and 37770 transitions. Second operand 23 states. [2019-12-18 19:16:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:16:04,193 INFO L93 Difference]: Finished difference Result 48884 states and 174143 transitions. [2019-12-18 19:16:04,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-12-18 19:16:04,194 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 19:16:04,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:16:04,305 INFO L225 Difference]: With dead ends: 48884 [2019-12-18 19:16:04,305 INFO L226 Difference]: Without dead ends: 48852 [2019-12-18 19:16:04,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8136 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3170, Invalid=17710, Unknown=0, NotChecked=0, Total=20880 [2019-12-18 19:16:04,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48852 states. [2019-12-18 19:16:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48852 to 8509. [2019-12-18 19:16:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8509 states. [2019-12-18 19:16:04,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8509 states to 8509 states and 39545 transitions. [2019-12-18 19:16:04,792 INFO L78 Accepts]: Start accepts. Automaton has 8509 states and 39545 transitions. Word has length 21 [2019-12-18 19:16:04,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:16:04,792 INFO L462 AbstractCegarLoop]: Abstraction has 8509 states and 39545 transitions. [2019-12-18 19:16:04,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 19:16:04,792 INFO L276 IsEmpty]: Start isEmpty. Operand 8509 states and 39545 transitions. [2019-12-18 19:16:04,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:16:04,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:16:04,793 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 19:16:04,993 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:16:04,994 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 19:16:04,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:16:04,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1405431908, now seen corresponding path program 2 times [2019-12-18 19:16:04,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:16:04,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157543250] [2019-12-18 19:16:04,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:16:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:16:05,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:16:05,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157543250] [2019-12-18 19:16:05,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492545690] [2019-12-18 19:16:05,077 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:16:05,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:16:05,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:16:05,154 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:16:05,154 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:16:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:16:05,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:16:05,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 19:16:05,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784228281] [2019-12-18 19:16:05,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 19:16:05,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:16:05,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 19:16:05,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-18 19:16:05,304 INFO L87 Difference]: Start difference. First operand 8509 states and 39545 transitions. Second operand 24 states. Received shutdown request... [2019-12-18 19:16:07,488 WARN L209 SmtUtils]: Removed 7 from assertion stack [2019-12-18 19:16:07,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-18 19:16:07,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:16:07,689 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 19:16:07,694 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 19:16:07,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:16:07 BasicIcfg [2019-12-18 19:16:07,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:16:07,695 INFO L168 Benchmark]: Toolchain (without parser) took 253936.82 ms. Allocated memory was 137.4 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 100.5 MB in the beginning and 1.1 GB in the end (delta: -974.0 MB). Peak memory consumption was 317.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:16:07,695 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 19:16:07,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 651.06 ms. Allocated memory was 137.4 MB in the beginning and 199.8 MB in the end (delta: 62.4 MB). Free memory was 100.3 MB in the beginning and 159.1 MB in the end (delta: -58.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-12-18 19:16:07,696 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.24 ms. Allocated memory is still 199.8 MB. Free memory was 159.1 MB in the beginning and 157.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 19:16:07,696 INFO L168 Benchmark]: Boogie Preprocessor took 53.83 ms. Allocated memory is still 199.8 MB. Free memory was 157.1 MB in the beginning and 155.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:16:07,696 INFO L168 Benchmark]: RCFGBuilder took 419.34 ms. Allocated memory is still 199.8 MB. Free memory was 155.8 MB in the beginning and 136.3 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2019-12-18 19:16:07,696 INFO L168 Benchmark]: TraceAbstraction took 252747.32 ms. Allocated memory was 199.8 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 135.7 MB in the beginning and 1.1 GB in the end (delta: -938.8 MB). Peak memory consumption was 290.1 MB. Max. memory is 7.1 GB. [2019-12-18 19:16:07,698 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.44 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 651.06 ms. Allocated memory was 137.4 MB in the beginning and 199.8 MB in the end (delta: 62.4 MB). Free memory was 100.3 MB in the beginning and 159.1 MB in the end (delta: -58.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.24 ms. Allocated memory is still 199.8 MB. Free memory was 159.1 MB in the beginning and 157.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.83 ms. Allocated memory is still 199.8 MB. Free memory was 157.1 MB in the beginning and 155.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 419.34 ms. Allocated memory is still 199.8 MB. Free memory was 155.8 MB in the beginning and 136.3 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252747.32 ms. Allocated memory was 199.8 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 135.7 MB in the beginning and 1.1 GB in the end (delta: -938.8 MB). Peak memory consumption was 290.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 60 ProgramPointsBefore, 15 ProgramPointsAfterwards, 56 TransitionsBefore, 12 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 7 FixpointIterations, 18 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 351 VarBasedMoverChecksPositive, 4 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 4 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 524 CheckedPairsTotal, 47 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 81 ProgramPointsBefore, 26 ProgramPointsAfterwards, 74 TransitionsBefore, 21 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 3 ChoiceCompositions, 555 VarBasedMoverChecksPositive, 10 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 14 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1223 CheckedPairsTotal, 61 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 102 ProgramPointsBefore, 34 ProgramPointsAfterwards, 92 TransitionsBefore, 27 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 4 ChoiceCompositions, 801 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 19 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 1840 CheckedPairsTotal, 80 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 123 ProgramPointsBefore, 42 ProgramPointsAfterwards, 110 TransitionsBefore, 33 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 5 ChoiceCompositions, 1106 VarBasedMoverChecksPositive, 19 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 21 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 2220 CheckedPairsTotal, 97 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.2s, 144 ProgramPointsBefore, 50 ProgramPointsAfterwards, 128 TransitionsBefore, 39 TransitionsAfterwards, 2860 CoEnabledTransitionPairs, 6 FixpointIterations, 58 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 1461 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 38 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 3419 CheckedPairsTotal, 108 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (8509states) and FLOYD_HOARE automaton (currently 54 states, 24 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 19 for 7ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 1 error locations. Result: TIMEOUT, OverallTime: 26.9s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 16.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 484 SDtfs, 3943 SDslu, 3008 SDs, 0 SdLazy, 8348 SolverSat, 531 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 543 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 473 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12016 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8509occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 148793 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 31968 SizeOfPredicates, 44 NumberOfNonLiveVariables, 866 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 26/114 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