/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013_variant-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:10:51,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:10:51,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:10:51,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:10:51,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:10:51,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:10:51,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:10:51,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:10:51,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:10:51,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:10:51,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:10:51,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:10:51,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:10:51,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:10:51,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:10:51,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:10:51,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:10:51,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:10:51,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:10:51,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:10:51,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:10:51,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:10:51,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:10:51,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:10:51,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:10:51,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:10:51,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:10:51,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:10:51,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:10:51,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:10:51,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:10:51,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:10:51,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:10:51,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:10:51,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:10:51,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:10:51,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:10:51,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:10:51,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:10:51,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:10:51,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:10:51,423 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 23:10:51,455 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:10:51,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:10:51,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:10:51,457 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:10:51,460 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:10:51,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:10:51,460 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:10:51,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:10:51,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:10:51,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:10:51,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:10:51,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:10:51,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:10:51,462 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:10:51,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:10:51,462 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:10:51,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:10:51,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:10:51,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:10:51,464 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:10:51,464 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:10:51,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:10:51,465 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:10:51,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:10:51,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:10:51,467 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:10:51,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:10:51,470 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:10:51,470 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:10:51,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:10:51,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:10:51,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:10:51,754 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:10:51,755 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:10:51,756 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:10:51,756 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 23:10:51,826 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dfd2ef32/be88774b83b24ea7b5511c4a95048cce/FLAG0c791a96e [2019-12-18 23:10:52,351 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:10:52,351 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013_variant-1.i [2019-12-18 23:10:52,370 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dfd2ef32/be88774b83b24ea7b5511c4a95048cce/FLAG0c791a96e [2019-12-18 23:10:52,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dfd2ef32/be88774b83b24ea7b5511c4a95048cce [2019-12-18 23:10:52,592 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:10:52,594 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:10:52,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:10:52,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:10:52,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:10:52,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:10:52" (1/1) ... [2019-12-18 23:10:52,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f9584c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:52, skipping insertion in model container [2019-12-18 23:10:52,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:10:52" (1/1) ... [2019-12-18 23:10:52,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:10:52,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:10:53,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:10:53,176 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:10:53,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:10:53,312 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:10:53,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:53 WrapperNode [2019-12-18 23:10:53,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:10:53,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:10:53,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:10:53,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:10:53,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:53" (1/1) ... [2019-12-18 23:10:53,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:53" (1/1) ... [2019-12-18 23:10:53,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:10:53,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:10:53,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:10:53,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:10:53,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:53" (1/1) ... [2019-12-18 23:10:53,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:53" (1/1) ... [2019-12-18 23:10:53,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:53" (1/1) ... [2019-12-18 23:10:53,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:53" (1/1) ... [2019-12-18 23:10:53,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:53" (1/1) ... [2019-12-18 23:10:53,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:53" (1/1) ... [2019-12-18 23:10:53,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:53" (1/1) ... [2019-12-18 23:10:53,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:10:53,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:10:53,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:10:53,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:10:53,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:10:53,451 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-18 23:10:53,451 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-18 23:10:53,451 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-18 23:10:53,451 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-18 23:10:53,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:10:53,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:10:53,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:10:53,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:10:53,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:10:53,454 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 23:10:53,780 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:10:53,781 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-18 23:10:53,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:10:53 BoogieIcfgContainer [2019-12-18 23:10:53,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:10:53,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:10:53,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:10:53,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:10:53,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:10:52" (1/3) ... [2019-12-18 23:10:53,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43919c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:10:53, skipping insertion in model container [2019-12-18 23:10:53,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:53" (2/3) ... [2019-12-18 23:10:53,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43919c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:10:53, skipping insertion in model container [2019-12-18 23:10:53,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:10:53" (3/3) ... [2019-12-18 23:10:53,791 INFO L109 eAbstractionObserver]: Analyzing ICFG fkp2013_variant-1.i [2019-12-18 23:10:53,800 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:10:53,800 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:10:53,807 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 23:10:53,808 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:10:53,837 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,837 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,838 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,838 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,839 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,839 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,839 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,840 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,840 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,841 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,841 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,841 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,842 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,842 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,843 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,843 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,843 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,843 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,844 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,844 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,845 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,849 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,849 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,850 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,850 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,850 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,856 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,857 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,857 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,857 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,857 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,858 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:53,874 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-18 23:10:53,891 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:10:53,891 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:10:53,891 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:10:53,892 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:10:53,892 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:10:53,892 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:10:53,892 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:10:53,892 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:10:53,907 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 56 transitions [2019-12-18 23:10:53,909 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 60 places, 56 transitions [2019-12-18 23:10:53,957 INFO L126 PetriNetUnfolder]: 3/66 cut-off events. [2019-12-18 23:10:53,957 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:53,966 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 23:10:53,973 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 60 places, 56 transitions [2019-12-18 23:10:53,996 INFO L126 PetriNetUnfolder]: 3/66 cut-off events. [2019-12-18 23:10:53,996 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:53,999 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 23:10:54,002 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 692 [2019-12-18 23:10:54,003 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:10:55,365 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-12-18 23:10:55,600 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-12-18 23:10:55,689 INFO L206 etLargeBlockEncoding]: Checked pairs total: 524 [2019-12-18 23:10:55,689 INFO L214 etLargeBlockEncoding]: Total number of compositions: 47 [2019-12-18 23:10:55,694 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-18 23:10:55,707 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-18 23:10:55,710 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-18 23:10:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:10:55,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:55,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:10:55,719 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:10:55,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:55,727 INFO L82 PathProgramCache]: Analyzing trace with hash 219913, now seen corresponding path program 1 times [2019-12-18 23:10:55,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:55,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668146071] [2019-12-18 23:10:55,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:10:55,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668146071] [2019-12-18 23:10:55,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:55,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:10:55,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386106035] [2019-12-18 23:10:56,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:10:56,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:56,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:10:56,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:10:56,019 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-18 23:10:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:56,050 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-18 23:10:56,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:10:56,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:10:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:56,062 INFO L225 Difference]: With dead ends: 35 [2019-12-18 23:10:56,063 INFO L226 Difference]: Without dead ends: 31 [2019-12-18 23:10:56,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:10:56,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-18 23:10:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-18 23:10:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-18 23:10:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-18 23:10:56,103 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-18 23:10:56,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:56,104 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-18 23:10:56,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:10:56,104 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-18 23:10:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 23:10:56,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:56,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:56,106 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:10:56,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:56,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1212750904, now seen corresponding path program 1 times [2019-12-18 23:10:56,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:56,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90214910] [2019-12-18 23:10:56,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:10:56,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90214910] [2019-12-18 23:10:56,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:56,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:10:56,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27853886] [2019-12-18 23:10:56,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:10:56,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:56,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:10:56,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:10:56,196 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-18 23:10:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:56,221 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-18 23:10:56,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:10:56,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-18 23:10:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:56,223 INFO L225 Difference]: With dead ends: 26 [2019-12-18 23:10:56,223 INFO L226 Difference]: Without dead ends: 24 [2019-12-18 23:10:56,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:10:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-18 23:10:56,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-18 23:10:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-18 23:10:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-18 23:10:56,231 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-18 23:10:56,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:56,232 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-18 23:10:56,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:10:56,232 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-18 23:10:56,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-18 23:10:56,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:56,233 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:56,233 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:10:56,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:56,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1059432955, now seen corresponding path program 1 times [2019-12-18 23:10:56,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:56,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704891356] [2019-12-18 23:10:56,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:10:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:10:56,339 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:10:56,340 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:10:56,340 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 23:10:56,340 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-18 23:10:56,353 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,353 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,353 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,353 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,354 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,354 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,355 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,355 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,355 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,355 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,355 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,356 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,356 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,356 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,357 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,357 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,357 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,357 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,358 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,359 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,359 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,359 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,359 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,359 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,360 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,360 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,360 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,360 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,361 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,361 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,367 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,368 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,368 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,368 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,368 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,370 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,370 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,371 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,371 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,371 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,373 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,373 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,373 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,373 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,373 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,376 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,378 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,378 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,379 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,379 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:56,381 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 23:10:56,381 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:10:56,381 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:10:56,381 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:10:56,382 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:10:56,382 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:10:56,382 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:10:56,382 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:10:56,382 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:10:56,388 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 74 transitions [2019-12-18 23:10:56,388 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 81 places, 74 transitions [2019-12-18 23:10:56,423 INFO L126 PetriNetUnfolder]: 4/88 cut-off events. [2019-12-18 23:10:56,423 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:56,425 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 23:10:56,429 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 81 places, 74 transitions [2019-12-18 23:10:56,445 INFO L126 PetriNetUnfolder]: 4/88 cut-off events. [2019-12-18 23:10:56,445 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:56,447 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 23:10:56,451 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1108 [2019-12-18 23:10:56,451 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:10:57,832 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-18 23:10:57,898 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1223 [2019-12-18 23:10:57,898 INFO L214 etLargeBlockEncoding]: Total number of compositions: 61 [2019-12-18 23:10:57,899 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-18 23:10:57,911 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-18 23:10:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-18 23:10:57,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:10:57,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:57,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:10:57,912 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:57,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:57,912 INFO L82 PathProgramCache]: Analyzing trace with hash 374327, now seen corresponding path program 1 times [2019-12-18 23:10:57,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:57,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686463049] [2019-12-18 23:10:57,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:57,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:10:57,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686463049] [2019-12-18 23:10:57,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:57,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:10:57,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252387957] [2019-12-18 23:10:57,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:10:57,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:57,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:10:57,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:10:57,961 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-18 23:10:58,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:58,004 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-18 23:10:58,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:10:58,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:10:58,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:58,011 INFO L225 Difference]: With dead ends: 185 [2019-12-18 23:10:58,011 INFO L226 Difference]: Without dead ends: 171 [2019-12-18 23:10:58,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:10:58,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-18 23:10:58,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-18 23:10:58,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-18 23:10:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-18 23:10:58,037 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-18 23:10:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:58,037 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-18 23:10:58,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:10:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-18 23:10:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 23:10:58,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:58,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:58,038 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:58,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:58,039 INFO L82 PathProgramCache]: Analyzing trace with hash -857862729, now seen corresponding path program 1 times [2019-12-18 23:10:58,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:58,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321476671] [2019-12-18 23:10:58,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:10:58,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321476671] [2019-12-18 23:10:58,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:58,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:10:58,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565015501] [2019-12-18 23:10:58,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:10:58,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:58,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:10:58,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:10:58,123 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-18 23:10:58,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:58,242 INFO L93 Difference]: Finished difference Result 224 states and 491 transitions. [2019-12-18 23:10:58,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:10:58,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 23:10:58,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:58,246 INFO L225 Difference]: With dead ends: 224 [2019-12-18 23:10:58,246 INFO L226 Difference]: Without dead ends: 221 [2019-12-18 23:10:58,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:10:58,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-12-18 23:10:58,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 162. [2019-12-18 23:10:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-18 23:10:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-18 23:10:58,265 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-18 23:10:58,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:58,266 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-18 23:10:58,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:10:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-18 23:10:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:10:58,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:58,267 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:58,267 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:58,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash -924776041, now seen corresponding path program 1 times [2019-12-18 23:10:58,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:58,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741482965] [2019-12-18 23:10:58,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:10:58,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741482965] [2019-12-18 23:10:58,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:58,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:10:58,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631152043] [2019-12-18 23:10:58,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:10:58,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:58,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:10:58,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:10:58,348 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-18 23:10:58,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:58,435 INFO L93 Difference]: Finished difference Result 213 states and 458 transitions. [2019-12-18 23:10:58,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:10:58,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 23:10:58,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:58,438 INFO L225 Difference]: With dead ends: 213 [2019-12-18 23:10:58,439 INFO L226 Difference]: Without dead ends: 209 [2019-12-18 23:10:58,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:10:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-18 23:10:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 153. [2019-12-18 23:10:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-18 23:10:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-18 23:10:58,453 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-18 23:10:58,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:58,454 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-18 23:10:58,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:10:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-18 23:10:58,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 23:10:58,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:58,456 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:58,457 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:58,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:58,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1393798314, now seen corresponding path program 1 times [2019-12-18 23:10:58,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:58,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760977621] [2019-12-18 23:10:58,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:10:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:10:58,490 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:10:58,490 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:10:58,490 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 23:10:58,491 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-18 23:10:58,500 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,500 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,501 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,501 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,501 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,501 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,501 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,502 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,502 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,502 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,502 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,502 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,502 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,503 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,503 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,503 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,503 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,503 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,504 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,504 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,504 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,504 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,504 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,504 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,504 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,505 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,505 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,505 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,505 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,506 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,506 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,506 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,506 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,506 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,506 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,507 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,507 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,507 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,507 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,508 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,508 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,508 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,508 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,508 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,509 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,509 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,509 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,509 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,509 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,510 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,510 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,510 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,510 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,510 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,510 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,511 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,511 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,511 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,511 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,511 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,511 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,512 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,512 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,512 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,512 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,513 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,513 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,513 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,514 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,514 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,515 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,515 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,515 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,517 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,517 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,517 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,518 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,518 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,519 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,519 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,519 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,519 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,520 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,520 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,521 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,521 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,521 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,522 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,522 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,522 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,523 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,523 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,524 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,524 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,524 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,524 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:58,526 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 23:10:58,526 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:10:58,526 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:10:58,526 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:10:58,526 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:10:58,526 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:10:58,526 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:10:58,527 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:10:58,527 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:10:58,528 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 92 transitions [2019-12-18 23:10:58,529 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 102 places, 92 transitions [2019-12-18 23:10:58,545 INFO L126 PetriNetUnfolder]: 5/110 cut-off events. [2019-12-18 23:10:58,545 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:58,547 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 23:10:58,552 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 102 places, 92 transitions [2019-12-18 23:10:58,566 INFO L126 PetriNetUnfolder]: 5/110 cut-off events. [2019-12-18 23:10:58,567 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:58,569 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 23:10:58,574 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1608 [2019-12-18 23:10:58,574 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:11:00,032 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-12-18 23:11:00,303 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-12-18 23:11:00,428 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1840 [2019-12-18 23:11:00,428 INFO L214 etLargeBlockEncoding]: Total number of compositions: 80 [2019-12-18 23:11:00,429 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-18 23:11:00,453 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-18 23:11:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-18 23:11:00,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:11:00,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:00,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:11:00,454 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:00,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:00,454 INFO L82 PathProgramCache]: Analyzing trace with hash 564387, now seen corresponding path program 1 times [2019-12-18 23:11:00,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:00,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549840210] [2019-12-18 23:11:00,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:00,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549840210] [2019-12-18 23:11:00,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:00,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:11:00,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311557765] [2019-12-18 23:11:00,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:11:00,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:00,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:11:00,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:11:00,493 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-18 23:11:00,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:00,524 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-18 23:11:00,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:11:00,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:11:00,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:00,531 INFO L225 Difference]: With dead ends: 600 [2019-12-18 23:11:00,531 INFO L226 Difference]: Without dead ends: 559 [2019-12-18 23:11:00,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:11:00,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-18 23:11:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-18 23:11:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-18 23:11:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-18 23:11:00,565 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-18 23:11:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:00,566 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-18 23:11:00,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:11:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-18 23:11:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 23:11:00,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:00,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:00,567 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:00,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:00,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2099227938, now seen corresponding path program 1 times [2019-12-18 23:11:00,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:00,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505724042] [2019-12-18 23:11:00,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:00,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505724042] [2019-12-18 23:11:00,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:00,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:00,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188914030] [2019-12-18 23:11:00,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:00,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:00,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:00,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:00,641 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-18 23:11:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:00,731 INFO L93 Difference]: Finished difference Result 918 states and 2567 transitions. [2019-12-18 23:11:00,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:11:00,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 23:11:00,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:00,739 INFO L225 Difference]: With dead ends: 918 [2019-12-18 23:11:00,739 INFO L226 Difference]: Without dead ends: 915 [2019-12-18 23:11:00,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:00,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-12-18 23:11:00,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 576. [2019-12-18 23:11:00,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-18 23:11:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-18 23:11:00,766 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-18 23:11:00,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:00,766 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-18 23:11:00,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:00,766 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-18 23:11:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:11:00,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:00,768 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:00,768 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:00,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:00,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1126341274, now seen corresponding path program 1 times [2019-12-18 23:11:00,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:00,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60615784] [2019-12-18 23:11:00,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:00,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60615784] [2019-12-18 23:11:00,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:00,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:00,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62617809] [2019-12-18 23:11:00,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:00,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:00,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:00,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:00,836 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-18 23:11:00,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:00,945 INFO L93 Difference]: Finished difference Result 952 states and 2666 transitions. [2019-12-18 23:11:00,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:11:00,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 23:11:00,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:00,952 INFO L225 Difference]: With dead ends: 952 [2019-12-18 23:11:00,953 INFO L226 Difference]: Without dead ends: 948 [2019-12-18 23:11:00,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:00,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-12-18 23:11:00,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 605. [2019-12-18 23:11:00,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 23:11:00,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-18 23:11:00,981 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-18 23:11:00,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:00,982 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-18 23:11:00,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:00,982 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-18 23:11:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:11:00,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:00,984 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:00,984 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:00,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:00,985 INFO L82 PathProgramCache]: Analyzing trace with hash -821622243, now seen corresponding path program 1 times [2019-12-18 23:11:00,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:00,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794265806] [2019-12-18 23:11:00,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:01,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:01,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794265806] [2019-12-18 23:11:01,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957676097] [2019-12-18 23:11:01,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:01,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 23:11:01,180 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:01,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:01,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-18 23:11:01,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950210311] [2019-12-18 23:11:01,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:11:01,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:01,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:11:01,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:11:01,297 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 17 states. [2019-12-18 23:11:02,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:02,216 INFO L93 Difference]: Finished difference Result 1318 states and 3287 transitions. [2019-12-18 23:11:02,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 23:11:02,216 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2019-12-18 23:11:02,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:02,225 INFO L225 Difference]: With dead ends: 1318 [2019-12-18 23:11:02,225 INFO L226 Difference]: Without dead ends: 1313 [2019-12-18 23:11:02,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=372, Invalid=1434, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 23:11:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2019-12-18 23:11:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 591. [2019-12-18 23:11:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-12-18 23:11:02,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1849 transitions. [2019-12-18 23:11:02,253 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1849 transitions. Word has length 15 [2019-12-18 23:11:02,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:02,253 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 1849 transitions. [2019-12-18 23:11:02,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:11:02,254 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1849 transitions. [2019-12-18 23:11:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:11:02,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:02,255 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:02,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:02,460 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:02,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:02,461 INFO L82 PathProgramCache]: Analyzing trace with hash 82199709, now seen corresponding path program 2 times [2019-12-18 23:11:02,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:02,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436851717] [2019-12-18 23:11:02,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:02,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436851717] [2019-12-18 23:11:02,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669956861] [2019-12-18 23:11:02,542 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 23:11:02,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:11:02,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:02,614 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 23:11:02,616 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:02,725 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 23:11:02,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:02,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-18 23:11:02,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924532047] [2019-12-18 23:11:02,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:11:02,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:02,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:11:02,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:11:02,726 INFO L87 Difference]: Start difference. First operand 591 states and 1849 transitions. Second operand 17 states. [2019-12-18 23:11:03,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:03,629 INFO L93 Difference]: Finished difference Result 1825 states and 4665 transitions. [2019-12-18 23:11:03,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 23:11:03,630 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2019-12-18 23:11:03,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:03,642 INFO L225 Difference]: With dead ends: 1825 [2019-12-18 23:11:03,643 INFO L226 Difference]: Without dead ends: 1818 [2019-12-18 23:11:03,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=1396, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 23:11:03,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2019-12-18 23:11:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 540. [2019-12-18 23:11:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-12-18 23:11:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 1700 transitions. [2019-12-18 23:11:03,677 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 1700 transitions. Word has length 15 [2019-12-18 23:11:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:03,677 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 1700 transitions. [2019-12-18 23:11:03,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:11:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 1700 transitions. [2019-12-18 23:11:03,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 23:11:03,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:03,679 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:03,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:03,890 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:03,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:03,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1885947986, now seen corresponding path program 1 times [2019-12-18 23:11:03,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:03,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833622018] [2019-12-18 23:11:03,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:03,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833622018] [2019-12-18 23:11:03,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:03,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:03,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916756363] [2019-12-18 23:11:03,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:03,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:03,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:03,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:03,964 INFO L87 Difference]: Start difference. First operand 540 states and 1700 transitions. Second operand 5 states. [2019-12-18 23:11:04,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:04,041 INFO L93 Difference]: Finished difference Result 864 states and 2410 transitions. [2019-12-18 23:11:04,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:11:04,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 23:11:04,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:04,047 INFO L225 Difference]: With dead ends: 864 [2019-12-18 23:11:04,047 INFO L226 Difference]: Without dead ends: 856 [2019-12-18 23:11:04,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:04,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-12-18 23:11:04,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 549. [2019-12-18 23:11:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-18 23:11:04,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1686 transitions. [2019-12-18 23:11:04,065 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1686 transitions. Word has length 17 [2019-12-18 23:11:04,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:04,065 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1686 transitions. [2019-12-18 23:11:04,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:04,066 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1686 transitions. [2019-12-18 23:11:04,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 23:11:04,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:04,067 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:04,067 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:04,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:04,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1661426381, now seen corresponding path program 1 times [2019-12-18 23:11:04,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:04,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420384819] [2019-12-18 23:11:04,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:11:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:11:04,096 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:11:04,096 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:11:04,097 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 23:11:04,097 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-18 23:11:04,116 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,116 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,116 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,117 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,117 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,117 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,117 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,117 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,117 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,118 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,118 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,118 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,118 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,118 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,118 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,118 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,119 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,119 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,119 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,119 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,119 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,119 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,119 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,120 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,120 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,120 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,120 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,120 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,120 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,121 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,122 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,123 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,123 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,123 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,123 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,123 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,124 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,124 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,124 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,124 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,124 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,124 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,124 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,125 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,125 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,125 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,125 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,125 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,126 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,126 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,126 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,126 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,126 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,126 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,126 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,126 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,127 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,127 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,128 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,128 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,128 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,128 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,128 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,129 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,129 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,129 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,130 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,130 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,130 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,130 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,130 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,131 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,132 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,132 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,132 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,133 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,133 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,133 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,133 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,133 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,133 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,134 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,134 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,134 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,134 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,135 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,135 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,135 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,135 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,138 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,138 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,139 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,139 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,139 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,141 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,141 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,141 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,142 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,142 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,144 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,144 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,144 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,145 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,145 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,147 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,147 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,147 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,148 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,148 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,148 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,150 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,150 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,150 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,151 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,151 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,151 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,153 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,153 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,153 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,154 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,154 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,154 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,157 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,157 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,157 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,158 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,158 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,158 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:04,160 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 23:11:04,160 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:11:04,160 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:11:04,160 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:11:04,160 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:11:04,160 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:11:04,160 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:11:04,161 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:11:04,161 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:11:04,162 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 110 transitions [2019-12-18 23:11:04,162 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 123 places, 110 transitions [2019-12-18 23:11:04,196 INFO L126 PetriNetUnfolder]: 6/132 cut-off events. [2019-12-18 23:11:04,197 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:11:04,202 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 23:11:04,207 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 123 places, 110 transitions [2019-12-18 23:11:04,224 INFO L126 PetriNetUnfolder]: 6/132 cut-off events. [2019-12-18 23:11:04,224 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:11:04,226 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 23:11:04,231 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2192 [2019-12-18 23:11:04,231 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:11:05,770 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-18 23:11:06,134 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2220 [2019-12-18 23:11:06,135 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-18 23:11:06,135 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-18 23:11:06,252 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-18 23:11:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-18 23:11:06,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:11:06,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:06,253 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:11:06,253 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:06,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:06,254 INFO L82 PathProgramCache]: Analyzing trace with hash 792177, now seen corresponding path program 1 times [2019-12-18 23:11:06,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:06,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485814626] [2019-12-18 23:11:06,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:06,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485814626] [2019-12-18 23:11:06,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:06,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:11:06,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459468242] [2019-12-18 23:11:06,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:11:06,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:06,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:11:06,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:11:06,273 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-18 23:11:06,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:06,308 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-18 23:11:06,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:11:06,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:11:06,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:06,324 INFO L225 Difference]: With dead ends: 1889 [2019-12-18 23:11:06,324 INFO L226 Difference]: Without dead ends: 1767 [2019-12-18 23:11:06,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:11:06,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-18 23:11:06,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-18 23:11:06,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-18 23:11:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-18 23:11:06,389 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-18 23:11:06,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:06,390 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-18 23:11:06,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:11:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-18 23:11:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 23:11:06,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:06,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:06,391 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:06,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:06,391 INFO L82 PathProgramCache]: Analyzing trace with hash -982045597, now seen corresponding path program 1 times [2019-12-18 23:11:06,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:06,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193471780] [2019-12-18 23:11:06,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:06,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193471780] [2019-12-18 23:11:06,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:06,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:06,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676234606] [2019-12-18 23:11:06,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:06,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:06,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:06,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:06,433 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-18 23:11:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:06,619 INFO L93 Difference]: Finished difference Result 3302 states and 11435 transitions. [2019-12-18 23:11:06,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:11:06,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 23:11:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:06,645 INFO L225 Difference]: With dead ends: 3302 [2019-12-18 23:11:06,645 INFO L226 Difference]: Without dead ends: 3299 [2019-12-18 23:11:06,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:06,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2019-12-18 23:11:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 1914. [2019-12-18 23:11:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-18 23:11:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-18 23:11:06,729 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-18 23:11:06,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:06,729 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-18 23:11:06,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-18 23:11:06,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:11:06,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:06,730 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:06,730 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:06,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:06,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1476250518, now seen corresponding path program 1 times [2019-12-18 23:11:06,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:06,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998214149] [2019-12-18 23:11:06,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:06,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998214149] [2019-12-18 23:11:06,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:06,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:06,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574512138] [2019-12-18 23:11:06,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:06,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:06,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:06,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:06,765 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-18 23:11:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:06,875 INFO L93 Difference]: Finished difference Result 3604 states and 12619 transitions. [2019-12-18 23:11:06,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:11:06,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 23:11:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:06,902 INFO L225 Difference]: With dead ends: 3604 [2019-12-18 23:11:06,902 INFO L226 Difference]: Without dead ends: 3600 [2019-12-18 23:11:06,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3600 states. [2019-12-18 23:11:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3600 to 2147. [2019-12-18 23:11:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-18 23:11:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-18 23:11:06,988 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-18 23:11:06,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:06,990 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-18 23:11:06,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-18 23:11:06,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:11:06,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:06,991 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:06,992 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:06,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:06,992 INFO L82 PathProgramCache]: Analyzing trace with hash 65367165, now seen corresponding path program 1 times [2019-12-18 23:11:06,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:06,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001337370] [2019-12-18 23:11:06,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:07,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001337370] [2019-12-18 23:11:07,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948306200] [2019-12-18 23:11:07,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:07,140 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 23:11:07,142 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:07,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:07,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-18 23:11:07,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097160993] [2019-12-18 23:11:07,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:11:07,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:07,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:11:07,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:11:07,250 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 17 states. [2019-12-18 23:11:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:08,131 INFO L93 Difference]: Finished difference Result 7276 states and 24018 transitions. [2019-12-18 23:11:08,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 23:11:08,132 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2019-12-18 23:11:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:08,157 INFO L225 Difference]: With dead ends: 7276 [2019-12-18 23:11:08,157 INFO L226 Difference]: Without dead ends: 7270 [2019-12-18 23:11:08,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=1021, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 23:11:08,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7270 states. [2019-12-18 23:11:08,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7270 to 2291. [2019-12-18 23:11:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2019-12-18 23:11:08,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 9027 transitions. [2019-12-18 23:11:08,281 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 9027 transitions. Word has length 15 [2019-12-18 23:11:08,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:08,282 INFO L462 AbstractCegarLoop]: Abstraction has 2291 states and 9027 transitions. [2019-12-18 23:11:08,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:11:08,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 9027 transitions. [2019-12-18 23:11:08,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:11:08,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:08,283 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:08,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:08,486 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:08,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:08,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1209341565, now seen corresponding path program 2 times [2019-12-18 23:11:08,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:08,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226035538] [2019-12-18 23:11:08,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:08,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226035538] [2019-12-18 23:11:08,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411518397] [2019-12-18 23:11:08,559 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 23:11:08,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:11:08,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:08,644 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 23:11:08,646 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:08,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:08,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-18 23:11:08,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182701920] [2019-12-18 23:11:08,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:11:08,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:08,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:11:08,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:11:08,783 INFO L87 Difference]: Start difference. First operand 2291 states and 9027 transitions. Second operand 17 states. [2019-12-18 23:11:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:09,724 INFO L93 Difference]: Finished difference Result 7838 states and 25371 transitions. [2019-12-18 23:11:09,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 23:11:09,725 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2019-12-18 23:11:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:09,750 INFO L225 Difference]: With dead ends: 7838 [2019-12-18 23:11:09,751 INFO L226 Difference]: Without dead ends: 7834 [2019-12-18 23:11:09,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=421, Invalid=1385, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 23:11:09,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7834 states. [2019-12-18 23:11:09,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7834 to 2292. [2019-12-18 23:11:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2292 states. [2019-12-18 23:11:09,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 9029 transitions. [2019-12-18 23:11:09,882 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 9029 transitions. Word has length 15 [2019-12-18 23:11:09,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:09,883 INFO L462 AbstractCegarLoop]: Abstraction has 2292 states and 9029 transitions. [2019-12-18 23:11:09,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:11:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 9029 transitions. [2019-12-18 23:11:09,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:11:09,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:09,884 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:10,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:10,096 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:10,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:10,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1337558845, now seen corresponding path program 3 times [2019-12-18 23:11:10,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:10,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946621607] [2019-12-18 23:11:10,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:10,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946621607] [2019-12-18 23:11:10,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315545492] [2019-12-18 23:11:10,174 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 23:11:10,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 23:11:10,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:10,254 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 23:11:10,256 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:10,366 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 23:11:10,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:10,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-18 23:11:10,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951316011] [2019-12-18 23:11:10,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:11:10,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:10,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:11:10,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:11:10,368 INFO L87 Difference]: Start difference. First operand 2292 states and 9029 transitions. Second operand 17 states. [2019-12-18 23:11:11,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:11,447 INFO L93 Difference]: Finished difference Result 8168 states and 26351 transitions. [2019-12-18 23:11:11,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 23:11:11,447 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2019-12-18 23:11:11,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:11,469 INFO L225 Difference]: With dead ends: 8168 [2019-12-18 23:11:11,469 INFO L226 Difference]: Without dead ends: 8161 [2019-12-18 23:11:11,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=1396, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 23:11:11,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8161 states. [2019-12-18 23:11:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8161 to 2253. [2019-12-18 23:11:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2019-12-18 23:11:11,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 8861 transitions. [2019-12-18 23:11:11,595 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 8861 transitions. Word has length 15 [2019-12-18 23:11:11,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:11,595 INFO L462 AbstractCegarLoop]: Abstraction has 2253 states and 8861 transitions. [2019-12-18 23:11:11,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:11:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 8861 transitions. [2019-12-18 23:11:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:11:11,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:11,596 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:11,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:11,800 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:11,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:11,800 INFO L82 PathProgramCache]: Analyzing trace with hash 46933139, now seen corresponding path program 4 times [2019-12-18 23:11:11,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:11,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173536809] [2019-12-18 23:11:11,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:11,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173536809] [2019-12-18 23:11:11,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977200075] [2019-12-18 23:11:11,893 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 23:11:11,960 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:11:11,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:11,961 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 23:11:11,962 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:12,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:12,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-18 23:11:12,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890686990] [2019-12-18 23:11:12,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:11:12,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:12,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:11:12,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:11:12,084 INFO L87 Difference]: Start difference. First operand 2253 states and 8861 transitions. Second operand 17 states. [2019-12-18 23:11:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:13,196 INFO L93 Difference]: Finished difference Result 10267 states and 33737 transitions. [2019-12-18 23:11:13,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 23:11:13,197 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2019-12-18 23:11:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:13,213 INFO L225 Difference]: With dead ends: 10267 [2019-12-18 23:11:13,213 INFO L226 Difference]: Without dead ends: 10263 [2019-12-18 23:11:13,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=479, Invalid=1683, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 23:11:13,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10263 states. [2019-12-18 23:11:13,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10263 to 2148. [2019-12-18 23:11:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2148 states. [2019-12-18 23:11:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 8359 transitions. [2019-12-18 23:11:13,340 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 8359 transitions. Word has length 15 [2019-12-18 23:11:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:13,340 INFO L462 AbstractCegarLoop]: Abstraction has 2148 states and 8359 transitions. [2019-12-18 23:11:13,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:11:13,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 8359 transitions. [2019-12-18 23:11:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:11:13,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:13,341 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:13,545 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:13,545 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:13,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:13,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1190907539, now seen corresponding path program 5 times [2019-12-18 23:11:13,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:13,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716719187] [2019-12-18 23:11:13,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:13,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716719187] [2019-12-18 23:11:13,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866692199] [2019-12-18 23:11:13,636 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 23:11:13,699 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:11:13,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:13,701 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 23:11:13,702 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:13,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:13,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-18 23:11:13,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091396154] [2019-12-18 23:11:13,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:11:13,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:13,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:11:13,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:11:13,794 INFO L87 Difference]: Start difference. First operand 2148 states and 8359 transitions. Second operand 17 states. [2019-12-18 23:11:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:14,711 INFO L93 Difference]: Finished difference Result 6427 states and 20425 transitions. [2019-12-18 23:11:14,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:14,711 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2019-12-18 23:11:14,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:14,722 INFO L225 Difference]: With dead ends: 6427 [2019-12-18 23:11:14,722 INFO L226 Difference]: Without dead ends: 6423 [2019-12-18 23:11:14,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=339, Invalid=1221, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 23:11:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6423 states. [2019-12-18 23:11:14,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6423 to 2147. [2019-12-18 23:11:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-18 23:11:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8356 transitions. [2019-12-18 23:11:14,813 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8356 transitions. Word has length 15 [2019-12-18 23:11:14,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:14,814 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8356 transitions. [2019-12-18 23:11:14,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:11:14,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8356 transitions. [2019-12-18 23:11:14,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:11:14,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:14,815 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:15,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:15,019 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:15,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:15,020 INFO L82 PathProgramCache]: Analyzing trace with hash -526841521, now seen corresponding path program 6 times [2019-12-18 23:11:15,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:15,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953077063] [2019-12-18 23:11:15,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:15,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953077063] [2019-12-18 23:11:15,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842272023] [2019-12-18 23:11:15,089 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 23:11:15,161 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-18 23:11:15,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:15,162 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 23:11:15,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:15,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:15,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-18 23:11:15,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960681021] [2019-12-18 23:11:15,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:11:15,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:15,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:11:15,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:11:15,250 INFO L87 Difference]: Start difference. First operand 2147 states and 8356 transitions. Second operand 17 states. [2019-12-18 23:11:16,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:16,298 INFO L93 Difference]: Finished difference Result 6160 states and 19311 transitions. [2019-12-18 23:11:16,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 23:11:16,299 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2019-12-18 23:11:16,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:16,314 INFO L225 Difference]: With dead ends: 6160 [2019-12-18 23:11:16,315 INFO L226 Difference]: Without dead ends: 6156 [2019-12-18 23:11:16,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=372, Invalid=1434, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 23:11:16,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6156 states. [2019-12-18 23:11:16,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6156 to 1998. [2019-12-18 23:11:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-18 23:11:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-18 23:11:16,474 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-18 23:11:16,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:16,474 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-18 23:11:16,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:11:16,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-18 23:11:16,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 23:11:16,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:16,475 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:16,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:16,688 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:16,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:16,689 INFO L82 PathProgramCache]: Analyzing trace with hash -773481600, now seen corresponding path program 1 times [2019-12-18 23:11:16,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:16,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575358987] [2019-12-18 23:11:16,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:16,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575358987] [2019-12-18 23:11:16,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:16,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:16,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326780660] [2019-12-18 23:11:16,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:16,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:16,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:16,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:16,728 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-18 23:11:16,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:16,817 INFO L93 Difference]: Finished difference Result 3692 states and 13037 transitions. [2019-12-18 23:11:16,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:11:16,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 23:11:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:16,828 INFO L225 Difference]: With dead ends: 3692 [2019-12-18 23:11:16,828 INFO L226 Difference]: Without dead ends: 3684 [2019-12-18 23:11:16,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2019-12-18 23:11:16,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 2245. [2019-12-18 23:11:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-18 23:11:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-18 23:11:16,905 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-18 23:11:16,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:16,905 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-18 23:11:16,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:16,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-18 23:11:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:16,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:16,908 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:16,909 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:16,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:16,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2045174229, now seen corresponding path program 1 times [2019-12-18 23:11:16,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:16,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339774770] [2019-12-18 23:11:16,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:17,032 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 23:11:17,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339774770] [2019-12-18 23:11:17,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90043283] [2019-12-18 23:11:17,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:17,106 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 23:11:17,107 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:17,241 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 23:11:17,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:17,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-12-18 23:11:17,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492693369] [2019-12-18 23:11:17,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 23:11:17,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:17,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 23:11:17,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-18 23:11:17,245 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 19 states. [2019-12-18 23:11:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:18,705 INFO L93 Difference]: Finished difference Result 10966 states and 36904 transitions. [2019-12-18 23:11:18,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-18 23:11:18,715 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-18 23:11:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:18,733 INFO L225 Difference]: With dead ends: 10966 [2019-12-18 23:11:18,734 INFO L226 Difference]: Without dead ends: 10950 [2019-12-18 23:11:18,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=733, Invalid=2459, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 23:11:18,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10950 states. [2019-12-18 23:11:18,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10950 to 2483. [2019-12-18 23:11:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2483 states. [2019-12-18 23:11:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 9814 transitions. [2019-12-18 23:11:18,864 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 9814 transitions. Word has length 19 [2019-12-18 23:11:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:18,865 INFO L462 AbstractCegarLoop]: Abstraction has 2483 states and 9814 transitions. [2019-12-18 23:11:18,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 23:11:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 9814 transitions. [2019-12-18 23:11:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:18,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:18,867 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:19,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:19,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 23:11:19,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:19,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1675124677, now seen corresponding path program 2 times [2019-12-18 23:11:19,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:19,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488240399] [2019-12-18 23:11:19,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:19,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 23:11:19,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488240399] [2019-12-18 23:11:19,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799624265] [2019-12-18 23:11:19,211 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 23:11:19,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:11:19,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:19,321 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 23:11:19,322 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:19,449 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 23:11:19,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:19,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-18 23:11:19,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099719841] [2019-12-18 23:11:19,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:11:19,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:19,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:11:19,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:11:19,451 INFO L87 Difference]: Start difference. First operand 2483 states and 9814 transitions. Second operand 17 states. [2019-12-18 23:11:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:21,061 INFO L93 Difference]: Finished difference Result 8758 states and 29199 transitions. [2019-12-18 23:11:21,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 23:11:21,065 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2019-12-18 23:11:21,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:21,080 INFO L225 Difference]: With dead ends: 8758 [2019-12-18 23:11:21,080 INFO L226 Difference]: Without dead ends: 8733 [2019-12-18 23:11:21,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=770, Invalid=2770, Unknown=0, NotChecked=0, Total=3540 [2019-12-18 23:11:21,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8733 states. [2019-12-18 23:11:21,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8733 to 2424. [2019-12-18 23:11:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2424 states. [2019-12-18 23:11:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 9475 transitions. [2019-12-18 23:11:21,190 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 9475 transitions. Word has length 19 [2019-12-18 23:11:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:21,190 INFO L462 AbstractCegarLoop]: Abstraction has 2424 states and 9475 transitions. [2019-12-18 23:11:21,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:11:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 9475 transitions. [2019-12-18 23:11:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:21,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:21,192 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:21,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:21,396 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:21,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:21,396 INFO L82 PathProgramCache]: Analyzing trace with hash -287060421, now seen corresponding path program 1 times [2019-12-18 23:11:21,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:21,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829454316] [2019-12-18 23:11:21,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:21,516 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 23:11:21,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829454316] [2019-12-18 23:11:21,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905717286] [2019-12-18 23:11:21,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:21,583 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 23:11:21,584 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:21,697 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 23:11:21,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:21,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-12-18 23:11:21,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426820164] [2019-12-18 23:11:21,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 23:11:21,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:21,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 23:11:21,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-12-18 23:11:21,699 INFO L87 Difference]: Start difference. First operand 2424 states and 9475 transitions. Second operand 19 states. [2019-12-18 23:11:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:22,659 INFO L93 Difference]: Finished difference Result 6407 states and 22333 transitions. [2019-12-18 23:11:22,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 23:11:22,660 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-18 23:11:22,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:22,670 INFO L225 Difference]: With dead ends: 6407 [2019-12-18 23:11:22,671 INFO L226 Difference]: Without dead ends: 6390 [2019-12-18 23:11:22,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 23:11:22,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6390 states. [2019-12-18 23:11:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6390 to 2626. [2019-12-18 23:11:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2626 states. [2019-12-18 23:11:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 10419 transitions. [2019-12-18 23:11:22,798 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 10419 transitions. Word has length 19 [2019-12-18 23:11:22,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:22,798 INFO L462 AbstractCegarLoop]: Abstraction has 2626 states and 10419 transitions. [2019-12-18 23:11:22,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 23:11:22,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 10419 transitions. [2019-12-18 23:11:22,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:22,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:22,799 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:23,002 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:23,003 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:23,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:23,004 INFO L82 PathProgramCache]: Analyzing trace with hash -286456665, now seen corresponding path program 3 times [2019-12-18 23:11:23,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:23,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906426392] [2019-12-18 23:11:23,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:23,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 23:11:23,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906426392] [2019-12-18 23:11:23,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559324953] [2019-12-18 23:11:23,074 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:23,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 23:11:23,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:23,140 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 23:11:23,141 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:23,262 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 23:11:23,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:23,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-12-18 23:11:23,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106432553] [2019-12-18 23:11:23,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 23:11:23,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:23,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 23:11:23,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-12-18 23:11:23,264 INFO L87 Difference]: Start difference. First operand 2626 states and 10419 transitions. Second operand 19 states. [2019-12-18 23:11:24,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:24,750 INFO L93 Difference]: Finished difference Result 9633 states and 33319 transitions. [2019-12-18 23:11:24,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 23:11:24,750 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-18 23:11:24,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:24,766 INFO L225 Difference]: With dead ends: 9633 [2019-12-18 23:11:24,766 INFO L226 Difference]: Without dead ends: 9616 [2019-12-18 23:11:24,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=639, Invalid=2223, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 23:11:24,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9616 states. [2019-12-18 23:11:24,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9616 to 2631. [2019-12-18 23:11:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2631 states. [2019-12-18 23:11:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 10430 transitions. [2019-12-18 23:11:24,869 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 10430 transitions. Word has length 19 [2019-12-18 23:11:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:24,870 INFO L462 AbstractCegarLoop]: Abstraction has 2631 states and 10430 transitions. [2019-12-18 23:11:24,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 23:11:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 10430 transitions. [2019-12-18 23:11:24,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:24,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:24,871 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:25,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:25,072 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:25,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:25,073 INFO L82 PathProgramCache]: Analyzing trace with hash -286465221, now seen corresponding path program 2 times [2019-12-18 23:11:25,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:25,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402658140] [2019-12-18 23:11:25,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:25,145 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 23:11:25,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402658140] [2019-12-18 23:11:25,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788780678] [2019-12-18 23:11:25,145 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:25,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:11:25,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:25,231 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 23:11:25,233 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:25,408 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 23:11:25,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:25,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2019-12-18 23:11:25,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873037057] [2019-12-18 23:11:25,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 23:11:25,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:25,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 23:11:25,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-12-18 23:11:25,410 INFO L87 Difference]: Start difference. First operand 2631 states and 10430 transitions. Second operand 18 states. [2019-12-18 23:11:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:26,419 INFO L93 Difference]: Finished difference Result 5572 states and 18980 transitions. [2019-12-18 23:11:26,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 23:11:26,419 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-12-18 23:11:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:26,428 INFO L225 Difference]: With dead ends: 5572 [2019-12-18 23:11:26,429 INFO L226 Difference]: Without dead ends: 5557 [2019-12-18 23:11:26,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=359, Invalid=1201, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 23:11:26,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5557 states. [2019-12-18 23:11:26,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5557 to 2652. [2019-12-18 23:11:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2652 states. [2019-12-18 23:11:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 10512 transitions. [2019-12-18 23:11:26,512 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 10512 transitions. Word has length 19 [2019-12-18 23:11:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:26,512 INFO L462 AbstractCegarLoop]: Abstraction has 2652 states and 10512 transitions. [2019-12-18 23:11:26,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 23:11:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 10512 transitions. [2019-12-18 23:11:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:26,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:26,514 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:26,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:26,718 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:26,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:26,718 INFO L82 PathProgramCache]: Analyzing trace with hash 244420411, now seen corresponding path program 3 times [2019-12-18 23:11:26,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:26,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260859622] [2019-12-18 23:11:26,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:11:26,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260859622] [2019-12-18 23:11:26,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51171472] [2019-12-18 23:11:26,833 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:26,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 23:11:26,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:26,914 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 23:11:26,915 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:27,024 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 23:11:27,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:27,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-12-18 23:11:27,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917840179] [2019-12-18 23:11:27,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 23:11:27,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:27,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 23:11:27,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-12-18 23:11:27,026 INFO L87 Difference]: Start difference. First operand 2652 states and 10512 transitions. Second operand 18 states. [2019-12-18 23:11:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:28,024 INFO L93 Difference]: Finished difference Result 7489 states and 25789 transitions. [2019-12-18 23:11:28,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 23:11:28,025 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-12-18 23:11:28,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:28,047 INFO L225 Difference]: With dead ends: 7489 [2019-12-18 23:11:28,047 INFO L226 Difference]: Without dead ends: 7478 [2019-12-18 23:11:28,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=377, Invalid=1263, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 23:11:28,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7478 states. [2019-12-18 23:11:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7478 to 2783. [2019-12-18 23:11:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2783 states. [2019-12-18 23:11:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 11148 transitions. [2019-12-18 23:11:28,182 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 11148 transitions. Word has length 19 [2019-12-18 23:11:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:28,183 INFO L462 AbstractCegarLoop]: Abstraction has 2783 states and 11148 transitions. [2019-12-18 23:11:28,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 23:11:28,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 11148 transitions. [2019-12-18 23:11:28,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:28,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:28,186 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:28,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:28,390 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:28,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:28,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1118161091, now seen corresponding path program 4 times [2019-12-18 23:11:28,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:28,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857098114] [2019-12-18 23:11:28,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:11:28,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857098114] [2019-12-18 23:11:28,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814365610] [2019-12-18 23:11:28,464 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:28,529 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:11:28,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:28,530 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 23:11:28,531 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:28,638 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 23:11:28,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:28,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-12-18 23:11:28,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328007984] [2019-12-18 23:11:28,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 23:11:28,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:28,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 23:11:28,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-18 23:11:28,640 INFO L87 Difference]: Start difference. First operand 2783 states and 11148 transitions. Second operand 18 states. [2019-12-18 23:11:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:29,563 INFO L93 Difference]: Finished difference Result 6451 states and 22051 transitions. [2019-12-18 23:11:29,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 23:11:29,563 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-12-18 23:11:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:29,574 INFO L225 Difference]: With dead ends: 6451 [2019-12-18 23:11:29,574 INFO L226 Difference]: Without dead ends: 6442 [2019-12-18 23:11:29,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=353, Invalid=1207, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 23:11:29,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6442 states. [2019-12-18 23:11:29,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6442 to 2706. [2019-12-18 23:11:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2019-12-18 23:11:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 10735 transitions. [2019-12-18 23:11:29,636 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 10735 transitions. Word has length 19 [2019-12-18 23:11:29,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:29,636 INFO L462 AbstractCegarLoop]: Abstraction has 2706 states and 10735 transitions. [2019-12-18 23:11:29,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 23:11:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 10735 transitions. [2019-12-18 23:11:29,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:29,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:29,637 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:29,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:29,839 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:29,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:29,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1977035621, now seen corresponding path program 5 times [2019-12-18 23:11:29,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:29,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504853278] [2019-12-18 23:11:29,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:11:29,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504853278] [2019-12-18 23:11:29,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84164054] [2019-12-18 23:11:29,900 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:29,967 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 23:11:29,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:29,968 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 23:11:29,969 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:30,100 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 23:11:30,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:30,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-18 23:11:30,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339477693] [2019-12-18 23:11:30,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:11:30,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:30,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:11:30,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:11:30,102 INFO L87 Difference]: Start difference. First operand 2706 states and 10735 transitions. Second operand 17 states. [2019-12-18 23:11:31,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:31,170 INFO L93 Difference]: Finished difference Result 6906 states and 22904 transitions. [2019-12-18 23:11:31,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 23:11:31,171 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2019-12-18 23:11:31,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:31,181 INFO L225 Difference]: With dead ends: 6906 [2019-12-18 23:11:31,181 INFO L226 Difference]: Without dead ends: 6882 [2019-12-18 23:11:31,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=461, Invalid=1609, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 23:11:31,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6882 states. [2019-12-18 23:11:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6882 to 2393. [2019-12-18 23:11:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2393 states. [2019-12-18 23:11:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 9343 transitions. [2019-12-18 23:11:31,244 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 9343 transitions. Word has length 19 [2019-12-18 23:11:31,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:31,244 INFO L462 AbstractCegarLoop]: Abstraction has 2393 states and 9343 transitions. [2019-12-18 23:11:31,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:11:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 9343 transitions. [2019-12-18 23:11:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:31,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:31,246 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:31,447 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:31,447 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 23:11:31,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:31,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1004938431, now seen corresponding path program 4 times [2019-12-18 23:11:31,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:31,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727655076] [2019-12-18 23:11:31,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:31,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 23:11:31,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727655076] [2019-12-18 23:11:31,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590193505] [2019-12-18 23:11:31,544 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:31,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:11:31,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:31,624 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 23:11:31,626 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:31,754 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 23:11:31,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:31,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-12-18 23:11:31,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291666074] [2019-12-18 23:11:31,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 23:11:31,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:31,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 23:11:31,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-18 23:11:31,755 INFO L87 Difference]: Start difference. First operand 2393 states and 9343 transitions. Second operand 19 states. [2019-12-18 23:11:32,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:32,954 INFO L93 Difference]: Finished difference Result 9397 states and 32947 transitions. [2019-12-18 23:11:32,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 23:11:32,955 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-18 23:11:32,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:32,971 INFO L225 Difference]: With dead ends: 9397 [2019-12-18 23:11:32,971 INFO L226 Difference]: Without dead ends: 9388 [2019-12-18 23:11:32,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=439, Invalid=1453, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 23:11:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9388 states. [2019-12-18 23:11:33,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9388 to 2321. [2019-12-18 23:11:33,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-12-18 23:11:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 8978 transitions. [2019-12-18 23:11:33,092 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 8978 transitions. Word has length 19 [2019-12-18 23:11:33,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:33,093 INFO L462 AbstractCegarLoop]: Abstraction has 2321 states and 8978 transitions. [2019-12-18 23:11:33,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 23:11:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 8978 transitions. [2019-12-18 23:11:33,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:33,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:33,094 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:33,294 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:33,295 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 23:11:33,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:33,295 INFO L82 PathProgramCache]: Analyzing trace with hash 138142239, now seen corresponding path program 5 times [2019-12-18 23:11:33,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:33,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78478465] [2019-12-18 23:11:33,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:33,394 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 23:11:33,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78478465] [2019-12-18 23:11:33,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011533998] [2019-12-18 23:11:33,395 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 23:11:33,461 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 23:11:33,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:33,462 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 23:11:33,463 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:33,559 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 23:11:33,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:33,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2019-12-18 23:11:33,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428972249] [2019-12-18 23:11:33,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 23:11:33,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:33,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 23:11:33,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-12-18 23:11:33,561 INFO L87 Difference]: Start difference. First operand 2321 states and 8978 transitions. Second operand 18 states. [2019-12-18 23:11:35,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:35,705 INFO L93 Difference]: Finished difference Result 10862 states and 35740 transitions. [2019-12-18 23:11:35,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 23:11:35,706 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-12-18 23:11:35,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:35,723 INFO L225 Difference]: With dead ends: 10862 [2019-12-18 23:11:35,723 INFO L226 Difference]: Without dead ends: 10853 [2019-12-18 23:11:35,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1002, Invalid=3690, Unknown=0, NotChecked=0, Total=4692 [2019-12-18 23:11:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10853 states. [2019-12-18 23:11:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10853 to 2290. [2019-12-18 23:11:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2019-12-18 23:11:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 8856 transitions. [2019-12-18 23:11:35,876 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 8856 transitions. Word has length 19 [2019-12-18 23:11:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:35,876 INFO L462 AbstractCegarLoop]: Abstraction has 2290 states and 8856 transitions. [2019-12-18 23:11:35,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 23:11:35,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 8856 transitions. [2019-12-18 23:11:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:35,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:35,877 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:36,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:36,078 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 23:11:36,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:36,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1006622717, now seen corresponding path program 6 times [2019-12-18 23:11:36,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:36,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077150515] [2019-12-18 23:11:36,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:36,162 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 23:11:36,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077150515] [2019-12-18 23:11:36,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135261696] [2019-12-18 23:11:36,163 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 23:11:36,226 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-18 23:11:36,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:36,227 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 23:11:36,228 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:11:36,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:36,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2019-12-18 23:11:36,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331917909] [2019-12-18 23:11:36,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 23:11:36,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:36,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 23:11:36,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-12-18 23:11:36,318 INFO L87 Difference]: Start difference. First operand 2290 states and 8856 transitions. Second operand 18 states. [2019-12-18 23:11:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:37,714 INFO L93 Difference]: Finished difference Result 7128 states and 23125 transitions. [2019-12-18 23:11:37,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 23:11:37,714 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-12-18 23:11:37,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:37,725 INFO L225 Difference]: With dead ends: 7128 [2019-12-18 23:11:37,725 INFO L226 Difference]: Without dead ends: 7122 [2019-12-18 23:11:37,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=635, Invalid=2335, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 23:11:37,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7122 states. [2019-12-18 23:11:37,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7122 to 2289. [2019-12-18 23:11:37,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2289 states. [2019-12-18 23:11:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2289 states to 2289 states and 8853 transitions. [2019-12-18 23:11:37,783 INFO L78 Accepts]: Start accepts. Automaton has 2289 states and 8853 transitions. Word has length 19 [2019-12-18 23:11:37,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:37,784 INFO L462 AbstractCegarLoop]: Abstraction has 2289 states and 8853 transitions. [2019-12-18 23:11:37,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 23:11:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 8853 transitions. [2019-12-18 23:11:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:37,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:37,785 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:37,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:37,985 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 23:11:37,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:37,986 INFO L82 PathProgramCache]: Analyzing trace with hash -87468871, now seen corresponding path program 7 times [2019-12-18 23:11:37,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:37,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046831985] [2019-12-18 23:11:37,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:38,055 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 23:11:38,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046831985] [2019-12-18 23:11:38,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905344097] [2019-12-18 23:11:38,056 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 23:11:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:38,132 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 23:11:38,133 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:38,241 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 23:11:38,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:38,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-12-18 23:11:38,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424785512] [2019-12-18 23:11:38,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 23:11:38,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:38,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 23:11:38,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-18 23:11:38,243 INFO L87 Difference]: Start difference. First operand 2289 states and 8853 transitions. Second operand 19 states. [2019-12-18 23:11:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:39,758 INFO L93 Difference]: Finished difference Result 5827 states and 19195 transitions. [2019-12-18 23:11:39,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 23:11:39,759 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-18 23:11:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:39,768 INFO L225 Difference]: With dead ends: 5827 [2019-12-18 23:11:39,768 INFO L226 Difference]: Without dead ends: 5820 [2019-12-18 23:11:39,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=520, Invalid=2030, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 23:11:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5820 states. [2019-12-18 23:11:39,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5820 to 2133. [2019-12-18 23:11:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-18 23:11:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-18 23:11:39,819 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-18 23:11:39,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:39,820 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-18 23:11:39,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 23:11:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-18 23:11:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:39,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:39,821 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:40,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:40,024 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 23:11:40,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:40,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1682002470, now seen corresponding path program 1 times [2019-12-18 23:11:40,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:40,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724406431] [2019-12-18 23:11:40,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:40,125 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 23:11:40,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724406431] [2019-12-18 23:11:40,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410596043] [2019-12-18 23:11:40,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:40,187 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:11:40,188 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:40,350 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 23:11:40,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:40,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 23:11:40,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102080324] [2019-12-18 23:11:40,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:11:40,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:40,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:11:40,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:11:40,353 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 23 states. [2019-12-18 23:11:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:44,923 INFO L93 Difference]: Finished difference Result 19358 states and 59599 transitions. [2019-12-18 23:11:44,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-12-18 23:11:44,923 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 23:11:44,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:44,956 INFO L225 Difference]: With dead ends: 19358 [2019-12-18 23:11:44,956 INFO L226 Difference]: Without dead ends: 19346 [2019-12-18 23:11:44,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7159 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4011, Invalid=15449, Unknown=0, NotChecked=0, Total=19460 [2019-12-18 23:11:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19346 states. [2019-12-18 23:11:45,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19346 to 2206. [2019-12-18 23:11:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2019-12-18 23:11:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 8584 transitions. [2019-12-18 23:11:45,147 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 8584 transitions. Word has length 21 [2019-12-18 23:11:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:45,147 INFO L462 AbstractCegarLoop]: Abstraction has 2206 states and 8584 transitions. [2019-12-18 23:11:45,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:11:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 8584 transitions. [2019-12-18 23:11:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:45,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:45,150 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:45,352 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:45,353 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 23:11:45,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:45,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1682597670, now seen corresponding path program 2 times [2019-12-18 23:11:45,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:45,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390520998] [2019-12-18 23:11:45,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:45,439 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 23:11:45,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390520998] [2019-12-18 23:11:45,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721037403] [2019-12-18 23:11:45,440 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:45,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:11:45,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:45,507 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:11:45,508 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:45,658 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 23:11:45,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:45,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 23:11:45,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55816266] [2019-12-18 23:11:45,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:11:45,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:45,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:11:45,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:11:45,660 INFO L87 Difference]: Start difference. First operand 2206 states and 8584 transitions. Second operand 23 states. [2019-12-18 23:11:50,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:50,108 INFO L93 Difference]: Finished difference Result 19220 states and 59144 transitions. [2019-12-18 23:11:50,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-12-18 23:11:50,108 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 23:11:50,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:50,138 INFO L225 Difference]: With dead ends: 19220 [2019-12-18 23:11:50,138 INFO L226 Difference]: Without dead ends: 19205 [2019-12-18 23:11:50,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7234 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4011, Invalid=15449, Unknown=0, NotChecked=0, Total=19460 [2019-12-18 23:11:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19205 states. [2019-12-18 23:11:50,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19205 to 2204. [2019-12-18 23:11:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2204 states. [2019-12-18 23:11:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 8578 transitions. [2019-12-18 23:11:50,265 INFO L78 Accepts]: Start accepts. Automaton has 2204 states and 8578 transitions. Word has length 21 [2019-12-18 23:11:50,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:50,265 INFO L462 AbstractCegarLoop]: Abstraction has 2204 states and 8578 transitions. [2019-12-18 23:11:50,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:11:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 8578 transitions. [2019-12-18 23:11:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:50,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:50,267 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:50,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:50,470 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 23:11:50,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:50,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1202379396, now seen corresponding path program 3 times [2019-12-18 23:11:50,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:50,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943756588] [2019-12-18 23:11:50,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:50,555 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 23:11:50,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943756588] [2019-12-18 23:11:50,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980629285] [2019-12-18 23:11:50,555 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:50,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 23:11:50,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:50,647 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:11:50,648 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:50,905 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 23:11:50,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:50,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-12-18 23:11:50,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775128815] [2019-12-18 23:11:50,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 23:11:50,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:50,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 23:11:50,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:11:50,907 INFO L87 Difference]: Start difference. First operand 2204 states and 8578 transitions. Second operand 22 states. [2019-12-18 23:11:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:58,771 INFO L93 Difference]: Finished difference Result 24719 states and 72284 transitions. [2019-12-18 23:11:58,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-12-18 23:11:58,771 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-18 23:11:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:58,822 INFO L225 Difference]: With dead ends: 24719 [2019-12-18 23:11:58,822 INFO L226 Difference]: Without dead ends: 24702 [2019-12-18 23:11:58,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26109 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8432, Invalid=52330, Unknown=0, NotChecked=0, Total=60762 [2019-12-18 23:11:58,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24702 states. [2019-12-18 23:11:58,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24702 to 2374. [2019-12-18 23:11:58,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2374 states. [2019-12-18 23:11:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 9314 transitions. [2019-12-18 23:11:58,982 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 9314 transitions. Word has length 21 [2019-12-18 23:11:58,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:58,982 INFO L462 AbstractCegarLoop]: Abstraction has 2374 states and 9314 transitions. [2019-12-18 23:11:58,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 23:11:58,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 9314 transitions. [2019-12-18 23:11:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:58,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:58,984 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:59,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:59,187 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 23:11:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:59,187 INFO L82 PathProgramCache]: Analyzing trace with hash -818506432, now seen corresponding path program 4 times [2019-12-18 23:11:59,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:59,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269741123] [2019-12-18 23:11:59,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:59,265 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 23:11:59,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269741123] [2019-12-18 23:11:59,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632579239] [2019-12-18 23:11:59,266 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:59,343 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:11:59,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:59,344 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:11:59,344 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:59,469 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 23:11:59,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:59,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-12-18 23:11:59,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635092660] [2019-12-18 23:11:59,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 23:11:59,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:59,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 23:11:59,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:11:59,471 INFO L87 Difference]: Start difference. First operand 2374 states and 9314 transitions. Second operand 22 states. [2019-12-18 23:12:05,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:05,178 INFO L93 Difference]: Finished difference Result 17230 states and 51419 transitions. [2019-12-18 23:12:05,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-12-18 23:12:05,179 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-18 23:12:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:05,205 INFO L225 Difference]: With dead ends: 17230 [2019-12-18 23:12:05,206 INFO L226 Difference]: Without dead ends: 17221 [2019-12-18 23:12:05,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13985 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4831, Invalid=28475, Unknown=0, NotChecked=0, Total=33306 [2019-12-18 23:12:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17221 states. [2019-12-18 23:12:05,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17221 to 2366. [2019-12-18 23:12:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2366 states. [2019-12-18 23:12:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 9273 transitions. [2019-12-18 23:12:05,322 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 9273 transitions. Word has length 21 [2019-12-18 23:12:05,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:05,322 INFO L462 AbstractCegarLoop]: Abstraction has 2366 states and 9273 transitions. [2019-12-18 23:12:05,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 23:12:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 9273 transitions. [2019-12-18 23:12:05,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:05,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:05,324 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:05,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:05,525 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 23:12:05,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:05,525 INFO L82 PathProgramCache]: Analyzing trace with hash -817911232, now seen corresponding path program 5 times [2019-12-18 23:12:05,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:05,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493307020] [2019-12-18 23:12:05,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:05,620 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 23:12:05,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493307020] [2019-12-18 23:12:05,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447236963] [2019-12-18 23:12:05,621 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:05,689 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 23:12:05,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:12:05,690 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:12:05,691 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:05,827 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 23:12:05,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:05,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-12-18 23:12:05,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042934057] [2019-12-18 23:12:05,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 23:12:05,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:05,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 23:12:05,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:12:05,830 INFO L87 Difference]: Start difference. First operand 2366 states and 9273 transitions. Second operand 22 states. [2019-12-18 23:12:10,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:10,719 INFO L93 Difference]: Finished difference Result 17001 states and 51469 transitions. [2019-12-18 23:12:10,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-12-18 23:12:10,719 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-18 23:12:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:10,747 INFO L225 Difference]: With dead ends: 17001 [2019-12-18 23:12:10,748 INFO L226 Difference]: Without dead ends: 16988 [2019-12-18 23:12:10,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9817 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3878, Invalid=20614, Unknown=0, NotChecked=0, Total=24492 [2019-12-18 23:12:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16988 states. [2019-12-18 23:12:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16988 to 2350. [2019-12-18 23:12:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-12-18 23:12:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 9217 transitions. [2019-12-18 23:12:10,865 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 9217 transitions. Word has length 21 [2019-12-18 23:12:10,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:10,865 INFO L462 AbstractCegarLoop]: Abstraction has 2350 states and 9217 transitions. [2019-12-18 23:12:10,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 23:12:10,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 9217 transitions. [2019-12-18 23:12:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:10,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:10,867 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:11,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:11,068 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 23:12:11,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:11,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1450662060, now seen corresponding path program 6 times [2019-12-18 23:12:11,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:11,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401562735] [2019-12-18 23:12:11,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:11,169 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 23:12:11,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401562735] [2019-12-18 23:12:11,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315099942] [2019-12-18 23:12:11,170 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:11,241 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 23:12:11,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:12:11,242 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:12:11,243 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:11,375 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 23:12:11,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:11,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-12-18 23:12:11,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148744602] [2019-12-18 23:12:11,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 23:12:11,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:11,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 23:12:11,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:12:11,377 INFO L87 Difference]: Start difference. First operand 2350 states and 9217 transitions. Second operand 22 states. [2019-12-18 23:12:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:19,730 INFO L93 Difference]: Finished difference Result 21842 states and 63786 transitions. [2019-12-18 23:12:19,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2019-12-18 23:12:19,730 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-18 23:12:19,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:19,766 INFO L225 Difference]: With dead ends: 21842 [2019-12-18 23:12:19,766 INFO L226 Difference]: Without dead ends: 21835 [2019-12-18 23:12:19,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24760 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8175, Invalid=50147, Unknown=0, NotChecked=0, Total=58322 [2019-12-18 23:12:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21835 states. [2019-12-18 23:12:19,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21835 to 2316. [2019-12-18 23:12:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2316 states. [2019-12-18 23:12:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 9065 transitions. [2019-12-18 23:12:19,911 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 9065 transitions. Word has length 21 [2019-12-18 23:12:19,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:19,911 INFO L462 AbstractCegarLoop]: Abstraction has 2316 states and 9065 transitions. [2019-12-18 23:12:19,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 23:12:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 9065 transitions. [2019-12-18 23:12:19,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:19,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:19,913 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:20,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:20,113 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 23:12:20,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:20,114 INFO L82 PathProgramCache]: Analyzing trace with hash 586715080, now seen corresponding path program 7 times [2019-12-18 23:12:20,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:20,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222520234] [2019-12-18 23:12:20,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:20,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 23:12:20,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222520234] [2019-12-18 23:12:20,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128105510] [2019-12-18 23:12:20,211 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:20,313 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:12:20,314 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:20,511 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 23:12:20,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:20,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-12-18 23:12:20,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681953363] [2019-12-18 23:12:20,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 23:12:20,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:20,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 23:12:20,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:12:20,512 INFO L87 Difference]: Start difference. First operand 2316 states and 9065 transitions. Second operand 22 states. [2019-12-18 23:12:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:25,886 INFO L93 Difference]: Finished difference Result 14668 states and 42915 transitions. [2019-12-18 23:12:25,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-12-18 23:12:25,887 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-18 23:12:25,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:25,908 INFO L225 Difference]: With dead ends: 14668 [2019-12-18 23:12:25,908 INFO L226 Difference]: Without dead ends: 14661 [2019-12-18 23:12:25,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11650 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4461, Invalid=24951, Unknown=0, NotChecked=0, Total=29412 [2019-12-18 23:12:25,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14661 states. [2019-12-18 23:12:26,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14661 to 2331. [2019-12-18 23:12:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2331 states. [2019-12-18 23:12:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 2331 states and 9133 transitions. [2019-12-18 23:12:26,010 INFO L78 Accepts]: Start accepts. Automaton has 2331 states and 9133 transitions. Word has length 21 [2019-12-18 23:12:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:26,010 INFO L462 AbstractCegarLoop]: Abstraction has 2331 states and 9133 transitions. [2019-12-18 23:12:26,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 23:12:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 9133 transitions. [2019-12-18 23:12:26,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:26,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:26,012 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:26,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:26,213 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 23:12:26,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:26,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1445589610, now seen corresponding path program 8 times [2019-12-18 23:12:26,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:26,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772303396] [2019-12-18 23:12:26,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:26,301 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 23:12:26,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772303396] [2019-12-18 23:12:26,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572045593] [2019-12-18 23:12:26,302 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:26,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:12:26,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:12:26,367 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:12:26,368 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:26,505 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 23:12:26,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:26,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-12-18 23:12:26,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351275056] [2019-12-18 23:12:26,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 23:12:26,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:26,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 23:12:26,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:12:26,507 INFO L87 Difference]: Start difference. First operand 2331 states and 9133 transitions. Second operand 22 states. [2019-12-18 23:12:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:32,375 INFO L93 Difference]: Finished difference Result 14728 states and 43397 transitions. [2019-12-18 23:12:32,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-12-18 23:12:32,375 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-18 23:12:32,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:32,398 INFO L225 Difference]: With dead ends: 14728 [2019-12-18 23:12:32,398 INFO L226 Difference]: Without dead ends: 14723 [2019-12-18 23:12:32,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13439 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4729, Invalid=27133, Unknown=0, NotChecked=0, Total=31862 [2019-12-18 23:12:32,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14723 states. [2019-12-18 23:12:32,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14723 to 2341. [2019-12-18 23:12:32,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2341 states. [2019-12-18 23:12:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 9188 transitions. [2019-12-18 23:12:32,504 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 9188 transitions. Word has length 21 [2019-12-18 23:12:32,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:32,504 INFO L462 AbstractCegarLoop]: Abstraction has 2341 states and 9188 transitions. [2019-12-18 23:12:32,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 23:12:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 9188 transitions. [2019-12-18 23:12:32,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:32,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:32,506 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:32,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:32,710 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 23:12:32,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:32,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1343161106, now seen corresponding path program 1 times [2019-12-18 23:12:32,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:32,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706077449] [2019-12-18 23:12:32,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:12:32,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706077449] [2019-12-18 23:12:32,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:32,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:12:32,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798907819] [2019-12-18 23:12:32,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:12:32,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:32,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:12:32,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:12:32,744 INFO L87 Difference]: Start difference. First operand 2341 states and 9188 transitions. Second operand 5 states. [2019-12-18 23:12:32,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:32,829 INFO L93 Difference]: Finished difference Result 3954 states and 14234 transitions. [2019-12-18 23:12:32,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:12:32,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 23:12:32,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:32,839 INFO L225 Difference]: With dead ends: 3954 [2019-12-18 23:12:32,839 INFO L226 Difference]: Without dead ends: 3938 [2019-12-18 23:12:32,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2019-12-18 23:12:32,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 2616. [2019-12-18 23:12:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2616 states. [2019-12-18 23:12:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 10117 transitions. [2019-12-18 23:12:32,901 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 10117 transitions. Word has length 21 [2019-12-18 23:12:32,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:32,901 INFO L462 AbstractCegarLoop]: Abstraction has 2616 states and 10117 transitions. [2019-12-18 23:12:32,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:12:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 10117 transitions. [2019-12-18 23:12:32,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:32,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:32,903 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:32,903 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 23:12:32,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:32,904 INFO L82 PathProgramCache]: Analyzing trace with hash -979520350, now seen corresponding path program 9 times [2019-12-18 23:12:32,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:32,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350632292] [2019-12-18 23:12:32,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:32,998 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 23:12:32,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350632292] [2019-12-18 23:12:32,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835210426] [2019-12-18 23:12:32,999 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:33,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 23:12:33,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:12:33,072 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:12:33,072 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:33,232 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 23:12:33,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:33,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 23:12:33,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020043788] [2019-12-18 23:12:33,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:12:33,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:33,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:12:33,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:12:33,234 INFO L87 Difference]: Start difference. First operand 2616 states and 10117 transitions. Second operand 23 states. [2019-12-18 23:12:36,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:36,745 INFO L93 Difference]: Finished difference Result 16516 states and 52916 transitions. [2019-12-18 23:12:36,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-12-18 23:12:36,746 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 23:12:36,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:36,773 INFO L225 Difference]: With dead ends: 16516 [2019-12-18 23:12:36,773 INFO L226 Difference]: Without dead ends: 16504 [2019-12-18 23:12:36,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4892 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2483, Invalid=10857, Unknown=0, NotChecked=0, Total=13340 [2019-12-18 23:12:36,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16504 states. [2019-12-18 23:12:36,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16504 to 2669. [2019-12-18 23:12:36,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2669 states. [2019-12-18 23:12:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 10364 transitions. [2019-12-18 23:12:36,895 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 10364 transitions. Word has length 21 [2019-12-18 23:12:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:36,895 INFO L462 AbstractCegarLoop]: Abstraction has 2669 states and 10364 transitions. [2019-12-18 23:12:36,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:12:36,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 10364 transitions. [2019-12-18 23:12:36,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:36,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:36,896 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:37,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:37,100 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 23:12:37,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:37,100 INFO L82 PathProgramCache]: Analyzing trace with hash -987138910, now seen corresponding path program 10 times [2019-12-18 23:12:37,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:37,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181490051] [2019-12-18 23:12:37,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:37,205 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 23:12:37,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181490051] [2019-12-18 23:12:37,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442878564] [2019-12-18 23:12:37,206 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:37,312 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:12:37,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:12:37,314 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:12:37,315 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:37,575 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 23:12:37,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:37,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 23:12:37,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918307403] [2019-12-18 23:12:37,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:12:37,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:37,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:12:37,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:12:37,577 INFO L87 Difference]: Start difference. First operand 2669 states and 10364 transitions. Second operand 23 states. [2019-12-18 23:12:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:40,681 INFO L93 Difference]: Finished difference Result 13860 states and 44128 transitions. [2019-12-18 23:12:40,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-18 23:12:40,683 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 23:12:40,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:40,706 INFO L225 Difference]: With dead ends: 13860 [2019-12-18 23:12:40,706 INFO L226 Difference]: Without dead ends: 13844 [2019-12-18 23:12:40,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3572 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1986, Invalid=8316, Unknown=0, NotChecked=0, Total=10302 [2019-12-18 23:12:40,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13844 states. [2019-12-18 23:12:40,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13844 to 2667. [2019-12-18 23:12:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2667 states. [2019-12-18 23:12:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 10357 transitions. [2019-12-18 23:12:40,811 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 10357 transitions. Word has length 21 [2019-12-18 23:12:40,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:40,812 INFO L462 AbstractCegarLoop]: Abstraction has 2667 states and 10357 transitions. [2019-12-18 23:12:40,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:12:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 10357 transitions. [2019-12-18 23:12:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:40,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:40,813 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:41,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:41,014 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 23:12:41,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:41,014 INFO L82 PathProgramCache]: Analyzing trace with hash -406937950, now seen corresponding path program 11 times [2019-12-18 23:12:41,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:41,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527504933] [2019-12-18 23:12:41,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:41,120 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 23:12:41,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527504933] [2019-12-18 23:12:41,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041655755] [2019-12-18 23:12:41,120 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:41,193 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 23:12:41,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:12:41,194 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:12:41,195 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:41,327 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 23:12:41,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:41,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 23:12:41,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860279633] [2019-12-18 23:12:41,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:12:41,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:41,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:12:41,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:12:41,330 INFO L87 Difference]: Start difference. First operand 2667 states and 10357 transitions. Second operand 23 states. [2019-12-18 23:12:45,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:45,863 INFO L93 Difference]: Finished difference Result 19930 states and 62473 transitions. [2019-12-18 23:12:45,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-12-18 23:12:45,864 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 23:12:45,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:45,900 INFO L225 Difference]: With dead ends: 19930 [2019-12-18 23:12:45,900 INFO L226 Difference]: Without dead ends: 19918 [2019-12-18 23:12:45,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8257 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3803, Invalid=17659, Unknown=0, NotChecked=0, Total=21462 [2019-12-18 23:12:45,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19918 states. [2019-12-18 23:12:46,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19918 to 2581. [2019-12-18 23:12:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2581 states. [2019-12-18 23:12:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 9959 transitions. [2019-12-18 23:12:46,048 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 9959 transitions. Word has length 21 [2019-12-18 23:12:46,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:46,048 INFO L462 AbstractCegarLoop]: Abstraction has 2581 states and 9959 transitions. [2019-12-18 23:12:46,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:12:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 9959 transitions. [2019-12-18 23:12:46,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:46,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:46,049 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:46,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:46,250 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 23:12:46,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:46,251 INFO L82 PathProgramCache]: Analyzing trace with hash -415151710, now seen corresponding path program 12 times [2019-12-18 23:12:46,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:46,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924277827] [2019-12-18 23:12:46,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:46,362 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 23:12:46,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924277827] [2019-12-18 23:12:46,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889877532] [2019-12-18 23:12:46,363 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:46,473 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 23:12:46,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:12:46,474 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:12:46,475 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:46,616 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 23:12:46,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:46,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 23:12:46,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332257712] [2019-12-18 23:12:46,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:12:46,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:46,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:12:46,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:12:46,619 INFO L87 Difference]: Start difference. First operand 2581 states and 9959 transitions. Second operand 23 states. [2019-12-18 23:12:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:51,112 INFO L93 Difference]: Finished difference Result 17000 states and 52070 transitions. [2019-12-18 23:12:51,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-12-18 23:12:51,112 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 23:12:51,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:51,146 INFO L225 Difference]: With dead ends: 17000 [2019-12-18 23:12:51,147 INFO L226 Difference]: Without dead ends: 16983 [2019-12-18 23:12:51,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8639 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3842, Invalid=18210, Unknown=0, NotChecked=0, Total=22052 [2019-12-18 23:12:51,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16983 states. [2019-12-18 23:12:51,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16983 to 2536. [2019-12-18 23:12:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2536 states. [2019-12-18 23:12:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 9774 transitions. [2019-12-18 23:12:51,313 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 9774 transitions. Word has length 21 [2019-12-18 23:12:51,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:51,313 INFO L462 AbstractCegarLoop]: Abstraction has 2536 states and 9774 transitions. [2019-12-18 23:12:51,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:12:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 9774 transitions. [2019-12-18 23:12:51,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:51,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:51,315 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:51,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:51,515 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 23:12:51,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:51,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1659307204, now seen corresponding path program 13 times [2019-12-18 23:12:51,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:51,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120353529] [2019-12-18 23:12:51,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:51,604 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 23:12:51,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120353529] [2019-12-18 23:12:51,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865983013] [2019-12-18 23:12:51,604 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:51,668 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:12:51,669 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:51,808 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 23:12:51,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:51,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-12-18 23:12:51,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986500482] [2019-12-18 23:12:51,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 23:12:51,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:51,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 23:12:51,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:12:51,810 INFO L87 Difference]: Start difference. First operand 2536 states and 9774 transitions. Second operand 22 states. [2019-12-18 23:12:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:56,579 INFO L93 Difference]: Finished difference Result 20911 states and 65114 transitions. [2019-12-18 23:12:56,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-12-18 23:12:56,579 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-18 23:12:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:56,615 INFO L225 Difference]: With dead ends: 20911 [2019-12-18 23:12:56,615 INFO L226 Difference]: Without dead ends: 20900 [2019-12-18 23:12:56,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9321 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3721, Invalid=20149, Unknown=0, NotChecked=0, Total=23870 [2019-12-18 23:12:56,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20900 states. [2019-12-18 23:12:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20900 to 2594. [2019-12-18 23:12:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2594 states. [2019-12-18 23:12:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 10042 transitions. [2019-12-18 23:12:56,755 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 10042 transitions. Word has length 21 [2019-12-18 23:12:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:56,755 INFO L462 AbstractCegarLoop]: Abstraction has 2594 states and 10042 transitions. [2019-12-18 23:12:56,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 23:12:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 10042 transitions. [2019-12-18 23:12:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:56,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:56,757 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:56,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:56,960 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 23:12:56,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:56,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1492579422, now seen corresponding path program 14 times [2019-12-18 23:12:56,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:56,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233080396] [2019-12-18 23:12:56,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:57,034 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 23:12:57,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233080396] [2019-12-18 23:12:57,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554304793] [2019-12-18 23:12:57,035 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:57,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:12:57,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:12:57,103 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:12:57,103 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:57,244 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 23:12:57,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:57,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-12-18 23:12:57,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986862116] [2019-12-18 23:12:57,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 23:12:57,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:57,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 23:12:57,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:12:57,246 INFO L87 Difference]: Start difference. First operand 2594 states and 10042 transitions. Second operand 22 states. [2019-12-18 23:13:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:04,473 INFO L93 Difference]: Finished difference Result 25021 states and 76625 transitions. [2019-12-18 23:13:04,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2019-12-18 23:13:04,474 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-18 23:13:04,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:04,516 INFO L225 Difference]: With dead ends: 25021 [2019-12-18 23:13:04,516 INFO L226 Difference]: Without dead ends: 25017 [2019-12-18 23:13:04,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19300 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6631, Invalid=38951, Unknown=0, NotChecked=0, Total=45582 [2019-12-18 23:13:04,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25017 states. [2019-12-18 23:13:04,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25017 to 2591. [2019-12-18 23:13:04,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2591 states. [2019-12-18 23:13:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 10029 transitions. [2019-12-18 23:13:04,763 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 10029 transitions. Word has length 21 [2019-12-18 23:13:04,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:04,764 INFO L462 AbstractCegarLoop]: Abstraction has 2591 states and 10029 transitions. [2019-12-18 23:13:04,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 23:13:04,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 10029 transitions. [2019-12-18 23:13:04,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:13:04,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:04,765 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:04,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:04,966 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 23:13:04,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:04,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1335167582, now seen corresponding path program 15 times [2019-12-18 23:13:04,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:04,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082745554] [2019-12-18 23:13:04,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:13:05,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082745554] [2019-12-18 23:13:05,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742875907] [2019-12-18 23:13:05,045 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:05,123 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 23:13:05,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:13:05,124 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:13:05,125 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:05,273 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 23:13:05,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:05,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-12-18 23:13:05,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956761192] [2019-12-18 23:13:05,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 23:13:05,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:05,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 23:13:05,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:13:05,275 INFO L87 Difference]: Start difference. First operand 2591 states and 10029 transitions. Second operand 22 states. [2019-12-18 23:13:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:08,529 INFO L93 Difference]: Finished difference Result 15764 states and 49257 transitions. [2019-12-18 23:13:08,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-12-18 23:13:08,529 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-18 23:13:08,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:08,554 INFO L225 Difference]: With dead ends: 15764 [2019-12-18 23:13:08,554 INFO L226 Difference]: Without dead ends: 15750 [2019-12-18 23:13:08,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3812 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2030, Invalid=8890, Unknown=0, NotChecked=0, Total=10920 [2019-12-18 23:13:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15750 states. [2019-12-18 23:13:08,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15750 to 2564. [2019-12-18 23:13:08,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2564 states. [2019-12-18 23:13:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 9915 transitions. [2019-12-18 23:13:08,666 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 9915 transitions. Word has length 21 [2019-12-18 23:13:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:08,666 INFO L462 AbstractCegarLoop]: Abstraction has 2564 states and 9915 transitions. [2019-12-18 23:13:08,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 23:13:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 9915 transitions. [2019-12-18 23:13:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:13:08,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:08,668 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:08,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:08,869 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 23:13:08,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:08,869 INFO L82 PathProgramCache]: Analyzing trace with hash -489489332, now seen corresponding path program 16 times [2019-12-18 23:13:08,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:08,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858174509] [2019-12-18 23:13:08,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:08,948 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 23:13:08,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858174509] [2019-12-18 23:13:08,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243099055] [2019-12-18 23:13:08,949 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:09,009 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:13:09,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:13:09,010 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:13:09,010 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:09,209 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 23:13:09,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:09,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-12-18 23:13:09,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338950294] [2019-12-18 23:13:09,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 23:13:09,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:09,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 23:13:09,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:13:09,211 INFO L87 Difference]: Start difference. First operand 2564 states and 9915 transitions. Second operand 22 states. [2019-12-18 23:13:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:14,490 INFO L93 Difference]: Finished difference Result 18709 states and 56894 transitions. [2019-12-18 23:13:14,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-12-18 23:13:14,490 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-18 23:13:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:14,518 INFO L225 Difference]: With dead ends: 18709 [2019-12-18 23:13:14,519 INFO L226 Difference]: Without dead ends: 18699 [2019-12-18 23:13:14,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9894 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3933, Invalid=21507, Unknown=0, NotChecked=0, Total=25440 [2019-12-18 23:13:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18699 states. [2019-12-18 23:13:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18699 to 2557. [2019-12-18 23:13:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2557 states. [2019-12-18 23:13:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 9874 transitions. [2019-12-18 23:13:14,638 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 9874 transitions. Word has length 21 [2019-12-18 23:13:14,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:14,639 INFO L462 AbstractCegarLoop]: Abstraction has 2557 states and 9874 transitions. [2019-12-18 23:13:14,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 23:13:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 9874 transitions. [2019-12-18 23:13:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:13:14,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:14,640 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:14,842 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:14,843 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 23:13:14,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:14,843 INFO L82 PathProgramCache]: Analyzing trace with hash 653591338, now seen corresponding path program 17 times [2019-12-18 23:13:14,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:14,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856902546] [2019-12-18 23:13:14,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:14,948 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 23:13:14,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856902546] [2019-12-18 23:13:14,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336853549] [2019-12-18 23:13:14,949 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:15,021 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 23:13:15,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:13:15,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:13:15,023 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:15,155 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 23:13:15,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:15,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-12-18 23:13:15,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168627779] [2019-12-18 23:13:15,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 23:13:15,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:15,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 23:13:15,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:13:15,157 INFO L87 Difference]: Start difference. First operand 2557 states and 9874 transitions. Second operand 22 states. [2019-12-18 23:13:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:23,085 INFO L93 Difference]: Finished difference Result 24409 states and 71770 transitions. [2019-12-18 23:13:23,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2019-12-18 23:13:23,085 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-18 23:13:23,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:23,122 INFO L225 Difference]: With dead ends: 24409 [2019-12-18 23:13:23,123 INFO L226 Difference]: Without dead ends: 24405 [2019-12-18 23:13:23,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25819 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8386, Invalid=51884, Unknown=0, NotChecked=0, Total=60270 [2019-12-18 23:13:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24405 states. [2019-12-18 23:13:23,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24405 to 2552. [2019-12-18 23:13:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2552 states. [2019-12-18 23:13:23,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 9853 transitions. [2019-12-18 23:13:23,280 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 9853 transitions. Word has length 21 [2019-12-18 23:13:23,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:23,281 INFO L462 AbstractCegarLoop]: Abstraction has 2552 states and 9853 transitions. [2019-12-18 23:13:23,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 23:13:23,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 9853 transitions. [2019-12-18 23:13:23,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:13:23,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:23,282 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:23,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:23,483 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 23:13:23,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:23,483 INFO L82 PathProgramCache]: Analyzing trace with hash 811003178, now seen corresponding path program 18 times [2019-12-18 23:13:23,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:23,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273034914] [2019-12-18 23:13:23,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:13:23,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273034914] [2019-12-18 23:13:23,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325741736] [2019-12-18 23:13:23,559 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:23,673 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 23:13:23,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:13:23,674 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:13:23,674 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:23,809 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 23:13:23,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:23,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-12-18 23:13:23,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889232416] [2019-12-18 23:13:23,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 23:13:23,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:23,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 23:13:23,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:13:23,811 INFO L87 Difference]: Start difference. First operand 2552 states and 9853 transitions. Second operand 22 states. [2019-12-18 23:13:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:26,755 INFO L93 Difference]: Finished difference Result 13249 states and 40687 transitions. [2019-12-18 23:13:26,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-12-18 23:13:26,755 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-18 23:13:26,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:26,774 INFO L225 Difference]: With dead ends: 13249 [2019-12-18 23:13:26,774 INFO L226 Difference]: Without dead ends: 13237 [2019-12-18 23:13:26,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3753 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1983, Invalid=8937, Unknown=0, NotChecked=0, Total=10920 [2019-12-18 23:13:26,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13237 states. [2019-12-18 23:13:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13237 to 2476. [2019-12-18 23:13:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2019-12-18 23:13:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 9518 transitions. [2019-12-18 23:13:26,875 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 9518 transitions. Word has length 21 [2019-12-18 23:13:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:26,875 INFO L462 AbstractCegarLoop]: Abstraction has 2476 states and 9518 transitions. [2019-12-18 23:13:26,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 23:13:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 9518 transitions. [2019-12-18 23:13:26,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:13:26,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:26,877 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:27,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:27,080 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 23:13:27,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:27,081 INFO L82 PathProgramCache]: Analyzing trace with hash 255213166, now seen corresponding path program 19 times [2019-12-18 23:13:27,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:27,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421316281] [2019-12-18 23:13:27,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:27,157 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 23:13:27,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421316281] [2019-12-18 23:13:27,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629342328] [2019-12-18 23:13:27,157 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:27,221 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:13:27,221 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:27,366 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 23:13:27,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:27,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-12-18 23:13:27,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314670551] [2019-12-18 23:13:27,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 23:13:27,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:27,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 23:13:27,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:13:27,368 INFO L87 Difference]: Start difference. First operand 2476 states and 9518 transitions. Second operand 22 states. [2019-12-18 23:13:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:35,998 INFO L93 Difference]: Finished difference Result 21980 states and 64210 transitions. [2019-12-18 23:13:35,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-12-18 23:13:35,998 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-18 23:13:35,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:36,034 INFO L225 Difference]: With dead ends: 21980 [2019-12-18 23:13:36,034 INFO L226 Difference]: Without dead ends: 21973 [2019-12-18 23:13:36,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26357 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8437, Invalid=52819, Unknown=0, NotChecked=0, Total=61256 [2019-12-18 23:13:36,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21973 states. [2019-12-18 23:13:36,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21973 to 2451. [2019-12-18 23:13:36,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2451 states. [2019-12-18 23:13:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 9407 transitions. [2019-12-18 23:13:36,183 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 9407 transitions. Word has length 21 [2019-12-18 23:13:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:36,183 INFO L462 AbstractCegarLoop]: Abstraction has 2451 states and 9407 transitions. [2019-12-18 23:13:36,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 23:13:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 9407 transitions. [2019-12-18 23:13:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:13:36,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:36,185 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:36,387 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:36,387 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 23:13:36,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:36,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1555705676, now seen corresponding path program 20 times [2019-12-18 23:13:36,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:36,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777217202] [2019-12-18 23:13:36,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:36,474 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:13:36,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777217202] [2019-12-18 23:13:36,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42420] [2019-12-18 23:13:36,474 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:36,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:13:36,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:13:36,549 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:13:36,554 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:36,704 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 23:13:36,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:36,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-12-18 23:13:36,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478903325] [2019-12-18 23:13:36,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 23:13:36,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:36,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 23:13:36,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:13:36,706 INFO L87 Difference]: Start difference. First operand 2451 states and 9407 transitions. Second operand 22 states. [2019-12-18 23:13:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:41,863 INFO L93 Difference]: Finished difference Result 15225 states and 45297 transitions. [2019-12-18 23:13:41,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-12-18 23:13:41,863 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-18 23:13:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:41,887 INFO L225 Difference]: With dead ends: 15225 [2019-12-18 23:13:41,887 INFO L226 Difference]: Without dead ends: 15215 [2019-12-18 23:13:41,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9859 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3859, Invalid=20633, Unknown=0, NotChecked=0, Total=24492 [2019-12-18 23:13:41,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15215 states. [2019-12-18 23:13:41,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15215 to 2364. [2019-12-18 23:13:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2019-12-18 23:13:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 9050 transitions. [2019-12-18 23:13:41,994 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 9050 transitions. Word has length 21 [2019-12-18 23:13:41,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:41,995 INFO L462 AbstractCegarLoop]: Abstraction has 2364 states and 9050 transitions. [2019-12-18 23:13:41,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 23:13:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 9050 transitions. [2019-12-18 23:13:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:13:41,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:41,996 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:42,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:42,197 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 23:13:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:42,197 INFO L82 PathProgramCache]: Analyzing trace with hash 236779140, now seen corresponding path program 21 times [2019-12-18 23:13:42,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:42,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831707657] [2019-12-18 23:13:42,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:42,274 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 23:13:42,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831707657] [2019-12-18 23:13:42,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137297014] [2019-12-18 23:13:42,274 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:42,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 23:13:42,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:13:42,338 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:13:42,339 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:42,484 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 23:13:42,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:42,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 23:13:42,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417606703] [2019-12-18 23:13:42,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:13:42,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:42,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:13:42,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:13:42,486 INFO L87 Difference]: Start difference. First operand 2364 states and 9050 transitions. Second operand 23 states. [2019-12-18 23:13:52,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:52,478 INFO L93 Difference]: Finished difference Result 29909 states and 89563 transitions. [2019-12-18 23:13:52,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 273 states. [2019-12-18 23:13:52,478 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 23:13:52,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:52,534 INFO L225 Difference]: With dead ends: 29909 [2019-12-18 23:13:52,535 INFO L226 Difference]: Without dead ends: 29894 [2019-12-18 23:13:52,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36116 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=12969, Invalid=69687, Unknown=0, NotChecked=0, Total=82656 [2019-12-18 23:13:52,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29894 states. [2019-12-18 23:13:52,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29894 to 2416. [2019-12-18 23:13:52,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2416 states. [2019-12-18 23:13:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 9266 transitions. [2019-12-18 23:13:52,732 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 9266 transitions. Word has length 21 [2019-12-18 23:13:52,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:52,732 INFO L462 AbstractCegarLoop]: Abstraction has 2416 states and 9266 transitions. [2019-12-18 23:13:52,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:13:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 9266 transitions. [2019-12-18 23:13:52,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:13:52,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:52,733 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:52,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:52,934 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 23:13:52,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:52,935 INFO L82 PathProgramCache]: Analyzing trace with hash -337889250, now seen corresponding path program 22 times [2019-12-18 23:13:52,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:52,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389113143] [2019-12-18 23:13:52,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:53,007 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 23:13:53,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389113143] [2019-12-18 23:13:53,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150128600] [2019-12-18 23:13:53,007 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:53,072 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:13:53,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:13:53,074 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:13:53,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:53,206 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 23:13:53,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:53,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-12-18 23:13:53,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584364628] [2019-12-18 23:13:53,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 23:13:53,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:53,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 23:13:53,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:13:53,208 INFO L87 Difference]: Start difference. First operand 2416 states and 9266 transitions. Second operand 22 states. [2019-12-18 23:13:59,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:59,943 INFO L93 Difference]: Finished difference Result 15327 states and 44244 transitions. [2019-12-18 23:13:59,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2019-12-18 23:13:59,943 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-18 23:13:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:59,966 INFO L225 Difference]: With dead ends: 15327 [2019-12-18 23:13:59,966 INFO L226 Difference]: Without dead ends: 15318 [2019-12-18 23:13:59,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17582 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6255, Invalid=35565, Unknown=0, NotChecked=0, Total=41820 [2019-12-18 23:13:59,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15318 states. [2019-12-18 23:14:00,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15318 to 2405. [2019-12-18 23:14:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2019-12-18 23:14:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 9220 transitions. [2019-12-18 23:14:00,088 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 9220 transitions. Word has length 21 [2019-12-18 23:14:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:00,088 INFO L462 AbstractCegarLoop]: Abstraction has 2405 states and 9220 transitions. [2019-12-18 23:14:00,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 23:14:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 9220 transitions. [2019-12-18 23:14:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:14:00,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:00,090 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:00,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:00,291 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 23:14:00,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:00,292 INFO L82 PathProgramCache]: Analyzing trace with hash 621224380, now seen corresponding path program 23 times [2019-12-18 23:14:00,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:00,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486731136] [2019-12-18 23:14:00,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:00,381 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 23:14:00,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486731136] [2019-12-18 23:14:00,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005388795] [2019-12-18 23:14:00,382 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:00,482 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 23:14:00,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:14:00,483 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:14:00,484 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:14:00,630 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 23:14:00,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:14:00,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 23:14:00,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118744264] [2019-12-18 23:14:00,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:14:00,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:00,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:14:00,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:14:00,632 INFO L87 Difference]: Start difference. First operand 2405 states and 9220 transitions. Second operand 23 states. [2019-12-18 23:14:03,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:03,980 INFO L93 Difference]: Finished difference Result 19145 states and 61331 transitions. [2019-12-18 23:14:03,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-12-18 23:14:03,980 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 23:14:03,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:04,012 INFO L225 Difference]: With dead ends: 19145 [2019-12-18 23:14:04,012 INFO L226 Difference]: Without dead ends: 19138 [2019-12-18 23:14:04,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3667 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2499, Invalid=9057, Unknown=0, NotChecked=0, Total=11556 [2019-12-18 23:14:04,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19138 states. [2019-12-18 23:14:04,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19138 to 2385. [2019-12-18 23:14:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2385 states. [2019-12-18 23:14:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 9130 transitions. [2019-12-18 23:14:04,142 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 9130 transitions. Word has length 21 [2019-12-18 23:14:04,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:04,143 INFO L462 AbstractCegarLoop]: Abstraction has 2385 states and 9130 transitions. [2019-12-18 23:14:04,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:14:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 9130 transitions. [2019-12-18 23:14:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:14:04,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:04,144 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:04,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:04,345 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 23:14:04,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:04,345 INFO L82 PathProgramCache]: Analyzing trace with hash 621819580, now seen corresponding path program 24 times [2019-12-18 23:14:04,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:04,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985481434] [2019-12-18 23:14:04,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:04,432 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 23:14:04,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985481434] [2019-12-18 23:14:04,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168187409] [2019-12-18 23:14:04,433 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:04,501 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 23:14:04,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:14:04,502 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:14:04,503 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:14:04,659 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 23:14:04,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:14:04,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 23:14:04,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007490971] [2019-12-18 23:14:04,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:14:04,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:04,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:14:04,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:14:04,660 INFO L87 Difference]: Start difference. First operand 2385 states and 9130 transitions. Second operand 23 states. [2019-12-18 23:14:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:08,109 INFO L93 Difference]: Finished difference Result 18414 states and 58545 transitions. [2019-12-18 23:14:08,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-12-18 23:14:08,109 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 23:14:08,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:08,142 INFO L225 Difference]: With dead ends: 18414 [2019-12-18 23:14:08,142 INFO L226 Difference]: Without dead ends: 18405 [2019-12-18 23:14:08,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3636 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2499, Invalid=9057, Unknown=0, NotChecked=0, Total=11556 [2019-12-18 23:14:08,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18405 states. [2019-12-18 23:14:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18405 to 2304. [2019-12-18 23:14:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2304 states. [2019-12-18 23:14:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 8776 transitions. [2019-12-18 23:14:08,276 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 8776 transitions. Word has length 21 [2019-12-18 23:14:08,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:08,276 INFO L462 AbstractCegarLoop]: Abstraction has 2304 states and 8776 transitions. [2019-12-18 23:14:08,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:14:08,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 8776 transitions. [2019-12-18 23:14:08,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:14:08,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:08,277 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:08,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:08,478 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 23:14:08,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:08,479 INFO L82 PathProgramCache]: Analyzing trace with hash -389879526, now seen corresponding path program 25 times [2019-12-18 23:14:08,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:08,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005372280] [2019-12-18 23:14:08,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:08,589 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 23:14:08,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005372280] [2019-12-18 23:14:08,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609610418] [2019-12-18 23:14:08,590 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:08,655 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:14:08,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:14:08,798 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 23:14:08,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:14:08,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 23:14:08,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448116151] [2019-12-18 23:14:08,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:14:08,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:08,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:14:08,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:14:08,800 INFO L87 Difference]: Start difference. First operand 2304 states and 8776 transitions. Second operand 23 states. [2019-12-18 23:14:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:14,926 INFO L93 Difference]: Finished difference Result 24227 states and 74313 transitions. [2019-12-18 23:14:14,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-12-18 23:14:14,926 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 23:14:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:14,966 INFO L225 Difference]: With dead ends: 24227 [2019-12-18 23:14:14,966 INFO L226 Difference]: Without dead ends: 24221 [2019-12-18 23:14:14,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11225 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5733, Invalid=24369, Unknown=0, NotChecked=0, Total=30102 [2019-12-18 23:14:14,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24221 states. [2019-12-18 23:14:15,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24221 to 2319. [2019-12-18 23:14:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2319 states. [2019-12-18 23:14:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 8842 transitions. [2019-12-18 23:14:15,123 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 8842 transitions. Word has length 21 [2019-12-18 23:14:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:15,123 INFO L462 AbstractCegarLoop]: Abstraction has 2319 states and 8842 transitions. [2019-12-18 23:14:15,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:14:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 8842 transitions. [2019-12-18 23:14:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:14:15,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:15,124 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:15,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:15,325 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 23:14:15,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:15,326 INFO L82 PathProgramCache]: Analyzing trace with hash -389284326, now seen corresponding path program 26 times [2019-12-18 23:14:15,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:15,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232761418] [2019-12-18 23:14:15,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:15,416 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 23:14:15,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232761418] [2019-12-18 23:14:15,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698250000] [2019-12-18 23:14:15,417 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:15,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:14:15,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:14:15,484 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:14:15,485 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:14:15,640 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 23:14:15,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:14:15,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 23:14:15,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183816081] [2019-12-18 23:14:15,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:14:15,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:15,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:14:15,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:14:15,642 INFO L87 Difference]: Start difference. First operand 2319 states and 8842 transitions. Second operand 23 states. [2019-12-18 23:14:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:21,818 INFO L93 Difference]: Finished difference Result 24168 states and 74091 transitions. [2019-12-18 23:14:21,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-12-18 23:14:21,818 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 23:14:21,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:21,859 INFO L225 Difference]: With dead ends: 24168 [2019-12-18 23:14:21,860 INFO L226 Difference]: Without dead ends: 24161 [2019-12-18 23:14:21,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11188 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5654, Invalid=24102, Unknown=0, NotChecked=0, Total=29756 [2019-12-18 23:14:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24161 states. [2019-12-18 23:14:22,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24161 to 2301. [2019-12-18 23:14:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2301 states. [2019-12-18 23:14:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 8765 transitions. [2019-12-18 23:14:22,084 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 8765 transitions. Word has length 21 [2019-12-18 23:14:22,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:22,084 INFO L462 AbstractCegarLoop]: Abstraction has 2301 states and 8765 transitions. [2019-12-18 23:14:22,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:14:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 8765 transitions. [2019-12-18 23:14:22,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:14:22,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:22,086 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:22,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:22,287 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 23:14:22,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:22,288 INFO L82 PathProgramCache]: Analyzing trace with hash 141601306, now seen corresponding path program 27 times [2019-12-18 23:14:22,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:22,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128071087] [2019-12-18 23:14:22,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:22,393 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 23:14:22,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128071087] [2019-12-18 23:14:22,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790940074] [2019-12-18 23:14:22,393 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:22,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 23:14:22,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:14:22,466 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:14:22,467 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:14:22,619 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 23:14:22,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:14:22,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 23:14:22,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189934804] [2019-12-18 23:14:22,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:14:22,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:22,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:14:22,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:14:22,621 INFO L87 Difference]: Start difference. First operand 2301 states and 8765 transitions. Second operand 23 states. [2019-12-18 23:14:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:31,421 INFO L93 Difference]: Finished difference Result 31005 states and 92674 transitions. [2019-12-18 23:14:31,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2019-12-18 23:14:31,421 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 23:14:31,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:31,470 INFO L225 Difference]: With dead ends: 31005 [2019-12-18 23:14:31,471 INFO L226 Difference]: Without dead ends: 30998 [2019-12-18 23:14:31,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24345 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10643, Invalid=48163, Unknown=0, NotChecked=0, Total=58806 [2019-12-18 23:14:31,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30998 states. [2019-12-18 23:14:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30998 to 2301. [2019-12-18 23:14:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2301 states. [2019-12-18 23:14:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 8765 transitions. [2019-12-18 23:14:31,667 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 8765 transitions. Word has length 21 [2019-12-18 23:14:31,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:31,667 INFO L462 AbstractCegarLoop]: Abstraction has 2301 states and 8765 transitions. [2019-12-18 23:14:31,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:14:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 8765 transitions. [2019-12-18 23:14:31,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:14:31,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:31,669 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:31,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:31,869 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 23:14:31,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:31,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1879284522, now seen corresponding path program 28 times [2019-12-18 23:14:31,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:31,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103823183] [2019-12-18 23:14:31,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:31,955 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 23:14:31,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103823183] [2019-12-18 23:14:31,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784582267] [2019-12-18 23:14:31,955 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:32,015 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:14:32,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:14:32,016 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:14:32,017 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:14:32,157 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 23:14:32,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:14:32,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 23:14:32,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211308341] [2019-12-18 23:14:32,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:14:32,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:32,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:14:32,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:14:32,159 INFO L87 Difference]: Start difference. First operand 2301 states and 8765 transitions. Second operand 23 states. [2019-12-18 23:14:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:37,950 INFO L93 Difference]: Finished difference Result 15584 states and 45651 transitions. [2019-12-18 23:14:37,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-12-18 23:14:37,950 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 23:14:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:37,975 INFO L225 Difference]: With dead ends: 15584 [2019-12-18 23:14:37,975 INFO L226 Difference]: Without dead ends: 15575 [2019-12-18 23:14:37,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14393 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4903, Invalid=29507, Unknown=0, NotChecked=0, Total=34410 [2019-12-18 23:14:37,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15575 states. [2019-12-18 23:14:38,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15575 to 2316. [2019-12-18 23:14:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2316 states. [2019-12-18 23:14:38,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 8831 transitions. [2019-12-18 23:14:38,140 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 8831 transitions. Word has length 21 [2019-12-18 23:14:38,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:38,140 INFO L462 AbstractCegarLoop]: Abstraction has 2316 states and 8831 transitions. [2019-12-18 23:14:38,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:14:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 8831 transitions. [2019-12-18 23:14:38,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:14:38,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:38,142 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:38,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:38,342 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 23:14:38,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:38,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1878689322, now seen corresponding path program 29 times [2019-12-18 23:14:38,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:38,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489215197] [2019-12-18 23:14:38,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:38,435 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 23:14:38,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489215197] [2019-12-18 23:14:38,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782281803] [2019-12-18 23:14:38,436 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:38,499 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 23:14:38,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:14:38,499 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:14:38,500 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:14:38,666 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 23:14:38,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:14:38,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 23:14:38,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706874932] [2019-12-18 23:14:38,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:14:38,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:38,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:14:38,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:14:38,668 INFO L87 Difference]: Start difference. First operand 2316 states and 8831 transitions. Second operand 23 states. [2019-12-18 23:14:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:43,657 INFO L93 Difference]: Finished difference Result 15456 states and 45981 transitions. [2019-12-18 23:14:43,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-12-18 23:14:43,657 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 23:14:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:43,736 INFO L225 Difference]: With dead ends: 15456 [2019-12-18 23:14:43,736 INFO L226 Difference]: Without dead ends: 15446 [2019-12-18 23:14:43,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10114 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3935, Invalid=21505, Unknown=0, NotChecked=0, Total=25440 [2019-12-18 23:14:43,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15446 states. [2019-12-18 23:14:43,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15446 to 2280. [2019-12-18 23:14:43,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2019-12-18 23:14:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 8678 transitions. [2019-12-18 23:14:43,828 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 8678 transitions. Word has length 21 [2019-12-18 23:14:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:43,829 INFO L462 AbstractCegarLoop]: Abstraction has 2280 states and 8678 transitions. [2019-12-18 23:14:43,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:14:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 8678 transitions. [2019-12-18 23:14:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:14:43,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:43,830 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:44,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:44,031 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 23:14:44,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:44,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1783527146, now seen corresponding path program 30 times [2019-12-18 23:14:44,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:44,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503382283] [2019-12-18 23:14:44,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:44,122 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 23:14:44,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503382283] [2019-12-18 23:14:44,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450141215] [2019-12-18 23:14:44,123 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:44,190 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 23:14:44,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:14:44,191 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:14:44,192 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:14:44,345 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 23:14:44,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:14:44,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 23:14:44,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197430076] [2019-12-18 23:14:44,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:14:44,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:44,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:14:44,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:14:44,348 INFO L87 Difference]: Start difference. First operand 2280 states and 8678 transitions. Second operand 23 states. [2019-12-18 23:14:52,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:52,711 INFO L93 Difference]: Finished difference Result 19995 states and 57676 transitions. [2019-12-18 23:14:52,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2019-12-18 23:14:52,711 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 23:14:52,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:52,742 INFO L225 Difference]: With dead ends: 19995 [2019-12-18 23:14:52,742 INFO L226 Difference]: Without dead ends: 19988 [2019-12-18 23:14:52,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25225 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8271, Invalid=51509, Unknown=0, NotChecked=0, Total=59780 [2019-12-18 23:14:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19988 states. [2019-12-18 23:14:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19988 to 2277. [2019-12-18 23:14:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2277 states. [2019-12-18 23:14:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 8668 transitions. [2019-12-18 23:14:52,874 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 8668 transitions. Word has length 21 [2019-12-18 23:14:52,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:52,875 INFO L462 AbstractCegarLoop]: Abstraction has 2277 states and 8668 transitions. [2019-12-18 23:14:52,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:14:52,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 8668 transitions. [2019-12-18 23:14:52,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:14:52,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:52,876 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:53,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:53,077 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 23:14:53,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:53,077 INFO L82 PathProgramCache]: Analyzing trace with hash -474063010, now seen corresponding path program 31 times [2019-12-18 23:14:53,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:53,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568880634] [2019-12-18 23:14:53,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:53,149 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 23:14:53,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568880634] [2019-12-18 23:14:53,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646957250] [2019-12-18 23:14:53,150 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:53,216 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:14:53,217 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:14:53,356 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 23:14:53,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:14:53,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-12-18 23:14:53,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51927859] [2019-12-18 23:14:53,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 23:14:53,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:53,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 23:14:53,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:14:53,359 INFO L87 Difference]: Start difference. First operand 2277 states and 8668 transitions. Second operand 22 states. [2019-12-18 23:14:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:57,582 INFO L93 Difference]: Finished difference Result 10581 states and 31119 transitions. [2019-12-18 23:14:57,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-12-18 23:14:57,582 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-18 23:14:57,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:57,597 INFO L225 Difference]: With dead ends: 10581 [2019-12-18 23:14:57,598 INFO L226 Difference]: Without dead ends: 10576 [2019-12-18 23:14:57,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6241 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2742, Invalid=14288, Unknown=0, NotChecked=0, Total=17030 [2019-12-18 23:14:57,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10576 states. [2019-12-18 23:14:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10576 to 2279. [2019-12-18 23:14:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2019-12-18 23:14:57,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 8674 transitions. [2019-12-18 23:14:57,677 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 8674 transitions. Word has length 21 [2019-12-18 23:14:57,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:57,678 INFO L462 AbstractCegarLoop]: Abstraction has 2279 states and 8674 transitions. [2019-12-18 23:14:57,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 23:14:57,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 8674 transitions. [2019-12-18 23:14:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:14:57,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:57,679 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:57,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:57,880 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 23:14:57,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:57,880 INFO L82 PathProgramCache]: Analyzing trace with hash 384811520, now seen corresponding path program 32 times [2019-12-18 23:14:57,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:57,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132571253] [2019-12-18 23:14:57,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:57,953 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 23:14:57,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132571253] [2019-12-18 23:14:57,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163677335] [2019-12-18 23:14:57,954 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:14:58,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:14:58,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:14:58,020 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:14:58,021 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:14:58,207 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 23:14:58,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:14:58,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-12-18 23:14:58,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30607777] [2019-12-18 23:14:58,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 23:14:58,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:58,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 23:14:58,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2019-12-18 23:14:58,211 INFO L87 Difference]: Start difference. First operand 2279 states and 8674 transitions. Second operand 22 states. [2019-12-18 23:15:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:15:02,859 INFO L93 Difference]: Finished difference Result 10600 states and 31244 transitions. [2019-12-18 23:15:02,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-12-18 23:15:02,859 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-18 23:15:02,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:15:02,874 INFO L225 Difference]: With dead ends: 10600 [2019-12-18 23:15:02,875 INFO L226 Difference]: Without dead ends: 10594 [2019-12-18 23:15:02,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6265 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2660, Invalid=13852, Unknown=0, NotChecked=0, Total=16512 [2019-12-18 23:15:02,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10594 states. [2019-12-18 23:15:02,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10594 to 2235. [2019-12-18 23:15:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2019-12-18 23:15:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 8524 transitions. [2019-12-18 23:15:02,953 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 8524 transitions. Word has length 21 [2019-12-18 23:15:02,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:15:02,953 INFO L462 AbstractCegarLoop]: Abstraction has 2235 states and 8524 transitions. [2019-12-18 23:15:02,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 23:15:02,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 8524 transitions. [2019-12-18 23:15:02,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:15:02,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:15:02,954 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:15:03,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:15:03,155 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 23:15:03,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:15:03,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1841771060, now seen corresponding path program 33 times [2019-12-18 23:15:03,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:15:03,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365975178] [2019-12-18 23:15:03,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:15:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:15:03,236 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 23:15:03,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365975178] [2019-12-18 23:15:03,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201885475] [2019-12-18 23:15:03,236 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:15:03,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 23:15:03,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:15:03,302 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 23:15:03,302 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:15:03,434 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 23:15:03,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:15:03,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 23:15:03,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124240554] [2019-12-18 23:15:03,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:15:03,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:15:03,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:15:03,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:15:03,436 INFO L87 Difference]: Start difference. First operand 2235 states and 8524 transitions. Second operand 23 states. Received shutdown request... [2019-12-18 23:15:06,300 WARN L209 SmtUtils]: Removed 6 from assertion stack [2019-12-18 23:15:06,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-12-18 23:15:06,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:15:06,501 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 23:15:06,506 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 23:15:06,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:15:06 BasicIcfg [2019-12-18 23:15:06,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:15:06,507 INFO L168 Benchmark]: Toolchain (without parser) took 253914.57 ms. Allocated memory was 146.3 MB in the beginning and 958.4 MB in the end (delta: 812.1 MB). Free memory was 101.6 MB in the beginning and 790.3 MB in the end (delta: -688.7 MB). Peak memory consumption was 123.5 MB. Max. memory is 7.1 GB. [2019-12-18 23:15:06,508 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 23:15:06,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.97 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 101.2 MB in the beginning and 165.3 MB in the end (delta: -64.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 23:15:06,508 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.16 ms. Allocated memory is still 205.0 MB. Free memory was 165.3 MB in the beginning and 162.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:15:06,509 INFO L168 Benchmark]: Boogie Preprocessor took 25.12 ms. Allocated memory is still 205.0 MB. Free memory was 162.7 MB in the beginning and 161.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-18 23:15:06,509 INFO L168 Benchmark]: RCFGBuilder took 395.16 ms. Allocated memory is still 205.0 MB. Free memory was 161.4 MB in the beginning and 142.0 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2019-12-18 23:15:06,509 INFO L168 Benchmark]: TraceAbstraction took 252722.97 ms. Allocated memory was 205.0 MB in the beginning and 958.4 MB in the end (delta: 753.4 MB). Free memory was 141.3 MB in the beginning and 790.3 MB in the end (delta: -649.0 MB). Peak memory consumption was 104.4 MB. Max. memory is 7.1 GB. [2019-12-18 23:15:06,511 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.20 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 717.97 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 101.2 MB in the beginning and 165.3 MB in the end (delta: -64.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.16 ms. Allocated memory is still 205.0 MB. Free memory was 165.3 MB in the beginning and 162.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.12 ms. Allocated memory is still 205.0 MB. Free memory was 162.7 MB in the beginning and 161.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 395.16 ms. Allocated memory is still 205.0 MB. Free memory was 161.4 MB in the beginning and 142.0 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252722.97 ms. Allocated memory was 205.0 MB in the beginning and 958.4 MB in the end (delta: 753.4 MB). Free memory was 141.3 MB in the beginning and 790.3 MB in the end (delta: -649.0 MB). Peak memory consumption was 104.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.7s, 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, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 524 CheckedPairsTotal, 47 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 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, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1223 CheckedPairsTotal, 61 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.9s, 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, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1840 CheckedPairsTotal, 80 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.9s, 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, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2220 CheckedPairsTotal, 97 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 (2235states) and FLOYD_HOARE automaton (currently 91 states, 23 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 15 for 20ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 1 error locations. Result: TIMEOUT, OverallTime: 242.3s, OverallIterations: 56, TraceHistogramMax: 4, AutomataDifference: 207.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2640 SDtfs, 31345 SDslu, 29997 SDs, 0 SdLazy, 81851 SolverSat, 6496 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 61.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6911 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 6392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431683 ImplicationChecksByTransitivity, 131.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2783occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.6s AutomataMinimizationTime, 55 MinimizatonAttempts, 632659 StatesRemovedByMinimization, 55 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 2085 NumberOfCodeBlocks, 2081 NumberOfCodeBlocksAsserted, 168 NumberOfCheckSat, 1978 ConstructedInterpolants, 0 QuantifiedInterpolants, 211316 SizeOfPredicates, 321 NumberOfNonLiveVariables, 5827 ConjunctsInSsa, 565 ConjunctsInUnsatCore, 107 InterpolantComputations, 5 PerfectInterpolantSequences, 147/772 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