/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:54:35,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:54:35,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:54:35,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:54:35,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:54:35,406 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:54:35,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:54:35,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:54:35,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:54:35,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:54:35,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:54:35,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:54:35,425 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:54:35,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:54:35,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:54:35,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:54:35,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:54:35,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:54:35,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:54:35,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:54:35,447 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:54:35,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:54:35,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:54:35,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:54:35,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:54:35,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:54:35,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:54:35,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:54:35,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:54:35,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:54:35,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:54:35,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:54:35,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:54:35,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:54:35,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:54:35,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:54:35,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:54:35,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:54:35,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:54:35,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:54:35,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:54:35,470 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:54:35,506 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:54:35,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:54:35,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:54:35,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:54:35,508 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:54:35,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:54:35,511 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:54:35,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:54:35,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:54:35,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:54:35,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:54:35,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:54:35,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:54:35,512 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:54:35,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:54:35,512 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:54:35,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:54:35,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:54:35,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:54:35,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:54:35,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:54:35,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:54:35,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:54:35,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:54:35,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:54:35,515 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:54:35,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:54:35,515 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:54:35,515 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:54:35,515 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:54:35,516 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:54:35,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:54:35,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:54:35,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:54:35,815 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:54:35,815 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:54:35,816 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fkp2013-1.i [2019-12-27 18:54:35,872 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25fbcaa2e/44c511fed2034d53ae200f397692107d/FLAGc1d87ecd3 [2019-12-27 18:54:36,376 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:54:36,377 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013-1.i [2019-12-27 18:54:36,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25fbcaa2e/44c511fed2034d53ae200f397692107d/FLAGc1d87ecd3 [2019-12-27 18:54:36,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25fbcaa2e/44c511fed2034d53ae200f397692107d [2019-12-27 18:54:36,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:54:36,705 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:54:36,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:54:36,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:54:36,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:54:36,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:54:36" (1/1) ... [2019-12-27 18:54:36,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d93e309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:36, skipping insertion in model container [2019-12-27 18:54:36,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:54:36" (1/1) ... [2019-12-27 18:54:36,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:54:36,767 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:54:37,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:54:37,287 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:54:37,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:54:37,416 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:54:37,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:37 WrapperNode [2019-12-27 18:54:37,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:54:37,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:54:37,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:54:37,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:54:37,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:37" (1/1) ... [2019-12-27 18:54:37,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:37" (1/1) ... [2019-12-27 18:54:37,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:54:37,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:54:37,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:54:37,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:54:37,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:37" (1/1) ... [2019-12-27 18:54:37,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:37" (1/1) ... [2019-12-27 18:54:37,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:37" (1/1) ... [2019-12-27 18:54:37,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:37" (1/1) ... [2019-12-27 18:54:37,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:37" (1/1) ... [2019-12-27 18:54:37,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:37" (1/1) ... [2019-12-27 18:54:37,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:37" (1/1) ... [2019-12-27 18:54:37,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:54:37,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:54:37,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:54:37,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:54:37,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:54:37,572 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-27 18:54:37,573 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-27 18:54:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 18:54:37,573 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 18:54:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:54:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:54:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:54:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:54:37,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:54:37,575 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:54:37,946 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:54:37,946 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-27 18:54:37,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:54:37 BoogieIcfgContainer [2019-12-27 18:54:37,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:54:37,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:54:37,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:54:37,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:54:37,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:54:36" (1/3) ... [2019-12-27 18:54:37,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2af58e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:54:37, skipping insertion in model container [2019-12-27 18:54:37,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:37" (2/3) ... [2019-12-27 18:54:37,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2af58e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:54:37, skipping insertion in model container [2019-12-27 18:54:37,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:54:37" (3/3) ... [2019-12-27 18:54:37,956 INFO L109 eAbstractionObserver]: Analyzing ICFG fkp2013-1.i [2019-12-27 18:54:37,966 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:54:37,967 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:54:37,973 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 18:54:37,974 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:54:37,999 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:37,999 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,000 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,001 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,002 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,002 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,002 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,003 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,003 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,004 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,004 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,005 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,005 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,005 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,005 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,006 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,006 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,006 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,006 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,012 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,013 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,013 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,013 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,014 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,023 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,024 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,024 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,024 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,025 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,025 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:38,042 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 18:54:38,064 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:54:38,064 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:54:38,064 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:54:38,064 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:54:38,064 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:54:38,064 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:54:38,065 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:54:38,065 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:54:38,079 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions [2019-12-27 18:54:38,081 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-27 18:54:38,136 INFO L132 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-27 18:54:38,136 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:54:38,142 INFO L76 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs. 0/55 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-27 18:54:38,145 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-27 18:54:38,165 INFO L132 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-27 18:54:38,165 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:54:38,167 INFO L76 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs. 0/55 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-27 18:54:38,169 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 692 [2019-12-27 18:54:38,170 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:54:39,362 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-27 18:54:39,521 INFO L206 etLargeBlockEncoding]: Checked pairs total: 524 [2019-12-27 18:54:39,521 INFO L214 etLargeBlockEncoding]: Total number of compositions: 42 [2019-12-27 18:54:39,524 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-27 18:54:39,533 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-27 18:54:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-27 18:54:39,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:54:39,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:39,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:54:39,541 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 18:54:39,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:39,546 INFO L82 PathProgramCache]: Analyzing trace with hash 203253, now seen corresponding path program 1 times [2019-12-27 18:54:39,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:39,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199807287] [2019-12-27 18:54:39,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:39,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199807287] [2019-12-27 18:54:39,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:39,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:54:39,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2070540453] [2019-12-27 18:54:39,735 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:39,741 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:39,755 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:54:39,756 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:39,759 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:39,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:54:39,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:39,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:54:39,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:54:39,777 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-27 18:54:39,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:39,799 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-27 18:54:39,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:54:39,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:54:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:39,811 INFO L225 Difference]: With dead ends: 35 [2019-12-27 18:54:39,811 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 18:54:39,812 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-27 18:54:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 18:54:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-27 18:54:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-27 18:54:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-27 18:54:39,851 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-27 18:54:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:39,852 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-27 18:54:39,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:54:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-27 18:54:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 18:54:39,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:39,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:39,853 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 18:54:39,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1281245876, now seen corresponding path program 1 times [2019-12-27 18:54:39,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:39,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876404435] [2019-12-27 18:54:39,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:39,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:39,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876404435] [2019-12-27 18:54:39,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:39,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:54:39,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [322773789] [2019-12-27 18:54:39,936 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:39,938 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:39,943 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 18:54:39,943 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:39,944 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:39,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:54:39,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:39,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:54:39,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:54:39,947 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-27 18:54:39,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:39,972 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-27 18:54:39,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:54:39,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 18:54:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:39,975 INFO L225 Difference]: With dead ends: 26 [2019-12-27 18:54:39,975 INFO L226 Difference]: Without dead ends: 24 [2019-12-27 18:54:39,976 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-27 18:54:39,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-27 18:54:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-27 18:54:39,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 18:54:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-27 18:54:39,982 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-27 18:54:39,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:39,982 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-27 18:54:39,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:54:39,983 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-27 18:54:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 18:54:39,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:39,983 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:39,984 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 18:54:39,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:39,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1063926653, now seen corresponding path program 1 times [2019-12-27 18:54:39,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:39,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970473867] [2019-12-27 18:54:39,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:54:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:54:40,063 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:54:40,063 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:54:40,063 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 18:54:40,064 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 18:54:40,072 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,073 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,073 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,073 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,073 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,074 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,074 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,074 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,074 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,075 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,075 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,075 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,075 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,075 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,075 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,076 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,076 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,076 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,077 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,077 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,077 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,077 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,077 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,078 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,078 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,078 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,078 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,078 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,079 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,079 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,079 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,079 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,080 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,080 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,080 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,080 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,080 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,080 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,081 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,081 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,081 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,081 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,082 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,082 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,082 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,082 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,083 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,084 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,085 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,085 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,085 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,085 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,087 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,087 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,087 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,087 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,087 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,088 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,089 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,089 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,089 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,090 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,090 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,090 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,092 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 18:54:40,092 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:54:40,092 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:54:40,092 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:54:40,092 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:54:40,092 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:54:40,093 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:54:40,093 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:54:40,093 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:54:40,095 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions [2019-12-27 18:54:40,096 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 18:54:40,122 INFO L132 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-27 18:54:40,122 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 18:54:40,124 INFO L76 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs. 0/75 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2019-12-27 18:54:40,131 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 18:54:40,161 INFO L132 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-27 18:54:40,167 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 18:54:40,169 INFO L76 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs. 0/75 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2019-12-27 18:54:40,174 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1108 [2019-12-27 18:54:40,174 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:54:41,267 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-27 18:54:41,637 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1164 [2019-12-27 18:54:41,638 INFO L214 etLargeBlockEncoding]: Total number of compositions: 55 [2019-12-27 18:54:41,638 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-27 18:54:41,649 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-27 18:54:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-27 18:54:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:54:41,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:41,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:54:41,650 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:54:41,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:41,651 INFO L82 PathProgramCache]: Analyzing trace with hash 348690, now seen corresponding path program 1 times [2019-12-27 18:54:41,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:41,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419463371] [2019-12-27 18:54:41,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:41,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419463371] [2019-12-27 18:54:41,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:41,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:54:41,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [901229076] [2019-12-27 18:54:41,681 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:41,681 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:41,682 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:54:41,682 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:41,683 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:41,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:54:41,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:41,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:54:41,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:54:41,684 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-27 18:54:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:41,709 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-27 18:54:41,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:54:41,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:54:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:41,714 INFO L225 Difference]: With dead ends: 185 [2019-12-27 18:54:41,715 INFO L226 Difference]: Without dead ends: 171 [2019-12-27 18:54:41,715 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-27 18:54:41,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-27 18:54:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-27 18:54:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-27 18:54:41,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-27 18:54:41,741 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-27 18:54:41,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:41,742 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-27 18:54:41,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:54:41,742 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-27 18:54:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 18:54:41,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:41,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:41,743 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:54:41,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:41,744 INFO L82 PathProgramCache]: Analyzing trace with hash -772734140, now seen corresponding path program 1 times [2019-12-27 18:54:41,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:41,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269552296] [2019-12-27 18:54:41,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:41,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269552296] [2019-12-27 18:54:41,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:41,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:54:41,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2046457777] [2019-12-27 18:54:41,816 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:41,818 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:41,821 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 18:54:41,821 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:41,822 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:41,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:54:41,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:41,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:54:41,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:54:41,825 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-27 18:54:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:41,934 INFO L93 Difference]: Finished difference Result 204 states and 460 transitions. [2019-12-27 18:54:41,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:54:41,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 18:54:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:41,943 INFO L225 Difference]: With dead ends: 204 [2019-12-27 18:54:41,943 INFO L226 Difference]: Without dead ends: 201 [2019-12-27 18:54:41,944 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-27 18:54:41,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-27 18:54:41,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2019-12-27 18:54:41,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 18:54:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-27 18:54:41,980 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-27 18:54:41,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:41,980 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-27 18:54:41,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:54:41,980 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-27 18:54:41,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:54:41,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:41,982 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:41,982 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:54:41,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:41,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1323473150, now seen corresponding path program 1 times [2019-12-27 18:54:41,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:41,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757351022] [2019-12-27 18:54:41,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:42,050 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-27 18:54:42,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757351022] [2019-12-27 18:54:42,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:42,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:54:42,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [54679069] [2019-12-27 18:54:42,051 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:42,052 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:42,054 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:54:42,054 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:42,055 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:42,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:54:42,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:42,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:54:42,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:54:42,056 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-27 18:54:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:42,116 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2019-12-27 18:54:42,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:54:42,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 18:54:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:42,118 INFO L225 Difference]: With dead ends: 189 [2019-12-27 18:54:42,119 INFO L226 Difference]: Without dead ends: 185 [2019-12-27 18:54:42,119 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-27 18:54:42,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-27 18:54:42,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2019-12-27 18:54:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-27 18:54:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-27 18:54:42,131 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-27 18:54:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:42,133 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-27 18:54:42,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:54:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-27 18:54:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:54:42,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:42,134 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:42,135 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:54:42,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:42,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1919381761, now seen corresponding path program 1 times [2019-12-27 18:54:42,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:42,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730274263] [2019-12-27 18:54:42,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:54:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:54:42,169 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:54:42,170 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:54:42,170 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 18:54:42,170 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 18:54:42,179 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,180 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,180 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,180 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,180 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,180 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,181 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,181 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,181 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,181 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,181 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,181 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,182 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,182 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,182 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,182 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,182 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,182 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,183 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,183 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,183 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,183 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,183 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,183 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,183 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,184 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,184 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,184 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,185 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,185 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,185 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,185 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,185 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,185 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,186 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,186 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,186 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,186 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,186 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,187 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,187 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,187 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,187 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,187 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,188 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,188 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,188 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,188 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,188 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,189 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,189 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,189 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,189 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,189 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,190 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,190 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,190 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,190 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,190 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,191 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,191 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,191 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,191 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,191 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,192 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,192 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,192 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,192 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,193 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,194 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,194 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,194 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,194 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,195 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,196 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,196 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,196 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,196 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,197 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,197 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,198 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,198 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,198 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,198 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,199 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,200 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,200 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,200 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,200 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,200 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,201 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,202 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,202 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,202 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,202 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,202 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,203 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:54:42,204 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:54:42,204 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:54:42,204 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:54:42,204 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:54:42,204 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:54:42,205 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:54:42,205 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:54:42,205 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:54:42,207 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 87 transitions [2019-12-27 18:54:42,207 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-27 18:54:42,227 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 18:54:42,227 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 18:54:42,229 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-27 18:54:42,233 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-27 18:54:42,260 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 18:54:42,261 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 18:54:42,265 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-27 18:54:42,270 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1608 [2019-12-27 18:54:42,270 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:54:43,801 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-27 18:54:43,903 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1613 [2019-12-27 18:54:43,903 INFO L214 etLargeBlockEncoding]: Total number of compositions: 72 [2019-12-27 18:54:43,904 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-27 18:54:43,927 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-27 18:54:43,927 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-27 18:54:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:54:43,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:43,928 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:54:43,928 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-27 18:54:43,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:43,929 INFO L82 PathProgramCache]: Analyzing trace with hash 527830, now seen corresponding path program 1 times [2019-12-27 18:54:43,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:43,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009571536] [2019-12-27 18:54:43,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:43,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009571536] [2019-12-27 18:54:43,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:43,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:54:43,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1039979473] [2019-12-27 18:54:43,951 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:43,951 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:43,951 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:54:43,951 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:43,952 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:43,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:54:43,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:43,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:54:43,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:54:43,953 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-27 18:54:43,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:43,978 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-27 18:54:43,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:54:43,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:54:43,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:43,985 INFO L225 Difference]: With dead ends: 600 [2019-12-27 18:54:43,985 INFO L226 Difference]: Without dead ends: 559 [2019-12-27 18:54:43,986 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-27 18:54:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-27 18:54:44,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-27 18:54:44,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-27 18:54:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-27 18:54:44,042 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-27 18:54:44,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:44,042 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-27 18:54:44,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:54:44,043 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-27 18:54:44,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 18:54:44,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:44,043 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:44,044 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-27 18:54:44,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:44,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1521627850, now seen corresponding path program 1 times [2019-12-27 18:54:44,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:44,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954629433] [2019-12-27 18:54:44,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:44,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954629433] [2019-12-27 18:54:44,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:44,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:54:44,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [615168479] [2019-12-27 18:54:44,081 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:44,082 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:44,083 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 18:54:44,083 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:44,083 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:44,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:54:44,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:44,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:54:44,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:54:44,084 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-27 18:54:44,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:44,194 INFO L93 Difference]: Finished difference Result 802 states and 2304 transitions. [2019-12-27 18:54:44,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:54:44,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 18:54:44,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:44,201 INFO L225 Difference]: With dead ends: 802 [2019-12-27 18:54:44,201 INFO L226 Difference]: Without dead ends: 799 [2019-12-27 18:54:44,201 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-27 18:54:44,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-27 18:54:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 576. [2019-12-27 18:54:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 18:54:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-27 18:54:44,230 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-27 18:54:44,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:44,231 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-27 18:54:44,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:54:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-27 18:54:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:54:44,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:44,238 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:44,238 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-27 18:54:44,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:44,238 INFO L82 PathProgramCache]: Analyzing trace with hash -311693869, now seen corresponding path program 1 times [2019-12-27 18:54:44,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:44,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367002879] [2019-12-27 18:54:44,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:44,309 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-27 18:54:44,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367002879] [2019-12-27 18:54:44,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:44,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:54:44,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2098219430] [2019-12-27 18:54:44,310 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:44,311 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:44,313 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:54:44,313 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:44,313 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:44,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:54:44,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:44,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:54:44,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:54:44,314 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-27 18:54:44,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:44,405 INFO L93 Difference]: Finished difference Result 832 states and 2399 transitions. [2019-12-27 18:54:44,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:54:44,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 18:54:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:44,414 INFO L225 Difference]: With dead ends: 832 [2019-12-27 18:54:44,414 INFO L226 Difference]: Without dead ends: 828 [2019-12-27 18:54:44,415 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-27 18:54:44,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-27 18:54:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 605. [2019-12-27 18:54:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 18:54:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-27 18:54:44,442 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-27 18:54:44,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:44,443 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-27 18:54:44,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:54:44,443 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-27 18:54:44,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 18:54:44,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:44,445 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:44,445 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-27 18:54:44,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:44,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1756107436, now seen corresponding path program 1 times [2019-12-27 18:54:44,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:44,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67611567] [2019-12-27 18:54:44,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:44,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67611567] [2019-12-27 18:54:44,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125883666] [2019-12-27 18:54:44,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:44,619 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 18:54:44,621 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:54:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:44,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:54:44,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 18:54:44,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1032420892] [2019-12-27 18:54:44,656 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:44,657 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:44,660 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 18:54:44,661 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:44,662 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:44,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:54:44,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:44,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:54:44,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:54:44,664 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 7 states. [2019-12-27 18:54:44,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:44,878 INFO L93 Difference]: Finished difference Result 1052 states and 2813 transitions. [2019-12-27 18:54:44,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:54:44,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 18:54:44,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:44,886 INFO L225 Difference]: With dead ends: 1052 [2019-12-27 18:54:44,886 INFO L226 Difference]: Without dead ends: 1048 [2019-12-27 18:54:44,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:54:44,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-27 18:54:44,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 587. [2019-12-27 18:54:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-27 18:54:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1837 transitions. [2019-12-27 18:54:44,915 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1837 transitions. Word has length 15 [2019-12-27 18:54:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:44,915 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1837 transitions. [2019-12-27 18:54:44,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:54:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1837 transitions. [2019-12-27 18:54:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 18:54:44,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:44,917 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:45,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:45,121 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-27 18:54:45,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:45,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1109903596, now seen corresponding path program 2 times [2019-12-27 18:54:45,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:45,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390048395] [2019-12-27 18:54:45,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:45,200 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-27 18:54:45,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390048395] [2019-12-27 18:54:45,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:45,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:54:45,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [510571050] [2019-12-27 18:54:45,202 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:45,203 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:45,206 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 18:54:45,207 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:45,207 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:45,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:54:45,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:45,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:54:45,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:54:45,226 INFO L87 Difference]: Start difference. First operand 587 states and 1837 transitions. Second operand 7 states. [2019-12-27 18:54:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:45,400 INFO L93 Difference]: Finished difference Result 1050 states and 2805 transitions. [2019-12-27 18:54:45,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:54:45,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 18:54:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:45,408 INFO L225 Difference]: With dead ends: 1050 [2019-12-27 18:54:45,408 INFO L226 Difference]: Without dead ends: 1045 [2019-12-27 18:54:45,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:54:45,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-27 18:54:45,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2019-12-27 18:54:45,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 18:54:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2019-12-27 18:54:45,433 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2019-12-27 18:54:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:45,433 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2019-12-27 18:54:45,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:54:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2019-12-27 18:54:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 18:54:45,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:45,434 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:45,435 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-27 18:54:45,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:45,435 INFO L82 PathProgramCache]: Analyzing trace with hash -436948988, now seen corresponding path program 1 times [2019-12-27 18:54:45,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:45,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581634738] [2019-12-27 18:54:45,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:45,476 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-27 18:54:45,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581634738] [2019-12-27 18:54:45,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:45,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:54:45,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1782516177] [2019-12-27 18:54:45,478 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:45,480 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:45,482 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 18:54:45,482 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:45,482 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:45,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:54:45,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:45,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:54:45,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:54:45,484 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2019-12-27 18:54:45,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:45,549 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2019-12-27 18:54:45,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:54:45,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 18:54:45,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:45,555 INFO L225 Difference]: With dead ends: 736 [2019-12-27 18:54:45,556 INFO L226 Difference]: Without dead ends: 728 [2019-12-27 18:54:45,556 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-27 18:54:45,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-27 18:54:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2019-12-27 18:54:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-27 18:54:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2019-12-27 18:54:45,576 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2019-12-27 18:54:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:45,576 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2019-12-27 18:54:45,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:54:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2019-12-27 18:54:45,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 18:54:45,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:45,578 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:45,578 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-27 18:54:45,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:45,578 INFO L82 PathProgramCache]: Analyzing trace with hash -663795530, now seen corresponding path program 1 times [2019-12-27 18:54:45,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:45,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855672826] [2019-12-27 18:54:45,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:54:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:54:45,608 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:54:45,608 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:54:45,609 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 18:54:45,609 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 18:54:45,621 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,621 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,621 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,621 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,621 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,622 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,622 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,622 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,622 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,622 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,623 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,623 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,623 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,623 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,623 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,623 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,624 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,624 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,624 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,624 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,625 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,625 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,625 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,626 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,626 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,627 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,627 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,627 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,627 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,627 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,628 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,628 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,628 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,628 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,628 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,628 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,629 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,629 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,629 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,629 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,629 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,629 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,629 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,630 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,630 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,630 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,631 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,631 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,631 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,631 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,631 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,631 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,632 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,632 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,632 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,633 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,633 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,633 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,634 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,634 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,634 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,634 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,634 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,634 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,635 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,635 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,635 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,635 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,635 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,638 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,638 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,639 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,639 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,639 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,641 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,641 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,642 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,642 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,642 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,643 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,644 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,644 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,644 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,644 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,645 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,646 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,646 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,646 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,646 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,646 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,648 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,649 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,649 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,649 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,649 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,649 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,651 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,651 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,651 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,651 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,651 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,651 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,653 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,653 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,653 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,653 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,654 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,654 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,656 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 18:54:45,656 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:54:45,656 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:54:45,656 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:54:45,656 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:54:45,656 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:54:45,656 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:54:45,656 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:54:45,656 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:54:45,658 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 105 transitions [2019-12-27 18:54:45,658 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-27 18:54:45,681 INFO L132 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-27 18:54:45,681 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 18:54:45,683 INFO L76 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 212 event pairs. 0/115 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2019-12-27 18:54:45,688 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-27 18:54:45,706 INFO L132 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-27 18:54:45,706 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 18:54:45,708 INFO L76 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 212 event pairs. 0/115 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2019-12-27 18:54:45,713 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2192 [2019-12-27 18:54:45,713 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:54:47,258 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-27 18:54:47,692 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2358 [2019-12-27 18:54:47,693 INFO L214 etLargeBlockEncoding]: Total number of compositions: 87 [2019-12-27 18:54:47,693 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-27 18:54:47,796 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-27 18:54:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-27 18:54:47,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:54:47,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:47,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:54:47,798 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-27 18:54:47,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:47,798 INFO L82 PathProgramCache]: Analyzing trace with hash 738879, now seen corresponding path program 1 times [2019-12-27 18:54:47,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:47,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158224927] [2019-12-27 18:54:47,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:47,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158224927] [2019-12-27 18:54:47,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:47,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:54:47,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [442010173] [2019-12-27 18:54:47,819 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:47,819 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:47,819 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:54:47,820 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:47,820 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:47,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:54:47,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:47,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:54:47,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:54:47,824 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-27 18:54:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:47,860 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-27 18:54:47,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:54:47,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:54:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:47,877 INFO L225 Difference]: With dead ends: 1889 [2019-12-27 18:54:47,877 INFO L226 Difference]: Without dead ends: 1767 [2019-12-27 18:54:47,878 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-27 18:54:47,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-27 18:54:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-27 18:54:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-27 18:54:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-27 18:54:47,944 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-27 18:54:47,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:47,944 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-27 18:54:47,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:54:47,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-27 18:54:47,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 18:54:47,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:47,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:47,945 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-27 18:54:47,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:47,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1226090643, now seen corresponding path program 1 times [2019-12-27 18:54:47,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:47,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792780614] [2019-12-27 18:54:47,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:47,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792780614] [2019-12-27 18:54:47,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:47,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:54:47,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1871942788] [2019-12-27 18:54:47,986 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:47,986 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:47,987 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 18:54:47,987 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:47,988 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:47,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:54:47,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:47,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:54:47,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:54:47,989 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-27 18:54:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:48,066 INFO L93 Difference]: Finished difference Result 2826 states and 10014 transitions. [2019-12-27 18:54:48,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:54:48,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 18:54:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:48,089 INFO L225 Difference]: With dead ends: 2826 [2019-12-27 18:54:48,090 INFO L226 Difference]: Without dead ends: 2823 [2019-12-27 18:54:48,090 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-27 18:54:48,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-27 18:54:48,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1914. [2019-12-27 18:54:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-27 18:54:48,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-27 18:54:48,175 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-27 18:54:48,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:48,175 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-27 18:54:48,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:54:48,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-27 18:54:48,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:54:48,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:48,176 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:48,177 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-27 18:54:48,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:48,177 INFO L82 PathProgramCache]: Analyzing trace with hash 236764173, now seen corresponding path program 1 times [2019-12-27 18:54:48,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:48,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846014372] [2019-12-27 18:54:48,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:48,232 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-27 18:54:48,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846014372] [2019-12-27 18:54:48,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:48,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:54:48,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2108292993] [2019-12-27 18:54:48,233 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:48,234 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:48,235 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:54:48,236 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:48,236 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:48,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:54:48,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:48,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:54:48,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:54:48,237 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-27 18:54:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:48,323 INFO L93 Difference]: Finished difference Result 3124 states and 11194 transitions. [2019-12-27 18:54:48,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:54:48,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 18:54:48,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:48,357 INFO L225 Difference]: With dead ends: 3124 [2019-12-27 18:54:48,357 INFO L226 Difference]: Without dead ends: 3120 [2019-12-27 18:54:48,358 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-27 18:54:48,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-12-27 18:54:48,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2147. [2019-12-27 18:54:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-27 18:54:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-27 18:54:48,494 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-27 18:54:48,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:48,494 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-27 18:54:48,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:54:48,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-27 18:54:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 18:54:48,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:48,495 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:48,495 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-27 18:54:48,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:48,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2036551869, now seen corresponding path program 1 times [2019-12-27 18:54:48,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:48,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830582446] [2019-12-27 18:54:48,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:48,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:48,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830582446] [2019-12-27 18:54:48,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142874838] [2019-12-27 18:54:48,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:48,636 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 18:54:48,638 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:54:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:48,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:54:48,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 18:54:48,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [521378943] [2019-12-27 18:54:48,659 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:48,660 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:48,663 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 18:54:48,663 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:48,689 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:54:48,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:54:48,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:48,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:54:48,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:54:48,690 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 9 states. [2019-12-27 18:54:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:49,049 INFO L93 Difference]: Finished difference Result 4795 states and 15556 transitions. [2019-12-27 18:54:49,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:54:49,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 18:54:49,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:49,079 INFO L225 Difference]: With dead ends: 4795 [2019-12-27 18:54:49,079 INFO L226 Difference]: Without dead ends: 4790 [2019-12-27 18:54:49,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2019-12-27 18:54:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4790 states. [2019-12-27 18:54:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4790 to 2109. [2019-12-27 18:54:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-12-27 18:54:49,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 8197 transitions. [2019-12-27 18:54:49,188 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 8197 transitions. Word has length 15 [2019-12-27 18:54:49,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:49,189 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 8197 transitions. [2019-12-27 18:54:49,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:54:49,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 8197 transitions. [2019-12-27 18:54:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 18:54:49,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:49,190 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:49,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:49,395 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-27 18:54:49,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:49,396 INFO L82 PathProgramCache]: Analyzing trace with hash -102912933, now seen corresponding path program 2 times [2019-12-27 18:54:49,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:49,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810331305] [2019-12-27 18:54:49,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:49,456 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-27 18:54:49,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810331305] [2019-12-27 18:54:49,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:49,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:54:49,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2118143220] [2019-12-27 18:54:49,458 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:49,459 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:49,462 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 18:54:49,462 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:49,462 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:49,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:54:49,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:49,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:54:49,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:54:49,466 INFO L87 Difference]: Start difference. First operand 2109 states and 8197 transitions. Second operand 7 states. [2019-12-27 18:54:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:49,753 INFO L93 Difference]: Finished difference Result 4522 states and 14986 transitions. [2019-12-27 18:54:49,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:54:49,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 18:54:49,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:49,769 INFO L225 Difference]: With dead ends: 4522 [2019-12-27 18:54:49,770 INFO L226 Difference]: Without dead ends: 4517 [2019-12-27 18:54:49,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:54:49,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-27 18:54:49,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 1998. [2019-12-27 18:54:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 18:54:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-27 18:54:49,861 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-27 18:54:49,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:49,861 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-27 18:54:49,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:54:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-27 18:54:49,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 18:54:49,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:49,863 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:49,863 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-27 18:54:49,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:49,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2147198306, now seen corresponding path program 1 times [2019-12-27 18:54:49,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:49,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726988049] [2019-12-27 18:54:49,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:49,914 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-27 18:54:49,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726988049] [2019-12-27 18:54:49,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:49,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:54:49,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [335333660] [2019-12-27 18:54:49,916 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:49,917 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:49,920 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 18:54:49,921 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:49,922 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:49,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:54:49,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:49,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:54:49,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:54:49,923 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-27 18:54:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:50,003 INFO L93 Difference]: Finished difference Result 3208 states and 11604 transitions. [2019-12-27 18:54:50,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:54:50,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 18:54:50,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:50,016 INFO L225 Difference]: With dead ends: 3208 [2019-12-27 18:54:50,016 INFO L226 Difference]: Without dead ends: 3200 [2019-12-27 18:54:50,017 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-27 18:54:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-12-27 18:54:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2245. [2019-12-27 18:54:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-27 18:54:50,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-27 18:54:50,101 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-27 18:54:50,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:50,102 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-27 18:54:50,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:54:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-27 18:54:50,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:54:50,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:50,103 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:50,103 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-27 18:54:50,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:50,104 INFO L82 PathProgramCache]: Analyzing trace with hash 557011806, now seen corresponding path program 1 times [2019-12-27 18:54:50,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:50,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007799914] [2019-12-27 18:54:50,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:50,186 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-27 18:54:50,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007799914] [2019-12-27 18:54:50,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493741564] [2019-12-27 18:54:50,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:50,271 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 18:54:50,272 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:54:50,310 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-27 18:54:50,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:54:50,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 18:54:50,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1753685749] [2019-12-27 18:54:50,311 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:50,312 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:50,317 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 18:54:50,317 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:50,364 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:54:50,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:54:50,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:50,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:54:50,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:54:50,365 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 10 states. [2019-12-27 18:54:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:50,835 INFO L93 Difference]: Finished difference Result 5135 states and 16723 transitions. [2019-12-27 18:54:50,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:54:50,835 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-27 18:54:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:50,850 INFO L225 Difference]: With dead ends: 5135 [2019-12-27 18:54:50,850 INFO L226 Difference]: Without dead ends: 5126 [2019-12-27 18:54:50,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2019-12-27 18:54:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2019-12-27 18:54:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 2270. [2019-12-27 18:54:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-27 18:54:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 8766 transitions. [2019-12-27 18:54:50,947 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 8766 transitions. Word has length 19 [2019-12-27 18:54:50,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:50,948 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 8766 transitions. [2019-12-27 18:54:50,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:54:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 8766 transitions. [2019-12-27 18:54:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:54:50,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:50,949 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:51,152 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:51,153 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-27 18:54:51,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:51,154 INFO L82 PathProgramCache]: Analyzing trace with hash 864407617, now seen corresponding path program 1 times [2019-12-27 18:54:51,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:51,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932046101] [2019-12-27 18:54:51,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:54:51,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932046101] [2019-12-27 18:54:51,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212525726] [2019-12-27 18:54:51,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:51,268 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 18:54:51,269 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:54:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:54:51,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:54:51,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 18:54:51,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [99963511] [2019-12-27 18:54:51,285 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:51,286 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:51,289 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 18:54:51,289 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:51,312 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:54:51,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:54:51,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:51,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:54:51,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:54:51,314 INFO L87 Difference]: Start difference. First operand 2270 states and 8766 transitions. Second operand 9 states. [2019-12-27 18:54:51,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:51,721 INFO L93 Difference]: Finished difference Result 5272 states and 17168 transitions. [2019-12-27 18:54:51,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:54:51,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-27 18:54:51,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:51,733 INFO L225 Difference]: With dead ends: 5272 [2019-12-27 18:54:51,734 INFO L226 Difference]: Without dead ends: 5259 [2019-12-27 18:54:51,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2019-12-27 18:54:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2019-12-27 18:54:51,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 2267. [2019-12-27 18:54:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-27 18:54:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8739 transitions. [2019-12-27 18:54:51,825 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8739 transitions. Word has length 19 [2019-12-27 18:54:51,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:51,826 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8739 transitions. [2019-12-27 18:54:51,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:54:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8739 transitions. [2019-12-27 18:54:51,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:54:51,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:51,827 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:52,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:52,039 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-27 18:54:52,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:52,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1873265869, now seen corresponding path program 2 times [2019-12-27 18:54:52,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:52,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429870588] [2019-12-27 18:54:52,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:52,096 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-27 18:54:52,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429870588] [2019-12-27 18:54:52,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:52,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:54:52,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [81850064] [2019-12-27 18:54:52,097 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:52,099 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:52,105 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 18:54:52,105 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:52,105 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:52,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:54:52,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:52,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:54:52,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:54:52,106 INFO L87 Difference]: Start difference. First operand 2267 states and 8739 transitions. Second operand 7 states. [2019-12-27 18:54:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:52,362 INFO L93 Difference]: Finished difference Result 4884 states and 16339 transitions. [2019-12-27 18:54:52,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:54:52,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 18:54:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:52,372 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 18:54:52,373 INFO L226 Difference]: Without dead ends: 4875 [2019-12-27 18:54:52,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:54:52,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-27 18:54:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2192. [2019-12-27 18:54:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-27 18:54:52,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 8446 transitions. [2019-12-27 18:54:52,451 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 8446 transitions. Word has length 19 [2019-12-27 18:54:52,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:52,451 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 8446 transitions. [2019-12-27 18:54:52,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:54:52,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 8446 transitions. [2019-12-27 18:54:52,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:54:52,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:52,453 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:52,453 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-27 18:54:52,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:52,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1873286484, now seen corresponding path program 2 times [2019-12-27 18:54:52,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:52,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74981240] [2019-12-27 18:54:52,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:52,494 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-27 18:54:52,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74981240] [2019-12-27 18:54:52,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:52,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:54:52,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1764780529] [2019-12-27 18:54:52,495 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:52,496 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:52,499 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 18:54:52,499 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:52,499 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:52,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:54:52,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:52,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:54:52,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:54:52,502 INFO L87 Difference]: Start difference. First operand 2192 states and 8446 transitions. Second operand 7 states. [2019-12-27 18:54:52,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:52,719 INFO L93 Difference]: Finished difference Result 4737 states and 15791 transitions. [2019-12-27 18:54:52,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:54:52,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 18:54:52,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:52,727 INFO L225 Difference]: With dead ends: 4737 [2019-12-27 18:54:52,727 INFO L226 Difference]: Without dead ends: 4728 [2019-12-27 18:54:52,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:54:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-12-27 18:54:52,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 2133. [2019-12-27 18:54:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-27 18:54:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-27 18:54:52,800 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-27 18:54:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:52,800 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-27 18:54:52,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:54:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-27 18:54:52,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:54:52,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:52,802 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:52,803 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-27 18:54:52,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:52,803 INFO L82 PathProgramCache]: Analyzing trace with hash 356549993, now seen corresponding path program 1 times [2019-12-27 18:54:52,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:52,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799988802] [2019-12-27 18:54:52,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:52,863 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-27 18:54:52,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799988802] [2019-12-27 18:54:52,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731970663] [2019-12-27 18:54:52,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:52,943 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:54:52,944 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:54:52,973 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-27 18:54:52,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:54:52,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 18:54:52,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1867999053] [2019-12-27 18:54:52,974 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:52,976 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:52,983 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 18:54:52,983 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:53,098 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 18:54:53,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 18:54:53,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:53,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 18:54:53,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:54:53,099 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 16 states. [2019-12-27 18:54:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:54,831 INFO L93 Difference]: Finished difference Result 6643 states and 19902 transitions. [2019-12-27 18:54:54,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 18:54:54,832 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 18:54:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:54,843 INFO L225 Difference]: With dead ends: 6643 [2019-12-27 18:54:54,843 INFO L226 Difference]: Without dead ends: 6636 [2019-12-27 18:54:54,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1186, Invalid=3926, Unknown=0, NotChecked=0, Total=5112 [2019-12-27 18:54:54,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6636 states. [2019-12-27 18:54:54,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6636 to 2101. [2019-12-27 18:54:54,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-27 18:54:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8089 transitions. [2019-12-27 18:54:54,913 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 8089 transitions. Word has length 21 [2019-12-27 18:54:54,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:54,914 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 8089 transitions. [2019-12-27 18:54:54,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 18:54:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 8089 transitions. [2019-12-27 18:54:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:54:54,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:54,915 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:55,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:55,118 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-27 18:54:55,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:55,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1582562317, now seen corresponding path program 2 times [2019-12-27 18:54:55,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:55,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448395695] [2019-12-27 18:54:55,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:55,186 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-27 18:54:55,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448395695] [2019-12-27 18:54:55,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099665561] [2019-12-27 18:54:55,187 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:55,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:54:55,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:54:55,321 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:54:55,322 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:54:55,348 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-27 18:54:55,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:54:55,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 18:54:55,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2013709666] [2019-12-27 18:54:55,348 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:55,350 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:55,356 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 18:54:55,356 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:55,409 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:54:55,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:54:55,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:55,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:54:55,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:54:55,410 INFO L87 Difference]: Start difference. First operand 2101 states and 8089 transitions. Second operand 12 states. [2019-12-27 18:54:56,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:56,359 INFO L93 Difference]: Finished difference Result 6356 states and 19271 transitions. [2019-12-27 18:54:56,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 18:54:56,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-27 18:54:56,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:56,369 INFO L225 Difference]: With dead ends: 6356 [2019-12-27 18:54:56,369 INFO L226 Difference]: Without dead ends: 6347 [2019-12-27 18:54:56,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=631, Invalid=2021, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 18:54:56,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6347 states. [2019-12-27 18:54:56,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6347 to 2071. [2019-12-27 18:54:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-27 18:54:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7960 transitions. [2019-12-27 18:54:56,453 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7960 transitions. Word has length 21 [2019-12-27 18:54:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:56,453 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 7960 transitions. [2019-12-27 18:54:56,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:54:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7960 transitions. [2019-12-27 18:54:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:54:56,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:56,455 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:56,667 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:56,667 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-27 18:54:56,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:56,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1260159245, now seen corresponding path program 3 times [2019-12-27 18:54:56,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:56,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738530484] [2019-12-27 18:54:56,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:56,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:54:56,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738530484] [2019-12-27 18:54:56,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783173636] [2019-12-27 18:54:56,732 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:56,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 18:54:56,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:54:56,802 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:54:56,803 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:54:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:54:56,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:54:56,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 18:54:56,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1032546925] [2019-12-27 18:54:56,827 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:56,829 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:56,835 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 18:54:56,835 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:56,988 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:54:56,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 18:54:56,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:56,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 18:54:56,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:54:56,989 INFO L87 Difference]: Start difference. First operand 2071 states and 7960 transitions. Second operand 15 states. [2019-12-27 18:54:58,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:58,601 INFO L93 Difference]: Finished difference Result 6519 states and 19507 transitions. [2019-12-27 18:54:58,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 18:54:58,601 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-12-27 18:54:58,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:58,617 INFO L225 Difference]: With dead ends: 6519 [2019-12-27 18:54:58,617 INFO L226 Difference]: Without dead ends: 6512 [2019-12-27 18:54:58,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1529 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1146, Invalid=3824, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 18:54:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6512 states. [2019-12-27 18:54:58,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6512 to 1997. [2019-12-27 18:54:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-12-27 18:54:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 7687 transitions. [2019-12-27 18:54:58,710 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 7687 transitions. Word has length 21 [2019-12-27 18:54:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:58,710 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 7687 transitions. [2019-12-27 18:54:58,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 18:54:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 7687 transitions. [2019-12-27 18:54:58,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:54:58,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:58,712 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:58,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:58,917 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-27 18:54:58,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:58,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1767015311, now seen corresponding path program 4 times [2019-12-27 18:54:58,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:58,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526699312] [2019-12-27 18:54:58,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:54:59,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526699312] [2019-12-27 18:54:59,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144270527] [2019-12-27 18:54:59,024 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:59,203 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 18:54:59,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:54:59,204 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:54:59,209 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:54:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:54:59,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:54:59,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 18:54:59,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [445938316] [2019-12-27 18:54:59,239 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:59,241 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:59,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 18:54:59,248 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:59,289 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:54:59,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:54:59,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:59,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:54:59,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:54:59,290 INFO L87 Difference]: Start difference. First operand 1997 states and 7687 transitions. Second operand 11 states. [2019-12-27 18:55:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:00,200 INFO L93 Difference]: Finished difference Result 6273 states and 19028 transitions. [2019-12-27 18:55:00,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 18:55:00,207 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 18:55:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:00,220 INFO L225 Difference]: With dead ends: 6273 [2019-12-27 18:55:00,220 INFO L226 Difference]: Without dead ends: 6264 [2019-12-27 18:55:00,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=598, Invalid=1952, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 18:55:00,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6264 states. [2019-12-27 18:55:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6264 to 1967. [2019-12-27 18:55:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-27 18:55:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7558 transitions. [2019-12-27 18:55:00,301 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7558 transitions. Word has length 21 [2019-12-27 18:55:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:00,302 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7558 transitions. [2019-12-27 18:55:00,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:55:00,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7558 transitions. [2019-12-27 18:55:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:00,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:00,304 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:00,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:00,507 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-27 18:55:00,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:00,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1366430690, now seen corresponding path program 1 times [2019-12-27 18:55:00,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:00,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938469997] [2019-12-27 18:55:00,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:00,576 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-27 18:55:00,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938469997] [2019-12-27 18:55:00,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:00,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:55:00,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [415138044] [2019-12-27 18:55:00,577 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:00,579 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:00,585 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 18:55:00,585 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:00,585 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:00,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:55:00,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:00,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:55:00,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:55:00,586 INFO L87 Difference]: Start difference. First operand 1967 states and 7558 transitions. Second operand 5 states. [2019-12-27 18:55:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:00,674 INFO L93 Difference]: Finished difference Result 3010 states and 10835 transitions. [2019-12-27 18:55:00,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:55:00,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 18:55:00,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:00,682 INFO L225 Difference]: With dead ends: 3010 [2019-12-27 18:55:00,682 INFO L226 Difference]: Without dead ends: 2994 [2019-12-27 18:55:00,683 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-27 18:55:00,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-12-27 18:55:00,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2174. [2019-12-27 18:55:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-12-27 18:55:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 8201 transitions. [2019-12-27 18:55:00,740 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 8201 transitions. Word has length 21 [2019-12-27 18:55:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:00,740 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 8201 transitions. [2019-12-27 18:55:00,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:55:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 8201 transitions. [2019-12-27 18:55:00,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:00,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:00,742 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:00,742 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-27 18:55:00,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:00,743 INFO L82 PathProgramCache]: Analyzing trace with hash -617219583, now seen corresponding path program 5 times [2019-12-27 18:55:00,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:00,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321071247] [2019-12-27 18:55:00,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:00,805 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-27 18:55:00,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321071247] [2019-12-27 18:55:00,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:00,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:55:00,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1766688993] [2019-12-27 18:55:00,807 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:00,809 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:00,812 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 18:55:00,813 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:00,813 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:00,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:55:00,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:00,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:55:00,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:55:00,815 INFO L87 Difference]: Start difference. First operand 2174 states and 8201 transitions. Second operand 9 states. [2019-12-27 18:55:01,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:01,319 INFO L93 Difference]: Finished difference Result 6140 states and 19238 transitions. [2019-12-27 18:55:01,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:55:01,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 18:55:01,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:01,328 INFO L225 Difference]: With dead ends: 6140 [2019-12-27 18:55:01,328 INFO L226 Difference]: Without dead ends: 6133 [2019-12-27 18:55:01,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:55:01,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2019-12-27 18:55:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2090. [2019-12-27 18:55:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-12-27 18:55:01,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7871 transitions. [2019-12-27 18:55:01,383 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7871 transitions. Word has length 21 [2019-12-27 18:55:01,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:01,384 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 7871 transitions. [2019-12-27 18:55:01,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:55:01,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7871 transitions. [2019-12-27 18:55:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:01,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:01,385 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:01,386 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-27 18:55:01,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:01,386 INFO L82 PathProgramCache]: Analyzing trace with hash -637009983, now seen corresponding path program 6 times [2019-12-27 18:55:01,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:01,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524639350] [2019-12-27 18:55:01,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:01,444 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-27 18:55:01,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524639350] [2019-12-27 18:55:01,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:01,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:55:01,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1431145575] [2019-12-27 18:55:01,446 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:01,448 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:01,451 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 18:55:01,451 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:01,452 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:01,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:55:01,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:01,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:55:01,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:55:01,453 INFO L87 Difference]: Start difference. First operand 2090 states and 7871 transitions. Second operand 9 states. [2019-12-27 18:55:01,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:01,935 INFO L93 Difference]: Finished difference Result 6012 states and 18787 transitions. [2019-12-27 18:55:01,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:55:01,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 18:55:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:01,944 INFO L225 Difference]: With dead ends: 6012 [2019-12-27 18:55:01,944 INFO L226 Difference]: Without dead ends: 6002 [2019-12-27 18:55:01,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:55:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-27 18:55:02,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2019-12-27 18:55:02,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-27 18:55:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2019-12-27 18:55:02,023 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2019-12-27 18:55:02,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:02,024 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2019-12-27 18:55:02,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:55:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2019-12-27 18:55:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:55:02,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:02,026 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:02,026 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-27 18:55:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:02,026 INFO L82 PathProgramCache]: Analyzing trace with hash -594503999, now seen corresponding path program 1 times [2019-12-27 18:55:02,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:02,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937396434] [2019-12-27 18:55:02,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:55:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:55:02,050 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:55:02,051 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:55:02,051 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 18:55:02,052 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 18:55:02,067 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,067 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,067 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,067 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,068 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,068 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,068 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,068 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,068 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,068 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,069 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,069 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,069 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,069 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,069 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,069 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,069 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,070 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,070 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,070 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,070 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,070 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,070 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,070 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,071 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,071 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,071 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,071 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,071 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,071 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,071 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,071 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,072 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,072 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,072 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,072 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,072 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,072 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,072 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,073 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,073 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,073 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,073 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,073 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,073 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,074 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,074 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,074 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,074 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,074 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,074 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,074 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,075 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,075 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,075 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,075 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,075 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,075 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,075 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,076 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,076 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,076 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,076 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,076 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,076 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,076 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,077 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,077 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,077 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,077 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,078 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,078 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,078 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,078 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,078 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,078 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,078 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,079 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,079 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,079 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,079 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,080 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,080 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,080 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,080 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,080 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,080 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,080 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,080 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,081 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,081 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,081 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,081 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,082 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,082 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,082 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,082 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,082 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,082 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,083 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,083 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,083 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,083 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,083 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,083 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,084 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,084 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,084 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,084 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,084 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,086 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,086 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,086 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,086 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,086 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,088 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,088 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,088 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,088 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,088 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,089 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,090 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,090 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,090 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,090 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,091 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,091 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,092 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,092 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,092 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,093 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,093 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,093 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,094 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,094 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,094 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,095 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,095 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,095 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,096 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,096 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,096 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,097 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,097 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,097 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,097 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,098 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,098 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,099 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,099 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,099 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,099 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,100 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,100 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,101 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,101 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,101 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,102 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,102 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,102 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:02,103 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 18:55:02,103 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:55:02,103 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:55:02,104 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:55:02,104 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:55:02,104 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:55:02,104 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:55:02,104 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:55:02,104 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:55:02,106 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 123 transitions [2019-12-27 18:55:02,107 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-27 18:55:02,135 INFO L132 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-27 18:55:02,135 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 18:55:02,138 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2019-12-27 18:55:02,145 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-27 18:55:02,169 INFO L132 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-27 18:55:02,169 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 18:55:02,172 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2019-12-27 18:55:02,179 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2860 [2019-12-27 18:55:02,179 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:55:03,840 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-27 18:55:04,271 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3115 [2019-12-27 18:55:04,271 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 18:55:04,271 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-27 18:55:04,539 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-27 18:55:04,539 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-27 18:55:04,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:55:04,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:04,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:55:04,540 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:04,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:04,540 INFO L82 PathProgramCache]: Analyzing trace with hash 983675, now seen corresponding path program 1 times [2019-12-27 18:55:04,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:04,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187841957] [2019-12-27 18:55:04,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:04,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187841957] [2019-12-27 18:55:04,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:04,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:55:04,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [346743548] [2019-12-27 18:55:04,561 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:04,561 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:04,562 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:55:04,562 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:04,562 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:04,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:55:04,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:04,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:55:04,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:55:04,563 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-27 18:55:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:04,642 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-27 18:55:04,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:55:04,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:55:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:04,718 INFO L225 Difference]: With dead ends: 5844 [2019-12-27 18:55:04,718 INFO L226 Difference]: Without dead ends: 5479 [2019-12-27 18:55:04,719 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-27 18:55:04,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-27 18:55:04,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-27 18:55:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-27 18:55:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-27 18:55:04,818 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-27 18:55:04,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:04,818 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-27 18:55:04,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:55:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-27 18:55:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 18:55:04,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:04,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:04,819 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:04,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:04,820 INFO L82 PathProgramCache]: Analyzing trace with hash -768832426, now seen corresponding path program 1 times [2019-12-27 18:55:04,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:04,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978150781] [2019-12-27 18:55:04,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:04,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978150781] [2019-12-27 18:55:04,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:04,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:55:04,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1643370471] [2019-12-27 18:55:04,862 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:04,863 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:04,863 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 18:55:04,863 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:04,864 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:04,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:55:04,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:04,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:55:04,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:55:04,864 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-27 18:55:04,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:04,968 INFO L93 Difference]: Finished difference Result 9358 states and 39616 transitions. [2019-12-27 18:55:04,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:55:04,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 18:55:04,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:04,990 INFO L225 Difference]: With dead ends: 9358 [2019-12-27 18:55:04,990 INFO L226 Difference]: Without dead ends: 9355 [2019-12-27 18:55:04,991 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-27 18:55:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-12-27 18:55:05,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 6120. [2019-12-27 18:55:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-27 18:55:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-27 18:55:05,161 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-27 18:55:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:05,161 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-27 18:55:05,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:55:05,161 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-27 18:55:05,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:55:05,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:05,161 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:05,162 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:05,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:05,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1710988516, now seen corresponding path program 1 times [2019-12-27 18:55:05,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:05,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977091705] [2019-12-27 18:55:05,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:05,204 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-27 18:55:05,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977091705] [2019-12-27 18:55:05,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:05,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:55:05,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2028686883] [2019-12-27 18:55:05,205 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:05,206 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:05,207 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:55:05,207 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:05,207 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:05,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:55:05,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:05,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:55:05,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:55:05,209 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-27 18:55:05,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:05,357 INFO L93 Difference]: Finished difference Result 10720 states and 46025 transitions. [2019-12-27 18:55:05,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:55:05,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 18:55:05,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:05,392 INFO L225 Difference]: With dead ends: 10720 [2019-12-27 18:55:05,392 INFO L226 Difference]: Without dead ends: 10716 [2019-12-27 18:55:05,392 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-27 18:55:05,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10716 states. [2019-12-27 18:55:06,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10716 to 7145. [2019-12-27 18:55:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-27 18:55:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-27 18:55:06,212 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-27 18:55:06,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:06,213 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-27 18:55:06,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:55:06,213 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-27 18:55:06,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 18:55:06,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:06,214 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:06,216 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:06,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:06,217 INFO L82 PathProgramCache]: Analyzing trace with hash 173591493, now seen corresponding path program 1 times [2019-12-27 18:55:06,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:06,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758220791] [2019-12-27 18:55:06,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:06,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758220791] [2019-12-27 18:55:06,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219244272] [2019-12-27 18:55:06,261 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-27 18:55:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:06,330 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 18:55:06,330 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:06,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:06,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 18:55:06,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [4405818] [2019-12-27 18:55:06,347 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:06,348 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:06,352 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 18:55:06,352 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:06,375 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:55:06,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:55:06,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:06,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:55:06,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:55:06,376 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 9 states. [2019-12-27 18:55:06,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:06,887 INFO L93 Difference]: Finished difference Result 17481 states and 68797 transitions. [2019-12-27 18:55:06,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:55:06,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 18:55:06,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:06,957 INFO L225 Difference]: With dead ends: 17481 [2019-12-27 18:55:06,957 INFO L226 Difference]: Without dead ends: 17476 [2019-12-27 18:55:06,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2019-12-27 18:55:07,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17476 states. [2019-12-27 18:55:07,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17476 to 7067. [2019-12-27 18:55:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-27 18:55:07,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 32681 transitions. [2019-12-27 18:55:07,250 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 32681 transitions. Word has length 15 [2019-12-27 18:55:07,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:07,251 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 32681 transitions. [2019-12-27 18:55:07,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:55:07,251 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 32681 transitions. [2019-12-27 18:55:07,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 18:55:07,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:07,251 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:07,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:07,452 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:07,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:07,453 INFO L82 PathProgramCache]: Analyzing trace with hash 712521883, now seen corresponding path program 2 times [2019-12-27 18:55:07,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:07,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271326921] [2019-12-27 18:55:07,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:07,492 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-27 18:55:07,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271326921] [2019-12-27 18:55:07,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:07,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:55:07,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1608261535] [2019-12-27 18:55:07,493 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:07,494 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:07,495 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 18:55:07,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:07,496 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:07,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:55:07,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:07,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:55:07,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:55:07,497 INFO L87 Difference]: Start difference. First operand 7067 states and 32681 transitions. Second operand 7 states. [2019-12-27 18:55:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:07,890 INFO L93 Difference]: Finished difference Result 16584 states and 66357 transitions. [2019-12-27 18:55:07,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:55:07,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 18:55:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:07,929 INFO L225 Difference]: With dead ends: 16584 [2019-12-27 18:55:07,929 INFO L226 Difference]: Without dead ends: 16579 [2019-12-27 18:55:07,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:55:07,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2019-12-27 18:55:08,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 6836. [2019-12-27 18:55:08,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6836 states. [2019-12-27 18:55:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 31606 transitions. [2019-12-27 18:55:08,134 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 31606 transitions. Word has length 15 [2019-12-27 18:55:08,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:08,134 INFO L462 AbstractCegarLoop]: Abstraction has 6836 states and 31606 transitions. [2019-12-27 18:55:08,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:55:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 31606 transitions. [2019-12-27 18:55:08,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 18:55:08,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:08,135 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:08,135 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:08,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:08,135 INFO L82 PathProgramCache]: Analyzing trace with hash -137837239, now seen corresponding path program 1 times [2019-12-27 18:55:08,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:08,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725723538] [2019-12-27 18:55:08,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:08,192 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-27 18:55:08,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725723538] [2019-12-27 18:55:08,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:08,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:55:08,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [600263324] [2019-12-27 18:55:08,193 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:08,194 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:08,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 18:55:08,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:08,196 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:08,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:55:08,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:08,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:55:08,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:55:08,197 INFO L87 Difference]: Start difference. First operand 6836 states and 31606 transitions. Second operand 5 states. [2019-12-27 18:55:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:08,331 INFO L93 Difference]: Finished difference Result 11876 states and 51707 transitions. [2019-12-27 18:55:08,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:55:08,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 18:55:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:08,360 INFO L225 Difference]: With dead ends: 11876 [2019-12-27 18:55:08,361 INFO L226 Difference]: Without dead ends: 11868 [2019-12-27 18:55:08,361 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-27 18:55:08,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2019-12-27 18:55:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 8095. [2019-12-27 18:55:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-27 18:55:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 37697 transitions. [2019-12-27 18:55:08,545 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 37697 transitions. Word has length 17 [2019-12-27 18:55:08,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:08,545 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 37697 transitions. [2019-12-27 18:55:08,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:55:08,545 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 37697 transitions. [2019-12-27 18:55:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:55:08,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:08,546 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:08,546 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:08,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:08,547 INFO L82 PathProgramCache]: Analyzing trace with hash 411145966, now seen corresponding path program 1 times [2019-12-27 18:55:08,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:08,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314036968] [2019-12-27 18:55:08,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:55:08,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314036968] [2019-12-27 18:55:08,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892895881] [2019-12-27 18:55:08,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:08,678 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 18:55:08,679 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:08,804 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:55:08,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:08,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 18:55:08,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1106238736] [2019-12-27 18:55:08,805 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:08,806 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:08,810 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 18:55:08,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:08,851 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:55:08,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:55:08,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:08,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:55:08,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:55:08,852 INFO L87 Difference]: Start difference. First operand 8095 states and 37697 transitions. Second operand 10 states. [2019-12-27 18:55:09,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:09,618 INFO L93 Difference]: Finished difference Result 20047 states and 79810 transitions. [2019-12-27 18:55:09,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:55:09,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-27 18:55:09,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:09,696 INFO L225 Difference]: With dead ends: 20047 [2019-12-27 18:55:09,696 INFO L226 Difference]: Without dead ends: 20038 [2019-12-27 18:55:09,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2019-12-27 18:55:09,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20038 states. [2019-12-27 18:55:10,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20038 to 8204. [2019-12-27 18:55:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-12-27 18:55:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 38127 transitions. [2019-12-27 18:55:10,111 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 38127 transitions. Word has length 19 [2019-12-27 18:55:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:10,112 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 38127 transitions. [2019-12-27 18:55:10,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:55:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 38127 transitions. [2019-12-27 18:55:10,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:55:10,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:10,114 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:10,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:10,326 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:10,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:10,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1348912267, now seen corresponding path program 1 times [2019-12-27 18:55:10,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:10,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063917097] [2019-12-27 18:55:10,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:55:10,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063917097] [2019-12-27 18:55:10,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367544446] [2019-12-27 18:55:10,372 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-27 18:55:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:10,445 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 18:55:10,446 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:10,463 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:55:10,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:10,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 18:55:10,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [525265270] [2019-12-27 18:55:10,464 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:10,466 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:10,468 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 18:55:10,468 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:10,468 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:10,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:55:10,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:10,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:55:10,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:55:10,469 INFO L87 Difference]: Start difference. First operand 8204 states and 38127 transitions. Second operand 7 states. [2019-12-27 18:55:10,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:10,908 INFO L93 Difference]: Finished difference Result 19158 states and 78016 transitions. [2019-12-27 18:55:10,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:55:10,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 18:55:10,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:10,953 INFO L225 Difference]: With dead ends: 19158 [2019-12-27 18:55:10,954 INFO L226 Difference]: Without dead ends: 19149 [2019-12-27 18:55:10,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:55:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19149 states. [2019-12-27 18:55:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19149 to 8237. [2019-12-27 18:55:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8237 states. [2019-12-27 18:55:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8237 states to 8237 states and 38262 transitions. [2019-12-27 18:55:11,188 INFO L78 Accepts]: Start accepts. Automaton has 8237 states and 38262 transitions. Word has length 19 [2019-12-27 18:55:11,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:11,188 INFO L462 AbstractCegarLoop]: Abstraction has 8237 states and 38262 transitions. [2019-12-27 18:55:11,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:55:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 8237 states and 38262 transitions. [2019-12-27 18:55:11,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:55:11,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:11,189 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:11,389 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:11,390 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:11,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:11,390 INFO L82 PathProgramCache]: Analyzing trace with hash 682417739, now seen corresponding path program 2 times [2019-12-27 18:55:11,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:11,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991932682] [2019-12-27 18:55:11,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:11,432 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-27 18:55:11,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991932682] [2019-12-27 18:55:11,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:11,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:55:11,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [279620969] [2019-12-27 18:55:11,433 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:11,434 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:11,437 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 18:55:11,437 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:11,437 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:11,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:55:11,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:11,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:55:11,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:55:11,438 INFO L87 Difference]: Start difference. First operand 8237 states and 38262 transitions. Second operand 7 states. [2019-12-27 18:55:11,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:11,704 INFO L93 Difference]: Finished difference Result 19350 states and 78857 transitions. [2019-12-27 18:55:11,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:55:11,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 18:55:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:11,750 INFO L225 Difference]: With dead ends: 19350 [2019-12-27 18:55:11,750 INFO L226 Difference]: Without dead ends: 19341 [2019-12-27 18:55:11,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:55:11,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19341 states. [2019-12-27 18:55:11,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19341 to 8154. [2019-12-27 18:55:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8154 states. [2019-12-27 18:55:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8154 states to 8154 states and 37883 transitions. [2019-12-27 18:55:12,015 INFO L78 Accepts]: Start accepts. Automaton has 8154 states and 37883 transitions. Word has length 19 [2019-12-27 18:55:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:12,015 INFO L462 AbstractCegarLoop]: Abstraction has 8154 states and 37883 transitions. [2019-12-27 18:55:12,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:55:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 8154 states and 37883 transitions. [2019-12-27 18:55:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:55:12,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:12,017 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:12,017 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:12,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:12,018 INFO L82 PathProgramCache]: Analyzing trace with hash 682410888, now seen corresponding path program 2 times [2019-12-27 18:55:12,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:12,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884730410] [2019-12-27 18:55:12,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 18:55:12,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884730410] [2019-12-27 18:55:12,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:12,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:55:12,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1640027202] [2019-12-27 18:55:12,058 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:12,059 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:12,061 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 18:55:12,061 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:12,061 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:12,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:55:12,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:12,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:55:12,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:55:12,062 INFO L87 Difference]: Start difference. First operand 8154 states and 37883 transitions. Second operand 7 states. [2019-12-27 18:55:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:12,424 INFO L93 Difference]: Finished difference Result 19087 states and 77644 transitions. [2019-12-27 18:55:12,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:55:12,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 18:55:12,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:12,468 INFO L225 Difference]: With dead ends: 19087 [2019-12-27 18:55:12,468 INFO L226 Difference]: Without dead ends: 19078 [2019-12-27 18:55:12,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:55:12,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2019-12-27 18:55:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 8107. [2019-12-27 18:55:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8107 states. [2019-12-27 18:55:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 37697 transitions. [2019-12-27 18:55:12,720 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 37697 transitions. Word has length 19 [2019-12-27 18:55:12,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:12,720 INFO L462 AbstractCegarLoop]: Abstraction has 8107 states and 37697 transitions. [2019-12-27 18:55:12,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:55:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 37697 transitions. [2019-12-27 18:55:12,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:12,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:12,722 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:12,722 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash -20610704, now seen corresponding path program 1 times [2019-12-27 18:55:12,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:12,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711676224] [2019-12-27 18:55:12,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:12,786 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:55:12,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711676224] [2019-12-27 18:55:12,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873817525] [2019-12-27 18:55:12,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:12,868 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:55:12,869 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:55:12,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:12,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 18:55:12,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1987744114] [2019-12-27 18:55:12,891 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:12,893 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:12,900 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 18:55:12,900 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:13,035 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:55:13,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 18:55:13,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:13,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 18:55:13,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:55:13,037 INFO L87 Difference]: Start difference. First operand 8107 states and 37697 transitions. Second operand 16 states. [2019-12-27 18:55:14,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:14,843 INFO L93 Difference]: Finished difference Result 29507 states and 108761 transitions. [2019-12-27 18:55:14,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 18:55:14,844 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 18:55:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:14,905 INFO L225 Difference]: With dead ends: 29507 [2019-12-27 18:55:14,906 INFO L226 Difference]: Without dead ends: 29500 [2019-12-27 18:55:14,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1559 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1186, Invalid=3926, Unknown=0, NotChecked=0, Total=5112 [2019-12-27 18:55:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29500 states. [2019-12-27 18:55:15,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29500 to 7999. [2019-12-27 18:55:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7999 states. [2019-12-27 18:55:15,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7999 states to 7999 states and 37154 transitions. [2019-12-27 18:55:15,228 INFO L78 Accepts]: Start accepts. Automaton has 7999 states and 37154 transitions. Word has length 21 [2019-12-27 18:55:15,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:15,228 INFO L462 AbstractCegarLoop]: Abstraction has 7999 states and 37154 transitions. [2019-12-27 18:55:15,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 18:55:15,228 INFO L276 IsEmpty]: Start isEmpty. Operand 7999 states and 37154 transitions. [2019-12-27 18:55:15,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:15,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:15,230 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:15,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:15,430 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:15,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:15,431 INFO L82 PathProgramCache]: Analyzing trace with hash -25699664, now seen corresponding path program 2 times [2019-12-27 18:55:15,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:15,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991072396] [2019-12-27 18:55:15,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:55:15,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991072396] [2019-12-27 18:55:15,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387387805] [2019-12-27 18:55:15,480 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-27 18:55:15,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:55:15,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:15,561 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:55:15,562 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:55:15,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:15,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 18:55:15,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2009686832] [2019-12-27 18:55:15,579 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:15,581 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:15,586 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 18:55:15,586 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:15,629 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:55:15,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:55:15,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:15,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:55:15,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:55:15,630 INFO L87 Difference]: Start difference. First operand 7999 states and 37154 transitions. Second operand 12 states. [2019-12-27 18:55:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:16,941 INFO L93 Difference]: Finished difference Result 28304 states and 105368 transitions. [2019-12-27 18:55:16,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 18:55:16,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-27 18:55:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:17,000 INFO L225 Difference]: With dead ends: 28304 [2019-12-27 18:55:17,000 INFO L226 Difference]: Without dead ends: 28295 [2019-12-27 18:55:17,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=631, Invalid=2021, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 18:55:17,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28295 states. [2019-12-27 18:55:17,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28295 to 7893. [2019-12-27 18:55:17,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2019-12-27 18:55:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 36616 transitions. [2019-12-27 18:55:17,284 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 36616 transitions. Word has length 21 [2019-12-27 18:55:17,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:17,284 INFO L462 AbstractCegarLoop]: Abstraction has 7893 states and 36616 transitions. [2019-12-27 18:55:17,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:55:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 36616 transitions. [2019-12-27 18:55:17,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:17,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:17,285 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:17,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:17,486 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:17,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:17,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1336970474, now seen corresponding path program 3 times [2019-12-27 18:55:17,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:17,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491893979] [2019-12-27 18:55:17,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:17,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:55:17,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491893979] [2019-12-27 18:55:17,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557487754] [2019-12-27 18:55:17,533 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-27 18:55:17,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 18:55:17,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:17,629 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:55:17,630 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:55:17,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:17,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 18:55:17,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [844865356] [2019-12-27 18:55:17,653 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:17,655 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:17,660 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 18:55:17,660 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:17,701 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:55:17,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:55:17,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:17,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:55:17,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:55:17,702 INFO L87 Difference]: Start difference. First operand 7893 states and 36616 transitions. Second operand 11 states. [2019-12-27 18:55:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:18,749 INFO L93 Difference]: Finished difference Result 28007 states and 104728 transitions. [2019-12-27 18:55:18,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 18:55:18,749 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 18:55:18,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:18,817 INFO L225 Difference]: With dead ends: 28007 [2019-12-27 18:55:18,817 INFO L226 Difference]: Without dead ends: 28002 [2019-12-27 18:55:18,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=533, Invalid=1629, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 18:55:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28002 states. [2019-12-27 18:55:19,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28002 to 7675. [2019-12-27 18:55:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7675 states. [2019-12-27 18:55:19,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7675 states to 7675 states and 35630 transitions. [2019-12-27 18:55:19,304 INFO L78 Accepts]: Start accepts. Automaton has 7675 states and 35630 transitions. Word has length 21 [2019-12-27 18:55:19,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:19,304 INFO L462 AbstractCegarLoop]: Abstraction has 7675 states and 35630 transitions. [2019-12-27 18:55:19,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:55:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 7675 states and 35630 transitions. [2019-12-27 18:55:19,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:19,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:19,305 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:19,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:19,506 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:19,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:19,507 INFO L82 PathProgramCache]: Analyzing trace with hash -775423414, now seen corresponding path program 4 times [2019-12-27 18:55:19,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:19,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589771124] [2019-12-27 18:55:19,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:19,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:55:19,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589771124] [2019-12-27 18:55:19,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263674559] [2019-12-27 18:55:19,553 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-27 18:55:19,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 18:55:19,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:19,639 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:55:19,640 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:55:19,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:19,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 18:55:19,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1790612229] [2019-12-27 18:55:19,663 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:19,665 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:19,668 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 18:55:19,668 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:19,669 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:19,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:55:19,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:19,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:55:19,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:55:19,669 INFO L87 Difference]: Start difference. First operand 7675 states and 35630 transitions. Second operand 9 states. [2019-12-27 18:55:20,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:20,286 INFO L93 Difference]: Finished difference Result 25959 states and 98649 transitions. [2019-12-27 18:55:20,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:55:20,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 18:55:20,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:20,349 INFO L225 Difference]: With dead ends: 25959 [2019-12-27 18:55:20,349 INFO L226 Difference]: Without dead ends: 25953 [2019-12-27 18:55:20,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 18:55:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25953 states. [2019-12-27 18:55:20,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25953 to 7569. [2019-12-27 18:55:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7569 states. [2019-12-27 18:55:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7569 states to 7569 states and 35092 transitions. [2019-12-27 18:55:20,637 INFO L78 Accepts]: Start accepts. Automaton has 7569 states and 35092 transitions. Word has length 21 [2019-12-27 18:55:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:20,637 INFO L462 AbstractCegarLoop]: Abstraction has 7569 states and 35092 transitions. [2019-12-27 18:55:20,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:55:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 7569 states and 35092 transitions. [2019-12-27 18:55:20,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:20,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:20,639 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:20,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:20,839 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:20,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:20,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1590921030, now seen corresponding path program 1 times [2019-12-27 18:55:20,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:20,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802969000] [2019-12-27 18:55:20,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:20,870 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-27 18:55:20,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802969000] [2019-12-27 18:55:20,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:20,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:55:20,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1167918463] [2019-12-27 18:55:20,871 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:20,873 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:20,875 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 18:55:20,876 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:20,876 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:20,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:55:20,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:20,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:55:20,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:55:20,877 INFO L87 Difference]: Start difference. First operand 7569 states and 35092 transitions. Second operand 5 states. [2019-12-27 18:55:21,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:21,005 INFO L93 Difference]: Finished difference Result 12952 states and 56892 transitions. [2019-12-27 18:55:21,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:55:21,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 18:55:21,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:21,033 INFO L225 Difference]: With dead ends: 12952 [2019-12-27 18:55:21,034 INFO L226 Difference]: Without dead ends: 12936 [2019-12-27 18:55:21,034 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-27 18:55:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12936 states. [2019-12-27 18:55:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12936 to 9048. [2019-12-27 18:55:21,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9048 states. [2019-12-27 18:55:21,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9048 states to 9048 states and 41931 transitions. [2019-12-27 18:55:21,402 INFO L78 Accepts]: Start accepts. Automaton has 9048 states and 41931 transitions. Word has length 21 [2019-12-27 18:55:21,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:21,402 INFO L462 AbstractCegarLoop]: Abstraction has 9048 states and 41931 transitions. [2019-12-27 18:55:21,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:55:21,403 INFO L276 IsEmpty]: Start isEmpty. Operand 9048 states and 41931 transitions. [2019-12-27 18:55:21,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:21,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:21,404 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:21,404 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:21,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:21,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1326537718, now seen corresponding path program 5 times [2019-12-27 18:55:21,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:21,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159619644] [2019-12-27 18:55:21,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:21,478 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-27 18:55:21,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159619644] [2019-12-27 18:55:21,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:21,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:55:21,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1039555907] [2019-12-27 18:55:21,479 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:21,481 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:21,484 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 18:55:21,485 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:21,485 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:21,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:55:21,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:21,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:55:21,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:55:21,487 INFO L87 Difference]: Start difference. First operand 9048 states and 41931 transitions. Second operand 9 states. [2019-12-27 18:55:22,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:22,129 INFO L93 Difference]: Finished difference Result 29252 states and 112901 transitions. [2019-12-27 18:55:22,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:55:22,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 18:55:22,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:22,199 INFO L225 Difference]: With dead ends: 29252 [2019-12-27 18:55:22,199 INFO L226 Difference]: Without dead ends: 29245 [2019-12-27 18:55:22,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:55:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2019-12-27 18:55:22,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 8772. [2019-12-27 18:55:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-27 18:55:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40625 transitions. [2019-12-27 18:55:22,547 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40625 transitions. Word has length 21 [2019-12-27 18:55:22,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:22,547 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40625 transitions. [2019-12-27 18:55:22,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:55:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40625 transitions. [2019-12-27 18:55:22,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:22,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:22,548 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:22,548 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:22,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:22,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1333114678, now seen corresponding path program 6 times [2019-12-27 18:55:22,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:22,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266863392] [2019-12-27 18:55:22,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:22,608 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-27 18:55:22,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266863392] [2019-12-27 18:55:22,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:22,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:55:22,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [443008588] [2019-12-27 18:55:22,609 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:22,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:22,614 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 18:55:22,615 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:22,615 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:22,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:55:22,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:22,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:55:22,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:55:22,616 INFO L87 Difference]: Start difference. First operand 8772 states and 40625 transitions. Second operand 9 states. [2019-12-27 18:55:23,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:23,464 INFO L93 Difference]: Finished difference Result 28866 states and 111199 transitions. [2019-12-27 18:55:23,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:55:23,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 18:55:23,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:23,537 INFO L225 Difference]: With dead ends: 28866 [2019-12-27 18:55:23,537 INFO L226 Difference]: Without dead ends: 28856 [2019-12-27 18:55:23,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:55:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28856 states. [2019-12-27 18:55:23,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28856 to 8405. [2019-12-27 18:55:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2019-12-27 18:55:24,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 38987 transitions. [2019-12-27 18:55:24,005 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 38987 transitions. Word has length 21 [2019-12-27 18:55:24,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:24,006 INFO L462 AbstractCegarLoop]: Abstraction has 8405 states and 38987 transitions. [2019-12-27 18:55:24,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:55:24,006 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 38987 transitions. [2019-12-27 18:55:24,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:55:24,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:24,007 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:24,007 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:24,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:24,008 INFO L82 PathProgramCache]: Analyzing trace with hash 627672841, now seen corresponding path program 1 times [2019-12-27 18:55:24,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:24,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873736533] [2019-12-27 18:55:24,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:24,064 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 18:55:24,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873736533] [2019-12-27 18:55:24,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502595250] [2019-12-27 18:55:24,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:24,143 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 18:55:24,144 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 18:55:24,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:24,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 18:55:24,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [845999544] [2019-12-27 18:55:24,159 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:24,161 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:24,166 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 18:55:24,166 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:24,226 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:55:24,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:55:24,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:24,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:55:24,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:55:24,227 INFO L87 Difference]: Start difference. First operand 8405 states and 38987 transitions. Second operand 11 states. [2019-12-27 18:55:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:24,758 INFO L93 Difference]: Finished difference Result 21073 states and 84547 transitions. [2019-12-27 18:55:24,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:55:24,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-27 18:55:24,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:24,804 INFO L225 Difference]: With dead ends: 21073 [2019-12-27 18:55:24,805 INFO L226 Difference]: Without dead ends: 21054 [2019-12-27 18:55:24,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=447, Unknown=0, NotChecked=0, Total=650 [2019-12-27 18:55:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21054 states. [2019-12-27 18:55:25,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21054 to 8674. [2019-12-27 18:55:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-27 18:55:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 40123 transitions. [2019-12-27 18:55:25,060 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 40123 transitions. Word has length 23 [2019-12-27 18:55:25,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:25,061 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 40123 transitions. [2019-12-27 18:55:25,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:55:25,061 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 40123 transitions. [2019-12-27 18:55:25,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:55:25,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:25,063 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:25,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:25,263 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:25,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:25,264 INFO L82 PathProgramCache]: Analyzing trace with hash 771495304, now seen corresponding path program 1 times [2019-12-27 18:55:25,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:25,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62258577] [2019-12-27 18:55:25,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 18:55:25,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62258577] [2019-12-27 18:55:25,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067164154] [2019-12-27 18:55:25,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:25,376 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 18:55:25,377 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 18:55:25,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:25,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 18:55:25,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1176944415] [2019-12-27 18:55:25,400 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:25,402 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:25,408 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 55 transitions. [2019-12-27 18:55:25,408 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:25,409 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:25,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:55:25,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:25,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:55:25,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:55:25,410 INFO L87 Difference]: Start difference. First operand 8674 states and 40123 transitions. Second operand 7 states. [2019-12-27 18:55:25,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:25,693 INFO L93 Difference]: Finished difference Result 20331 states and 83597 transitions. [2019-12-27 18:55:25,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:55:25,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 18:55:25,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:25,738 INFO L225 Difference]: With dead ends: 20331 [2019-12-27 18:55:25,738 INFO L226 Difference]: Without dead ends: 20317 [2019-12-27 18:55:25,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:55:25,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20317 states. [2019-12-27 18:55:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20317 to 8938. [2019-12-27 18:55:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8938 states. [2019-12-27 18:55:25,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8938 states to 8938 states and 41305 transitions. [2019-12-27 18:55:25,994 INFO L78 Accepts]: Start accepts. Automaton has 8938 states and 41305 transitions. Word has length 23 [2019-12-27 18:55:25,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:25,995 INFO L462 AbstractCegarLoop]: Abstraction has 8938 states and 41305 transitions. [2019-12-27 18:55:25,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:55:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 8938 states and 41305 transitions. [2019-12-27 18:55:25,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:55:25,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:25,997 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:26,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:26,198 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:26,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:26,199 INFO L82 PathProgramCache]: Analyzing trace with hash -133229304, now seen corresponding path program 2 times [2019-12-27 18:55:26,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:26,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512314182] [2019-12-27 18:55:26,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:26,308 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-27 18:55:26,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512314182] [2019-12-27 18:55:26,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:26,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:55:26,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [229372663] [2019-12-27 18:55:26,309 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:26,311 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:26,316 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 18:55:26,316 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:26,316 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:26,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:55:26,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:26,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:55:26,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:55:26,318 INFO L87 Difference]: Start difference. First operand 8938 states and 41305 transitions. Second operand 7 states. [2019-12-27 18:55:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:26,760 INFO L93 Difference]: Finished difference Result 20594 states and 84698 transitions. [2019-12-27 18:55:26,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:55:26,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 18:55:26,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:26,845 INFO L225 Difference]: With dead ends: 20594 [2019-12-27 18:55:26,845 INFO L226 Difference]: Without dead ends: 20575 [2019-12-27 18:55:26,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:55:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20575 states. [2019-12-27 18:55:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20575 to 8847. [2019-12-27 18:55:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2019-12-27 18:55:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40829 transitions. [2019-12-27 18:55:27,188 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40829 transitions. Word has length 23 [2019-12-27 18:55:27,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:27,188 INFO L462 AbstractCegarLoop]: Abstraction has 8847 states and 40829 transitions. [2019-12-27 18:55:27,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:55:27,188 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40829 transitions. [2019-12-27 18:55:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:55:27,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:27,190 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:27,190 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:27,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:27,190 INFO L82 PathProgramCache]: Analyzing trace with hash -133236155, now seen corresponding path program 2 times [2019-12-27 18:55:27,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:27,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254873888] [2019-12-27 18:55:27,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:27,232 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-27 18:55:27,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254873888] [2019-12-27 18:55:27,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:27,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:55:27,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [39418813] [2019-12-27 18:55:27,233 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:27,235 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:27,239 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 18:55:27,239 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:27,239 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:27,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:55:27,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:27,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:55:27,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:55:27,240 INFO L87 Difference]: Start difference. First operand 8847 states and 40829 transitions. Second operand 7 states. [2019-12-27 18:55:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:27,513 INFO L93 Difference]: Finished difference Result 20360 states and 83494 transitions. [2019-12-27 18:55:27,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:55:27,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 18:55:27,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:27,564 INFO L225 Difference]: With dead ends: 20360 [2019-12-27 18:55:27,564 INFO L226 Difference]: Without dead ends: 20341 [2019-12-27 18:55:27,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:55:27,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20341 states. [2019-12-27 18:55:27,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20341 to 8772. [2019-12-27 18:55:27,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-27 18:55:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40442 transitions. [2019-12-27 18:55:27,831 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40442 transitions. Word has length 23 [2019-12-27 18:55:27,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:27,832 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40442 transitions. [2019-12-27 18:55:27,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:55:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40442 transitions. [2019-12-27 18:55:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:55:27,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:27,834 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:27,834 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:27,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:27,834 INFO L82 PathProgramCache]: Analyzing trace with hash -133234605, now seen corresponding path program 1 times [2019-12-27 18:55:27,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:27,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50685633] [2019-12-27 18:55:27,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:27,874 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-27 18:55:27,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50685633] [2019-12-27 18:55:27,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:27,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:55:27,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [991770127] [2019-12-27 18:55:27,875 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:27,877 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:27,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 18:55:27,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:27,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:27,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:55:27,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:27,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:55:27,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:55:27,883 INFO L87 Difference]: Start difference. First operand 8772 states and 40442 transitions. Second operand 7 states. [2019-12-27 18:55:28,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:28,182 INFO L93 Difference]: Finished difference Result 20740 states and 85213 transitions. [2019-12-27 18:55:28,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:55:28,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 18:55:28,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:28,230 INFO L225 Difference]: With dead ends: 20740 [2019-12-27 18:55:28,230 INFO L226 Difference]: Without dead ends: 20721 [2019-12-27 18:55:28,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:55:28,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20721 states. [2019-12-27 18:55:28,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20721 to 9181. [2019-12-27 18:55:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9181 states. [2019-12-27 18:55:28,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9181 states to 9181 states and 42287 transitions. [2019-12-27 18:55:28,647 INFO L78 Accepts]: Start accepts. Automaton has 9181 states and 42287 transitions. Word has length 23 [2019-12-27 18:55:28,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:28,648 INFO L462 AbstractCegarLoop]: Abstraction has 9181 states and 42287 transitions. [2019-12-27 18:55:28,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:55:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 9181 states and 42287 transitions. [2019-12-27 18:55:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:55:28,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:28,650 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:28,650 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:28,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:28,650 INFO L82 PathProgramCache]: Analyzing trace with hash -139067565, now seen corresponding path program 2 times [2019-12-27 18:55:28,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:28,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680590327] [2019-12-27 18:55:28,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:28,696 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-27 18:55:28,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680590327] [2019-12-27 18:55:28,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:28,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:55:28,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [837558573] [2019-12-27 18:55:28,697 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:28,700 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:28,704 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 39 transitions. [2019-12-27 18:55:28,704 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:28,751 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:55:28,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:55:28,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:28,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:55:28,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:55:28,753 INFO L87 Difference]: Start difference. First operand 9181 states and 42287 transitions. Second operand 11 states. [2019-12-27 18:55:29,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:29,337 INFO L93 Difference]: Finished difference Result 23635 states and 93345 transitions. [2019-12-27 18:55:29,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 18:55:29,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-27 18:55:29,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:29,386 INFO L225 Difference]: With dead ends: 23635 [2019-12-27 18:55:29,386 INFO L226 Difference]: Without dead ends: 23606 [2019-12-27 18:55:29,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=658, Unknown=0, NotChecked=0, Total=930 [2019-12-27 18:55:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23606 states. [2019-12-27 18:55:29,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23606 to 9286. [2019-12-27 18:55:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-27 18:55:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 42799 transitions. [2019-12-27 18:55:29,666 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 42799 transitions. Word has length 23 [2019-12-27 18:55:29,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:29,666 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 42799 transitions. [2019-12-27 18:55:29,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:55:29,667 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 42799 transitions. [2019-12-27 18:55:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:29,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:29,670 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:29,670 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:29,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:29,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1897453003, now seen corresponding path program 1 times [2019-12-27 18:55:29,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:29,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093299108] [2019-12-27 18:55:29,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 18:55:29,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093299108] [2019-12-27 18:55:29,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083838713] [2019-12-27 18:55:29,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:29,840 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:55:29,842 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 18:55:29,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:29,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 18:55:29,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1610640460] [2019-12-27 18:55:29,858 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:29,860 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:29,869 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 18:55:29,869 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:30,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 18:55:30,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 18:55:30,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:30,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 18:55:30,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-12-27 18:55:30,075 INFO L87 Difference]: Start difference. First operand 9286 states and 42799 transitions. Second operand 19 states. [2019-12-27 18:55:31,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:31,792 INFO L93 Difference]: Finished difference Result 33531 states and 124595 transitions. [2019-12-27 18:55:31,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 18:55:31,793 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-12-27 18:55:31,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:31,864 INFO L225 Difference]: With dead ends: 33531 [2019-12-27 18:55:31,864 INFO L226 Difference]: Without dead ends: 33513 [2019-12-27 18:55:31,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1587 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1330, Invalid=4220, Unknown=0, NotChecked=0, Total=5550 [2019-12-27 18:55:31,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33513 states. [2019-12-27 18:55:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33513 to 9200. [2019-12-27 18:55:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9200 states. [2019-12-27 18:55:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9200 states to 9200 states and 42331 transitions. [2019-12-27 18:55:32,422 INFO L78 Accepts]: Start accepts. Automaton has 9200 states and 42331 transitions. Word has length 25 [2019-12-27 18:55:32,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:32,422 INFO L462 AbstractCegarLoop]: Abstraction has 9200 states and 42331 transitions. [2019-12-27 18:55:32,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 18:55:32,422 INFO L276 IsEmpty]: Start isEmpty. Operand 9200 states and 42331 transitions. [2019-12-27 18:55:32,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:32,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:32,425 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:32,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:32,626 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:32,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:32,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1898197003, now seen corresponding path program 2 times [2019-12-27 18:55:32,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:32,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413182935] [2019-12-27 18:55:32,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 18:55:32,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413182935] [2019-12-27 18:55:32,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348727176] [2019-12-27 18:55:32,673 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:32,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:55:32,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:32,776 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:55:32,777 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 18:55:32,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:32,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 18:55:32,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1496626462] [2019-12-27 18:55:32,798 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:32,800 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:32,810 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 18:55:32,810 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:32,884 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:55:32,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:55:32,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:32,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:55:32,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:55:32,885 INFO L87 Difference]: Start difference. First operand 9200 states and 42331 transitions. Second operand 13 states. [2019-12-27 18:55:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:34,043 INFO L93 Difference]: Finished difference Result 31912 states and 119979 transitions. [2019-12-27 18:55:34,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 18:55:34,043 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 18:55:34,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:34,108 INFO L225 Difference]: With dead ends: 31912 [2019-12-27 18:55:34,109 INFO L226 Difference]: Without dead ends: 31893 [2019-12-27 18:55:34,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=665, Invalid=2091, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 18:55:34,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31893 states. [2019-12-27 18:55:34,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31893 to 9197. [2019-12-27 18:55:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9197 states. [2019-12-27 18:55:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9197 states to 9197 states and 42279 transitions. [2019-12-27 18:55:34,466 INFO L78 Accepts]: Start accepts. Automaton has 9197 states and 42279 transitions. Word has length 25 [2019-12-27 18:55:34,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:34,466 INFO L462 AbstractCegarLoop]: Abstraction has 9197 states and 42279 transitions. [2019-12-27 18:55:34,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:55:34,466 INFO L276 IsEmpty]: Start isEmpty. Operand 9197 states and 42279 transitions. [2019-12-27 18:55:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:34,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:34,470 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:34,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:34,671 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:34,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:34,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1898191702, now seen corresponding path program 1 times [2019-12-27 18:55:34,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:34,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976054835] [2019-12-27 18:55:34,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 18:55:34,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976054835] [2019-12-27 18:55:34,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034355477] [2019-12-27 18:55:34,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:34,822 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:55:34,823 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 18:55:34,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:34,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 18:55:34,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [643392237] [2019-12-27 18:55:34,839 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:34,842 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:34,849 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 18:55:34,850 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:34,934 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:55:34,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:55:34,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:34,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:55:34,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:55:34,935 INFO L87 Difference]: Start difference. First operand 9197 states and 42279 transitions. Second operand 13 states. [2019-12-27 18:55:36,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:36,300 INFO L93 Difference]: Finished difference Result 31552 states and 118615 transitions. [2019-12-27 18:55:36,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 18:55:36,300 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 18:55:36,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:36,375 INFO L225 Difference]: With dead ends: 31552 [2019-12-27 18:55:36,375 INFO L226 Difference]: Without dead ends: 31534 [2019-12-27 18:55:36,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=665, Invalid=2091, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 18:55:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31534 states. [2019-12-27 18:55:36,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31534 to 9121. [2019-12-27 18:55:36,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9121 states. [2019-12-27 18:55:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9121 states to 9121 states and 41862 transitions. [2019-12-27 18:55:36,771 INFO L78 Accepts]: Start accepts. Automaton has 9121 states and 41862 transitions. Word has length 25 [2019-12-27 18:55:36,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:36,771 INFO L462 AbstractCegarLoop]: Abstraction has 9121 states and 41862 transitions. [2019-12-27 18:55:36,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:55:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 9121 states and 41862 transitions. [2019-12-27 18:55:36,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:36,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:36,774 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:36,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:36,975 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:36,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:36,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358742, now seen corresponding path program 2 times [2019-12-27 18:55:36,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:36,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559369127] [2019-12-27 18:55:36,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 18:55:37,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559369127] [2019-12-27 18:55:37,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694559929] [2019-12-27 18:55:37,029 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:37,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:55:37,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:37,111 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:55:37,112 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:37,129 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 18:55:37,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:37,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 18:55:37,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [842891471] [2019-12-27 18:55:37,130 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:37,132 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:37,139 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 18:55:37,140 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:37,290 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 18:55:37,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:55:37,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:37,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:55:37,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:55:37,291 INFO L87 Difference]: Start difference. First operand 9121 states and 41862 transitions. Second operand 17 states. [2019-12-27 18:55:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:38,987 INFO L93 Difference]: Finished difference Result 32380 states and 120008 transitions. [2019-12-27 18:55:38,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 18:55:38,987 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-12-27 18:55:38,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:39,059 INFO L225 Difference]: With dead ends: 32380 [2019-12-27 18:55:39,059 INFO L226 Difference]: Without dead ends: 32361 [2019-12-27 18:55:39,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1227, Invalid=4029, Unknown=0, NotChecked=0, Total=5256 [2019-12-27 18:55:39,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32361 states. [2019-12-27 18:55:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32361 to 9044. [2019-12-27 18:55:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-12-27 18:55:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 41462 transitions. [2019-12-27 18:55:39,425 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 41462 transitions. Word has length 25 [2019-12-27 18:55:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:39,425 INFO L462 AbstractCegarLoop]: Abstraction has 9044 states and 41462 transitions. [2019-12-27 18:55:39,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:55:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 41462 transitions. [2019-12-27 18:55:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:39,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:39,429 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:39,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:39,629 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:39,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:39,630 INFO L82 PathProgramCache]: Analyzing trace with hash 756879153, now seen corresponding path program 3 times [2019-12-27 18:55:39,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:39,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858914812] [2019-12-27 18:55:39,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 18:55:39,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858914812] [2019-12-27 18:55:39,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363450684] [2019-12-27 18:55:39,678 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:39,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 18:55:39,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:39,761 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:55:39,763 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 18:55:39,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:39,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 18:55:39,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [97673813] [2019-12-27 18:55:39,793 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:39,796 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:39,806 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 18:55:39,807 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:39,885 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:55:39,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:55:39,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:39,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:55:39,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:55:39,886 INFO L87 Difference]: Start difference. First operand 9044 states and 41462 transitions. Second operand 12 states. [2019-12-27 18:55:40,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:40,962 INFO L93 Difference]: Finished difference Result 30950 states and 116627 transitions. [2019-12-27 18:55:40,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 18:55:40,962 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-27 18:55:40,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:41,031 INFO L225 Difference]: With dead ends: 30950 [2019-12-27 18:55:41,031 INFO L226 Difference]: Without dead ends: 30936 [2019-12-27 18:55:41,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=567, Invalid=1689, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 18:55:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30936 states. [2019-12-27 18:55:41,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30936 to 8874. [2019-12-27 18:55:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8874 states. [2019-12-27 18:55:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8874 states to 8874 states and 40677 transitions. [2019-12-27 18:55:41,379 INFO L78 Accepts]: Start accepts. Automaton has 8874 states and 40677 transitions. Word has length 25 [2019-12-27 18:55:41,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:41,379 INFO L462 AbstractCegarLoop]: Abstraction has 8874 states and 40677 transitions. [2019-12-27 18:55:41,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:55:41,379 INFO L276 IsEmpty]: Start isEmpty. Operand 8874 states and 40677 transitions. [2019-12-27 18:55:41,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:41,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:41,383 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:41,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:41,583 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:41,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1622343673, now seen corresponding path program 4 times [2019-12-27 18:55:41,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:41,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742315078] [2019-12-27 18:55:41,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:41,626 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 18:55:41,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742315078] [2019-12-27 18:55:41,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452368333] [2019-12-27 18:55:41,627 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:41,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 18:55:41,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:41,703 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:55:41,704 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:41,720 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 18:55:41,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:41,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 18:55:41,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [13900332] [2019-12-27 18:55:41,720 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:41,723 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:41,729 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 18:55:41,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:41,729 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:41,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:55:41,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:41,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:55:41,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:55:41,730 INFO L87 Difference]: Start difference. First operand 8874 states and 40677 transitions. Second operand 9 states. [2019-12-27 18:55:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:42,429 INFO L93 Difference]: Finished difference Result 28993 states and 111827 transitions. [2019-12-27 18:55:42,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:55:42,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 18:55:42,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:42,499 INFO L225 Difference]: With dead ends: 28993 [2019-12-27 18:55:42,499 INFO L226 Difference]: Without dead ends: 28982 [2019-12-27 18:55:42,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 18:55:42,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28982 states. [2019-12-27 18:55:42,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28982 to 8871. [2019-12-27 18:55:42,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8871 states. [2019-12-27 18:55:42,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8871 states to 8871 states and 40625 transitions. [2019-12-27 18:55:42,813 INFO L78 Accepts]: Start accepts. Automaton has 8871 states and 40625 transitions. Word has length 25 [2019-12-27 18:55:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:42,813 INFO L462 AbstractCegarLoop]: Abstraction has 8871 states and 40625 transitions. [2019-12-27 18:55:42,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:55:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 8871 states and 40625 transitions. [2019-12-27 18:55:42,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:42,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:42,816 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:43,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:43,017 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:43,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:43,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1622342123, now seen corresponding path program 1 times [2019-12-27 18:55:43,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:43,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734160119] [2019-12-27 18:55:43,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 18:55:43,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734160119] [2019-12-27 18:55:43,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178199510] [2019-12-27 18:55:43,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:43,143 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:55:43,144 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 18:55:43,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:43,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 18:55:43,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1420672043] [2019-12-27 18:55:43,159 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:43,161 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:43,169 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 18:55:43,169 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:43,170 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:43,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:55:43,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:43,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:55:43,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:55:43,171 INFO L87 Difference]: Start difference. First operand 8871 states and 40625 transitions. Second operand 9 states. [2019-12-27 18:55:43,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:43,993 INFO L93 Difference]: Finished difference Result 28840 states and 111427 transitions. [2019-12-27 18:55:43,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:55:43,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 18:55:43,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:44,053 INFO L225 Difference]: With dead ends: 28840 [2019-12-27 18:55:44,053 INFO L226 Difference]: Without dead ends: 28830 [2019-12-27 18:55:44,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 18:55:44,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28830 states. [2019-12-27 18:55:44,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28830 to 8831. [2019-12-27 18:55:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8831 states. [2019-12-27 18:55:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8831 states to 8831 states and 40384 transitions. [2019-12-27 18:55:44,352 INFO L78 Accepts]: Start accepts. Automaton has 8831 states and 40384 transitions. Word has length 25 [2019-12-27 18:55:44,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:44,352 INFO L462 AbstractCegarLoop]: Abstraction has 8831 states and 40384 transitions. [2019-12-27 18:55:44,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:55:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 8831 states and 40384 transitions. [2019-12-27 18:55:44,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:44,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:44,356 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:44,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:44,559 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:44,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:44,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1628175083, now seen corresponding path program 2 times [2019-12-27 18:55:44,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:44,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033289300] [2019-12-27 18:55:44,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 18:55:44,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033289300] [2019-12-27 18:55:44,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137551223] [2019-12-27 18:55:44,618 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:44,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:55:44,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:44,701 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:55:44,702 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:44,719 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 18:55:44,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:44,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 18:55:44,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1586328021] [2019-12-27 18:55:44,720 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:44,722 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:44,729 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 18:55:44,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:44,775 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:55:44,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:55:44,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:44,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:55:44,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:55:44,776 INFO L87 Difference]: Start difference. First operand 8831 states and 40384 transitions. Second operand 13 states. [2019-12-27 18:55:46,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:46,209 INFO L93 Difference]: Finished difference Result 31746 states and 118539 transitions. [2019-12-27 18:55:46,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 18:55:46,210 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 18:55:46,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:46,281 INFO L225 Difference]: With dead ends: 31746 [2019-12-27 18:55:46,281 INFO L226 Difference]: Without dead ends: 31727 [2019-12-27 18:55:46,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1329 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=974, Invalid=3316, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 18:55:46,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31727 states. [2019-12-27 18:55:46,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31727 to 8722. [2019-12-27 18:55:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8722 states. [2019-12-27 18:55:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 39861 transitions. [2019-12-27 18:55:46,634 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 39861 transitions. Word has length 25 [2019-12-27 18:55:46,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:46,634 INFO L462 AbstractCegarLoop]: Abstraction has 8722 states and 39861 transitions. [2019-12-27 18:55:46,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:55:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 39861 transitions. [2019-12-27 18:55:46,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:46,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:46,639 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:46,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:46,840 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:46,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:46,840 INFO L82 PathProgramCache]: Analyzing trace with hash 815669127, now seen corresponding path program 5 times [2019-12-27 18:55:46,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:46,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214613447] [2019-12-27 18:55:46,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:46,924 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-27 18:55:46,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214613447] [2019-12-27 18:55:46,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:46,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:55:46,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [589676842] [2019-12-27 18:55:46,926 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:46,930 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:46,939 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:55:46,939 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:46,939 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:46,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:55:46,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:46,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:55:46,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:55:46,940 INFO L87 Difference]: Start difference. First operand 8722 states and 39861 transitions. Second operand 9 states. [2019-12-27 18:55:47,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:47,674 INFO L93 Difference]: Finished difference Result 28362 states and 109208 transitions. [2019-12-27 18:55:47,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:55:47,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 18:55:47,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:47,738 INFO L225 Difference]: With dead ends: 28362 [2019-12-27 18:55:47,738 INFO L226 Difference]: Without dead ends: 28352 [2019-12-27 18:55:47,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:55:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28352 states. [2019-12-27 18:55:48,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28352 to 8506. [2019-12-27 18:55:48,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8506 states. [2019-12-27 18:55:48,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8506 states to 8506 states and 38850 transitions. [2019-12-27 18:55:48,287 INFO L78 Accepts]: Start accepts. Automaton has 8506 states and 38850 transitions. Word has length 25 [2019-12-27 18:55:48,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:48,287 INFO L462 AbstractCegarLoop]: Abstraction has 8506 states and 38850 transitions. [2019-12-27 18:55:48,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:55:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 8506 states and 38850 transitions. [2019-12-27 18:55:48,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:48,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:48,291 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:48,291 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:48,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:48,291 INFO L82 PathProgramCache]: Analyzing trace with hash 815670677, now seen corresponding path program 3 times [2019-12-27 18:55:48,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:48,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172977266] [2019-12-27 18:55:48,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:48,344 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-27 18:55:48,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172977266] [2019-12-27 18:55:48,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:48,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:55:48,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1962410698] [2019-12-27 18:55:48,345 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:48,348 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:48,352 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:55:48,352 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:48,352 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:48,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:55:48,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:48,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:55:48,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:55:48,353 INFO L87 Difference]: Start difference. First operand 8506 states and 38850 transitions. Second operand 9 states. [2019-12-27 18:55:49,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:49,021 INFO L93 Difference]: Finished difference Result 28156 states and 108503 transitions. [2019-12-27 18:55:49,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:55:49,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 18:55:49,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:49,084 INFO L225 Difference]: With dead ends: 28156 [2019-12-27 18:55:49,084 INFO L226 Difference]: Without dead ends: 28146 [2019-12-27 18:55:49,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:55:49,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28146 states. [2019-12-27 18:55:49,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28146 to 8362. [2019-12-27 18:55:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8362 states. [2019-12-27 18:55:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8362 states to 8362 states and 38183 transitions. [2019-12-27 18:55:49,387 INFO L78 Accepts]: Start accepts. Automaton has 8362 states and 38183 transitions. Word has length 25 [2019-12-27 18:55:49,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:49,387 INFO L462 AbstractCegarLoop]: Abstraction has 8362 states and 38183 transitions. [2019-12-27 18:55:49,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:55:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 8362 states and 38183 transitions. [2019-12-27 18:55:49,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:49,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:49,390 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:49,390 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:49,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:49,390 INFO L82 PathProgramCache]: Analyzing trace with hash 809092167, now seen corresponding path program 6 times [2019-12-27 18:55:49,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:49,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201793364] [2019-12-27 18:55:49,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:49,429 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-27 18:55:49,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201793364] [2019-12-27 18:55:49,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:49,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:55:49,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [312796763] [2019-12-27 18:55:49,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:49,433 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:49,438 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:55:49,438 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:49,439 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:49,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:55:49,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:49,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:55:49,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:55:49,440 INFO L87 Difference]: Start difference. First operand 8362 states and 38183 transitions. Second operand 9 states. [2019-12-27 18:55:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:50,102 INFO L93 Difference]: Finished difference Result 27714 states and 106431 transitions. [2019-12-27 18:55:50,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:55:50,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 18:55:50,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:50,167 INFO L225 Difference]: With dead ends: 27714 [2019-12-27 18:55:50,168 INFO L226 Difference]: Without dead ends: 27700 [2019-12-27 18:55:50,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:55:50,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27700 states. [2019-12-27 18:55:50,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27700 to 8063. [2019-12-27 18:55:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8063 states. [2019-12-27 18:55:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 36856 transitions. [2019-12-27 18:55:50,478 INFO L78 Accepts]: Start accepts. Automaton has 8063 states and 36856 transitions. Word has length 25 [2019-12-27 18:55:50,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:50,478 INFO L462 AbstractCegarLoop]: Abstraction has 8063 states and 36856 transitions. [2019-12-27 18:55:50,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:55:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 8063 states and 36856 transitions. [2019-12-27 18:55:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:50,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:50,481 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:50,482 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:50,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:50,482 INFO L82 PathProgramCache]: Analyzing trace with hash 809086866, now seen corresponding path program 3 times [2019-12-27 18:55:50,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:50,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045810041] [2019-12-27 18:55:50,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:50,545 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-27 18:55:50,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045810041] [2019-12-27 18:55:50,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:50,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:55:50,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [925840314] [2019-12-27 18:55:50,545 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:50,549 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:50,554 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:55:50,554 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:50,554 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:50,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:55:50,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:50,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:55:50,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:55:50,555 INFO L87 Difference]: Start difference. First operand 8063 states and 36856 transitions. Second operand 9 states. [2019-12-27 18:55:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:51,195 INFO L93 Difference]: Finished difference Result 27553 states and 105964 transitions. [2019-12-27 18:55:51,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:55:51,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 18:55:51,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:51,253 INFO L225 Difference]: With dead ends: 27553 [2019-12-27 18:55:51,253 INFO L226 Difference]: Without dead ends: 27543 [2019-12-27 18:55:51,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:55:51,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27543 states. [2019-12-27 18:55:51,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27543 to 7969. [2019-12-27 18:55:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7969 states. [2019-12-27 18:55:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7969 states to 7969 states and 36432 transitions. [2019-12-27 18:55:51,530 INFO L78 Accepts]: Start accepts. Automaton has 7969 states and 36432 transitions. Word has length 25 [2019-12-27 18:55:51,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:51,531 INFO L462 AbstractCegarLoop]: Abstraction has 7969 states and 36432 transitions. [2019-12-27 18:55:51,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:55:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 7969 states and 36432 transitions. [2019-12-27 18:55:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:51,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:51,533 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:51,534 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:51,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:51,534 INFO L82 PathProgramCache]: Analyzing trace with hash 810581717, now seen corresponding path program 4 times [2019-12-27 18:55:51,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:51,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112064277] [2019-12-27 18:55:51,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:51,588 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-27 18:55:51,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112064277] [2019-12-27 18:55:51,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:51,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:55:51,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [568379491] [2019-12-27 18:55:51,589 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:51,592 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:51,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:55:51,596 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:51,596 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:51,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:55:51,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:51,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:55:51,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:55:51,596 INFO L87 Difference]: Start difference. First operand 7969 states and 36432 transitions. Second operand 9 states. [2019-12-27 18:55:52,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:52,313 INFO L93 Difference]: Finished difference Result 27570 states and 106062 transitions. [2019-12-27 18:55:52,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:55:52,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 18:55:52,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:52,370 INFO L225 Difference]: With dead ends: 27570 [2019-12-27 18:55:52,371 INFO L226 Difference]: Without dead ends: 27556 [2019-12-27 18:55:52,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:55:52,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27556 states. [2019-12-27 18:55:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27556 to 7970. [2019-12-27 18:55:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7970 states. [2019-12-27 18:55:52,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7970 states to 7970 states and 36401 transitions. [2019-12-27 18:55:52,652 INFO L78 Accepts]: Start accepts. Automaton has 7970 states and 36401 transitions. Word has length 25 [2019-12-27 18:55:52,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:52,653 INFO L462 AbstractCegarLoop]: Abstraction has 7970 states and 36401 transitions. [2019-12-27 18:55:52,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:55:52,653 INFO L276 IsEmpty]: Start isEmpty. Operand 7970 states and 36401 transitions. [2019-12-27 18:55:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:52,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:52,656 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:52,656 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:52,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:52,657 INFO L82 PathProgramCache]: Analyzing trace with hash 810574866, now seen corresponding path program 4 times [2019-12-27 18:55:52,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:52,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674269460] [2019-12-27 18:55:52,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:52,691 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-27 18:55:52,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674269460] [2019-12-27 18:55:52,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:52,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:55:52,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1290855012] [2019-12-27 18:55:52,692 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:52,693 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:52,697 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:55:52,697 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:52,698 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:52,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:55:52,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:52,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:55:52,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:55:52,698 INFO L87 Difference]: Start difference. First operand 7970 states and 36401 transitions. Second operand 9 states. [2019-12-27 18:55:53,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:53,341 INFO L93 Difference]: Finished difference Result 27265 states and 104830 transitions. [2019-12-27 18:55:53,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:55:53,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 18:55:53,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:53,402 INFO L225 Difference]: With dead ends: 27265 [2019-12-27 18:55:53,402 INFO L226 Difference]: Without dead ends: 27251 [2019-12-27 18:55:53,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:55:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27251 states. [2019-12-27 18:55:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27251 to 7917. [2019-12-27 18:55:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7917 states. [2019-12-27 18:55:53,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7917 states to 7917 states and 36127 transitions. [2019-12-27 18:55:53,699 INFO L78 Accepts]: Start accepts. Automaton has 7917 states and 36127 transitions. Word has length 25 [2019-12-27 18:55:53,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:53,699 INFO L462 AbstractCegarLoop]: Abstraction has 7917 states and 36127 transitions. [2019-12-27 18:55:53,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:55:53,700 INFO L276 IsEmpty]: Start isEmpty. Operand 7917 states and 36127 transitions. [2019-12-27 18:55:53,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:53,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:53,702 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:53,703 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:53,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:53,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1878167028, now seen corresponding path program 1 times [2019-12-27 18:55:53,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:53,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282179129] [2019-12-27 18:55:53,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-27 18:55:53,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282179129] [2019-12-27 18:55:53,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:53,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:55:53,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1967656474] [2019-12-27 18:55:53,741 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:53,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:53,745 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:55:53,746 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:53,746 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:53,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:55:53,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:53,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:55:53,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:55:53,747 INFO L87 Difference]: Start difference. First operand 7917 states and 36127 transitions. Second operand 5 states. [2019-12-27 18:55:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:53,867 INFO L93 Difference]: Finished difference Result 12944 states and 56476 transitions. [2019-12-27 18:55:53,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:55:53,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 18:55:53,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:53,897 INFO L225 Difference]: With dead ends: 12944 [2019-12-27 18:55:53,897 INFO L226 Difference]: Without dead ends: 12912 [2019-12-27 18:55:53,897 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-27 18:55:53,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2019-12-27 18:55:54,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 9346. [2019-12-27 18:55:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9346 states. [2019-12-27 18:55:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9346 states to 9346 states and 42193 transitions. [2019-12-27 18:55:54,101 INFO L78 Accepts]: Start accepts. Automaton has 9346 states and 42193 transitions. Word has length 25 [2019-12-27 18:55:54,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:54,102 INFO L462 AbstractCegarLoop]: Abstraction has 9346 states and 42193 transitions. [2019-12-27 18:55:54,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:55:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 9346 states and 42193 transitions. [2019-12-27 18:55:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:54,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:54,105 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:54,105 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:54,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:54,105 INFO L82 PathProgramCache]: Analyzing trace with hash -500669547, now seen corresponding path program 5 times [2019-12-27 18:55:54,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:54,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18927509] [2019-12-27 18:55:54,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:54,162 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-27 18:55:54,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18927509] [2019-12-27 18:55:54,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:54,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:55:54,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1763517690] [2019-12-27 18:55:54,163 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:54,165 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:54,172 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 18:55:54,173 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:54,288 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:55:54,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:55:54,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:54,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:55:54,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:55:54,289 INFO L87 Difference]: Start difference. First operand 9346 states and 42193 transitions. Second operand 17 states. [2019-12-27 18:55:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:56,856 INFO L93 Difference]: Finished difference Result 36090 states and 131919 transitions. [2019-12-27 18:55:56,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 18:55:56,856 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-12-27 18:55:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:56,929 INFO L225 Difference]: With dead ends: 36090 [2019-12-27 18:55:56,929 INFO L226 Difference]: Without dead ends: 36060 [2019-12-27 18:55:56,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3073 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1937, Invalid=6993, Unknown=0, NotChecked=0, Total=8930 [2019-12-27 18:55:56,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36060 states. [2019-12-27 18:55:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36060 to 9188. [2019-12-27 18:55:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9188 states. [2019-12-27 18:55:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 41446 transitions. [2019-12-27 18:55:57,290 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 41446 transitions. Word has length 25 [2019-12-27 18:55:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:57,290 INFO L462 AbstractCegarLoop]: Abstraction has 9188 states and 41446 transitions. [2019-12-27 18:55:57,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:55:57,290 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 41446 transitions. [2019-12-27 18:55:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:57,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:57,293 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:57,293 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:57,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:57,293 INFO L82 PathProgramCache]: Analyzing trace with hash -499925547, now seen corresponding path program 6 times [2019-12-27 18:55:57,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:57,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128401688] [2019-12-27 18:55:57,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:57,382 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-27 18:55:57,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128401688] [2019-12-27 18:55:57,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:57,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:55:57,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [385796532] [2019-12-27 18:55:57,383 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:57,386 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:57,392 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 18:55:57,392 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:57,440 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:55:57,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:55:57,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:57,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:55:57,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:55:57,441 INFO L87 Difference]: Start difference. First operand 9188 states and 41446 transitions. Second operand 13 states. [2019-12-27 18:55:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:59,063 INFO L93 Difference]: Finished difference Result 34324 states and 127393 transitions. [2019-12-27 18:55:59,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 18:55:59,063 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 18:55:59,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:59,133 INFO L225 Difference]: With dead ends: 34324 [2019-12-27 18:55:59,133 INFO L226 Difference]: Without dead ends: 34289 [2019-12-27 18:55:59,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1567 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1047, Invalid=3783, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 18:55:59,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34289 states. [2019-12-27 18:55:59,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34289 to 8937. [2019-12-27 18:55:59,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8937 states. [2019-12-27 18:55:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8937 states to 8937 states and 40326 transitions. [2019-12-27 18:55:59,505 INFO L78 Accepts]: Start accepts. Automaton has 8937 states and 40326 transitions. Word has length 25 [2019-12-27 18:55:59,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:59,505 INFO L462 AbstractCegarLoop]: Abstraction has 8937 states and 40326 transitions. [2019-12-27 18:55:59,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:55:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 8937 states and 40326 transitions. [2019-12-27 18:55:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:55:59,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:59,508 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:59,509 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:55:59,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:59,509 INFO L82 PathProgramCache]: Analyzing trace with hash -499932398, now seen corresponding path program 5 times [2019-12-27 18:55:59,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:59,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486108572] [2019-12-27 18:55:59,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:59,558 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-27 18:55:59,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486108572] [2019-12-27 18:55:59,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:59,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:55:59,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1657661739] [2019-12-27 18:55:59,560 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:59,562 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:59,566 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 18:55:59,567 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:59,627 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:55:59,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:55:59,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:59,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:55:59,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:55:59,628 INFO L87 Difference]: Start difference. First operand 8937 states and 40326 transitions. Second operand 13 states. [2019-12-27 18:56:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:01,306 INFO L93 Difference]: Finished difference Result 33898 states and 125701 transitions. [2019-12-27 18:56:01,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 18:56:01,306 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 18:56:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:01,379 INFO L225 Difference]: With dead ends: 33898 [2019-12-27 18:56:01,379 INFO L226 Difference]: Without dead ends: 33868 [2019-12-27 18:56:01,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1047, Invalid=3783, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 18:56:01,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33868 states. [2019-12-27 18:56:01,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33868 to 8839. [2019-12-27 18:56:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8839 states. [2019-12-27 18:56:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8839 states to 8839 states and 39856 transitions. [2019-12-27 18:56:01,905 INFO L78 Accepts]: Start accepts. Automaton has 8839 states and 39856 transitions. Word has length 25 [2019-12-27 18:56:01,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:01,905 INFO L462 AbstractCegarLoop]: Abstraction has 8839 states and 39856 transitions. [2019-12-27 18:56:01,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:56:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 8839 states and 39856 transitions. [2019-12-27 18:56:01,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:56:01,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:01,908 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:01,908 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:01,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:01,909 INFO L82 PathProgramCache]: Analyzing trace with hash -507253358, now seen corresponding path program 6 times [2019-12-27 18:56:01,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:01,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439471508] [2019-12-27 18:56:01,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:01,984 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-27 18:56:01,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439471508] [2019-12-27 18:56:01,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:56:01,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:56:01,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [592420428] [2019-12-27 18:56:01,985 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:01,987 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:01,993 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 18:56:01,993 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:02,093 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:56:02,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:56:02,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:02,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:56:02,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:56:02,094 INFO L87 Difference]: Start difference. First operand 8839 states and 39856 transitions. Second operand 17 states. [2019-12-27 18:56:04,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:04,496 INFO L93 Difference]: Finished difference Result 34906 states and 127104 transitions. [2019-12-27 18:56:04,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 18:56:04,496 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-12-27 18:56:04,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:04,572 INFO L225 Difference]: With dead ends: 34906 [2019-12-27 18:56:04,572 INFO L226 Difference]: Without dead ends: 34871 [2019-12-27 18:56:04,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3074 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1937, Invalid=6993, Unknown=0, NotChecked=0, Total=8930 [2019-12-27 18:56:04,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34871 states. [2019-12-27 18:56:04,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34871 to 8516. [2019-12-27 18:56:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-12-27 18:56:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 38438 transitions. [2019-12-27 18:56:04,939 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 38438 transitions. Word has length 25 [2019-12-27 18:56:04,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:04,939 INFO L462 AbstractCegarLoop]: Abstraction has 8516 states and 38438 transitions. [2019-12-27 18:56:04,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:56:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 38438 transitions. [2019-12-27 18:56:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 18:56:04,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:04,943 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:04,943 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:04,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:04,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1901572494, now seen corresponding path program 1 times [2019-12-27 18:56:04,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:04,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198119313] [2019-12-27 18:56:04,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:56:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:56:04,960 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:56:04,961 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:56:04,961 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 18:56:04,961 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 18:56:04,974 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,975 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,975 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,975 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,975 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,975 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,975 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,976 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,976 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,976 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,976 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,976 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,976 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,976 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,976 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,977 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,977 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,977 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,977 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,977 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,977 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,977 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,978 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,978 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,978 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,978 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,978 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,978 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,978 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,979 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,979 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,979 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,979 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,979 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,979 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,979 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,980 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,980 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,980 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,980 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,980 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,980 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,980 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,980 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,981 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,981 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,981 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,981 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,981 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,981 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,981 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,981 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,982 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,982 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,982 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,982 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,982 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,982 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,982 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,983 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,983 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,983 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,983 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,983 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,983 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,983 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,984 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,984 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,984 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,984 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,984 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,984 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,984 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,984 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,985 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,985 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,985 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,985 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,985 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,986 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,986 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,986 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,987 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,987 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,987 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,988 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,988 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,988 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,988 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,988 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,988 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,988 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,988 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,989 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,989 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,989 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,989 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,989 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,989 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,989 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,989 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,990 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,990 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,990 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,990 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,990 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,990 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,990 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,990 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,991 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,991 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,991 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,991 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,991 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,991 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,991 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,991 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,992 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,992 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,992 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,992 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,992 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,992 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:04,993 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,002 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,002 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,003 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,003 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,003 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,004 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,004 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,004 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,004 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,005 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,006 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,006 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,006 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,006 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,006 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,008 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,008 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,008 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,008 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,008 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,010 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,010 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,010 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,010 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,010 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,011 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,012 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,012 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,012 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,012 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,012 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,013 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,013 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,013 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,013 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,013 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,013 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,014 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,014 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,015 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,015 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,016 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,016 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,016 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,016 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,016 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,017 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,017 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,017 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,017 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,017 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,017 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,018 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,018 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,018 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,018 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,018 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,018 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:56:05,019 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-27 18:56:05,020 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:56:05,020 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:56:05,020 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:56:05,020 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:56:05,020 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:56:05,020 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:56:05,020 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:56:05,020 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:56:05,022 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 141 transitions [2019-12-27 18:56:05,022 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-27 18:56:05,047 INFO L132 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-27 18:56:05,047 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 18:56:05,050 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 313 event pairs. 0/155 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2019-12-27 18:56:05,060 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-27 18:56:05,084 INFO L132 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-27 18:56:05,084 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 18:56:05,088 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 313 event pairs. 0/155 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2019-12-27 18:56:05,097 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3612 [2019-12-27 18:56:05,098 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:56:07,220 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-27 18:56:07,384 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4276 [2019-12-27 18:56:07,384 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 18:56:07,385 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions [2019-12-27 18:56:08,645 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2019-12-27 18:56:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2019-12-27 18:56:08,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:56:08,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:08,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:56:08,646 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:08,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:08,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1263148, now seen corresponding path program 1 times [2019-12-27 18:56:08,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:08,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314859690] [2019-12-27 18:56:08,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:08,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314859690] [2019-12-27 18:56:08,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:56:08,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:56:08,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [628673865] [2019-12-27 18:56:08,655 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:08,655 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:08,655 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:56:08,655 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:08,656 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:56:08,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:56:08,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:08,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:56:08,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:56:08,656 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2019-12-27 18:56:08,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:08,781 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2019-12-27 18:56:08,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:56:08,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:56:08,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:08,828 INFO L225 Difference]: With dead ends: 17885 [2019-12-27 18:56:08,828 INFO L226 Difference]: Without dead ends: 16791 [2019-12-27 18:56:08,829 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-27 18:56:08,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2019-12-27 18:56:09,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16189. [2019-12-27 18:56:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16189 states. [2019-12-27 18:56:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16189 states to 16189 states and 84585 transitions. [2019-12-27 18:56:09,199 INFO L78 Accepts]: Start accepts. Automaton has 16189 states and 84585 transitions. Word has length 3 [2019-12-27 18:56:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:09,199 INFO L462 AbstractCegarLoop]: Abstraction has 16189 states and 84585 transitions. [2019-12-27 18:56:09,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:56:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 16189 states and 84585 transitions. [2019-12-27 18:56:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 18:56:09,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:09,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:09,199 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:09,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:09,200 INFO L82 PathProgramCache]: Analyzing trace with hash 86926032, now seen corresponding path program 1 times [2019-12-27 18:56:09,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:09,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212112280] [2019-12-27 18:56:09,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:09,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212112280] [2019-12-27 18:56:09,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:56:09,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:56:09,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [682958872] [2019-12-27 18:56:09,215 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:09,215 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:09,215 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 18:56:09,216 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:09,216 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:56:09,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:56:09,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:09,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:56:09,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:56:09,216 INFO L87 Difference]: Start difference. First operand 16189 states and 84585 transitions. Second operand 5 states. [2019-12-27 18:56:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:09,446 INFO L93 Difference]: Finished difference Result 29874 states and 147254 transitions. [2019-12-27 18:56:09,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:56:09,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 18:56:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:09,529 INFO L225 Difference]: With dead ends: 29874 [2019-12-27 18:56:09,529 INFO L226 Difference]: Without dead ends: 29871 [2019-12-27 18:56:09,529 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-27 18:56:09,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29871 states. [2019-12-27 18:56:10,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29871 to 19122. [2019-12-27 18:56:10,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-27 18:56:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 100971 transitions. [2019-12-27 18:56:10,093 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 100971 transitions. Word has length 9 [2019-12-27 18:56:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:10,093 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 100971 transitions. [2019-12-27 18:56:10,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:56:10,093 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 100971 transitions. [2019-12-27 18:56:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:56:10,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:10,093 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:10,093 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:10,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:10,094 INFO L82 PathProgramCache]: Analyzing trace with hash 941737402, now seen corresponding path program 1 times [2019-12-27 18:56:10,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:10,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753595570] [2019-12-27 18:56:10,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:10,137 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-27 18:56:10,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753595570] [2019-12-27 18:56:10,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:56:10,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:56:10,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1368993689] [2019-12-27 18:56:10,138 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:10,139 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:10,140 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:56:10,140 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:10,140 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:56:10,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:56:10,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:10,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:56:10,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:56:10,141 INFO L87 Difference]: Start difference. First operand 19122 states and 100971 transitions. Second operand 5 states. [2019-12-27 18:56:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:10,391 INFO L93 Difference]: Finished difference Result 34948 states and 174870 transitions. [2019-12-27 18:56:10,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:56:10,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 18:56:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:10,496 INFO L225 Difference]: With dead ends: 34948 [2019-12-27 18:56:10,496 INFO L226 Difference]: Without dead ends: 34944 [2019-12-27 18:56:10,496 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-27 18:56:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34944 states. [2019-12-27 18:56:12,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34944 to 22883. [2019-12-27 18:56:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-12-27 18:56:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 122526 transitions. [2019-12-27 18:56:12,975 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 122526 transitions. Word has length 13 [2019-12-27 18:56:12,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:12,976 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 122526 transitions. [2019-12-27 18:56:12,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:56:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 122526 transitions. [2019-12-27 18:56:12,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 18:56:12,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:12,977 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:12,977 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:12,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:12,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1055229, now seen corresponding path program 1 times [2019-12-27 18:56:12,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:12,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119255193] [2019-12-27 18:56:12,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:13,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119255193] [2019-12-27 18:56:13,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171574057] [2019-12-27 18:56:13,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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:13,121 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 18:56:13,122 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:13,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:13,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 18:56:13,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [961439651] [2019-12-27 18:56:13,124 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:13,124 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:13,126 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 18:56:13,126 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:13,149 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:56:13,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:56:13,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:13,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:56:13,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:56:13,150 INFO L87 Difference]: Start difference. First operand 22883 states and 122526 transitions. Second operand 9 states. [2019-12-27 18:56:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:13,836 INFO L93 Difference]: Finished difference Result 58891 states and 273224 transitions. [2019-12-27 18:56:13,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:56:13,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 18:56:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:14,018 INFO L225 Difference]: With dead ends: 58891 [2019-12-27 18:56:14,018 INFO L226 Difference]: Without dead ends: 58886 [2019-12-27 18:56:14,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:56:14,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58886 states. [2019-12-27 18:56:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58886 to 22725. [2019-12-27 18:56:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-12-27 18:56:15,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 121545 transitions. [2019-12-27 18:56:15,010 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 121545 transitions. Word has length 15 [2019-12-27 18:56:15,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:15,011 INFO L462 AbstractCegarLoop]: Abstraction has 22725 states and 121545 transitions. [2019-12-27 18:56:15,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:56:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 121545 transitions. [2019-12-27 18:56:15,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 18:56:15,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:15,011 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:15,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:15,212 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:15,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:15,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1228456205, now seen corresponding path program 2 times [2019-12-27 18:56:15,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:15,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989230541] [2019-12-27 18:56:15,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:15,240 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-27 18:56:15,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989230541] [2019-12-27 18:56:15,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:56:15,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:56:15,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1525066568] [2019-12-27 18:56:15,242 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:15,243 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:15,244 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 18:56:15,244 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:15,245 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:56:15,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:56:15,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:15,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:56:15,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:56:15,245 INFO L87 Difference]: Start difference. First operand 22725 states and 121545 transitions. Second operand 7 states. [2019-12-27 18:56:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:15,734 INFO L93 Difference]: Finished difference Result 56062 states and 263636 transitions. [2019-12-27 18:56:15,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:56:15,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 18:56:15,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:15,905 INFO L225 Difference]: With dead ends: 56062 [2019-12-27 18:56:15,906 INFO L226 Difference]: Without dead ends: 56057 [2019-12-27 18:56:15,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:56:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56057 states. [2019-12-27 18:56:18,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56057 to 22254. [2019-12-27 18:56:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-27 18:56:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 118917 transitions. [2019-12-27 18:56:18,929 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 118917 transitions. Word has length 15 [2019-12-27 18:56:18,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:18,929 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 118917 transitions. [2019-12-27 18:56:18,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:56:18,929 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 118917 transitions. [2019-12-27 18:56:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 18:56:18,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:18,929 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:18,930 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:18,930 INFO L82 PathProgramCache]: Analyzing trace with hash 642107180, now seen corresponding path program 1 times [2019-12-27 18:56:18,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:18,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788728282] [2019-12-27 18:56:18,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:18,947 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-27 18:56:18,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788728282] [2019-12-27 18:56:18,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:56:18,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:56:18,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [102050932] [2019-12-27 18:56:18,949 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:18,950 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:18,952 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 18:56:18,952 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:18,952 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:56:18,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:56:18,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:18,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:56:18,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:56:18,953 INFO L87 Difference]: Start difference. First operand 22254 states and 118917 transitions. Second operand 5 states. [2019-12-27 18:56:19,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:19,256 INFO L93 Difference]: Finished difference Result 40360 states and 205156 transitions. [2019-12-27 18:56:19,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:56:19,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 18:56:19,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:19,391 INFO L225 Difference]: With dead ends: 40360 [2019-12-27 18:56:19,391 INFO L226 Difference]: Without dead ends: 40352 [2019-12-27 18:56:19,391 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-27 18:56:19,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40352 states. [2019-12-27 18:56:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40352 to 27169. [2019-12-27 18:56:20,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27169 states. [2019-12-27 18:56:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27169 states to 27169 states and 146914 transitions. [2019-12-27 18:56:20,248 INFO L78 Accepts]: Start accepts. Automaton has 27169 states and 146914 transitions. Word has length 17 [2019-12-27 18:56:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:20,249 INFO L462 AbstractCegarLoop]: Abstraction has 27169 states and 146914 transitions. [2019-12-27 18:56:20,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:56:20,249 INFO L276 IsEmpty]: Start isEmpty. Operand 27169 states and 146914 transitions. [2019-12-27 18:56:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:56:20,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:20,249 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:20,250 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:20,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:20,250 INFO L82 PathProgramCache]: Analyzing trace with hash -889938571, now seen corresponding path program 1 times [2019-12-27 18:56:20,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:20,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152247071] [2019-12-27 18:56:20,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 18:56:20,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152247071] [2019-12-27 18:56:20,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481165106] [2019-12-27 18:56:20,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:20,372 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 18:56:20,372 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 18:56:20,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:20,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 18:56:20,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [781144530] [2019-12-27 18:56:20,374 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:20,375 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:20,378 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 18:56:20,378 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:20,417 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:56:20,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:56:20,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:20,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:56:20,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:56:20,418 INFO L87 Difference]: Start difference. First operand 27169 states and 146914 transitions. Second operand 10 states. [2019-12-27 18:56:21,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:21,923 INFO L93 Difference]: Finished difference Result 69923 states and 329029 transitions. [2019-12-27 18:56:21,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:56:21,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-27 18:56:21,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:22,153 INFO L225 Difference]: With dead ends: 69923 [2019-12-27 18:56:22,153 INFO L226 Difference]: Without dead ends: 69914 [2019-12-27 18:56:22,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:56:22,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69914 states. [2019-12-27 18:56:23,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69914 to 27590. [2019-12-27 18:56:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 18:56:23,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 148998 transitions. [2019-12-27 18:56:23,306 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 148998 transitions. Word has length 19 [2019-12-27 18:56:23,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:23,306 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 148998 transitions. [2019-12-27 18:56:23,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:56:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 148998 transitions. [2019-12-27 18:56:23,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:56:23,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:23,307 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:23,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:23,510 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:23,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:23,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1410290715, now seen corresponding path program 2 times [2019-12-27 18:56:23,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:23,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241515602] [2019-12-27 18:56:23,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:23,539 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-27 18:56:23,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241515602] [2019-12-27 18:56:23,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:56:23,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:56:23,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [984264496] [2019-12-27 18:56:23,540 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:23,541 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:23,544 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 18:56:23,544 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:23,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:56:23,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:56:23,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:23,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:56:23,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:56:23,544 INFO L87 Difference]: Start difference. First operand 27590 states and 148998 transitions. Second operand 7 states. [2019-12-27 18:56:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:24,094 INFO L93 Difference]: Finished difference Result 66182 states and 316792 transitions. [2019-12-27 18:56:24,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:56:24,094 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 18:56:24,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:24,284 INFO L225 Difference]: With dead ends: 66182 [2019-12-27 18:56:24,284 INFO L226 Difference]: Without dead ends: 66173 [2019-12-27 18:56:24,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:56:24,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66173 states. [2019-12-27 18:56:25,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66173 to 27041. [2019-12-27 18:56:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27041 states. [2019-12-27 18:56:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27041 states to 27041 states and 146101 transitions. [2019-12-27 18:56:28,629 INFO L78 Accepts]: Start accepts. Automaton has 27041 states and 146101 transitions. Word has length 19 [2019-12-27 18:56:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:28,629 INFO L462 AbstractCegarLoop]: Abstraction has 27041 states and 146101 transitions. [2019-12-27 18:56:28,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:56:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 27041 states and 146101 transitions. [2019-12-27 18:56:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:56:28,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:28,630 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:28,630 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:28,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:28,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1410299922, now seen corresponding path program 1 times [2019-12-27 18:56:28,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:28,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264485161] [2019-12-27 18:56:28,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:28,658 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-27 18:56:28,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264485161] [2019-12-27 18:56:28,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:56:28,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:56:28,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [58949338] [2019-12-27 18:56:28,659 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:28,660 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:28,662 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 18:56:28,662 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:28,662 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:56:28,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:56:28,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:28,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:56:28,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:56:28,663 INFO L87 Difference]: Start difference. First operand 27041 states and 146101 transitions. Second operand 7 states. [2019-12-27 18:56:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:29,257 INFO L93 Difference]: Finished difference Result 66741 states and 319826 transitions. [2019-12-27 18:56:29,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:56:29,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 18:56:29,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:29,471 INFO L225 Difference]: With dead ends: 66741 [2019-12-27 18:56:29,471 INFO L226 Difference]: Without dead ends: 66732 [2019-12-27 18:56:29,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:56:29,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66732 states. [2019-12-27 18:56:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66732 to 27880. [2019-12-27 18:56:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27880 states. [2019-12-27 18:56:30,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27880 states to 27880 states and 150604 transitions. [2019-12-27 18:56:30,618 INFO L78 Accepts]: Start accepts. Automaton has 27880 states and 150604 transitions. Word has length 19 [2019-12-27 18:56:30,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:30,619 INFO L462 AbstractCegarLoop]: Abstraction has 27880 states and 150604 transitions. [2019-12-27 18:56:30,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:56:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 27880 states and 150604 transitions. [2019-12-27 18:56:30,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:56:30,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:30,620 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:30,620 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:30,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1433572242, now seen corresponding path program 2 times [2019-12-27 18:56:30,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:30,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132496189] [2019-12-27 18:56:30,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:30,647 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-27 18:56:30,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132496189] [2019-12-27 18:56:30,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:56:30,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:56:30,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [909745588] [2019-12-27 18:56:30,648 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:30,649 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:30,652 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 18:56:30,652 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:30,696 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:56:30,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:56:30,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:30,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:56:30,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:56:30,697 INFO L87 Difference]: Start difference. First operand 27880 states and 150604 transitions. Second operand 11 states. [2019-12-27 18:56:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:31,724 INFO L93 Difference]: Finished difference Result 76365 states and 356947 transitions. [2019-12-27 18:56:31,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 18:56:31,724 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-12-27 18:56:31,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:31,953 INFO L225 Difference]: With dead ends: 76365 [2019-12-27 18:56:31,953 INFO L226 Difference]: Without dead ends: 76352 [2019-12-27 18:56:31,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=272, Invalid=658, Unknown=0, NotChecked=0, Total=930 [2019-12-27 18:56:32,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76352 states. [2019-12-27 18:56:33,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76352 to 28053. [2019-12-27 18:56:33,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-12-27 18:56:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 151628 transitions. [2019-12-27 18:56:33,723 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 151628 transitions. Word has length 19 [2019-12-27 18:56:33,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:33,724 INFO L462 AbstractCegarLoop]: Abstraction has 28053 states and 151628 transitions. [2019-12-27 18:56:33,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:56:33,724 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 151628 transitions. [2019-12-27 18:56:33,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:56:33,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:33,725 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:33,725 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:33,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:33,726 INFO L82 PathProgramCache]: Analyzing trace with hash -532484105, now seen corresponding path program 1 times [2019-12-27 18:56:33,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:33,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719549686] [2019-12-27 18:56:33,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 18:56:33,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719549686] [2019-12-27 18:56:33,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626300118] [2019-12-27 18:56:33,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:33,877 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:56:33,878 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 18:56:33,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:33,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 18:56:33,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [891702563] [2019-12-27 18:56:33,880 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:33,881 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:33,885 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 18:56:33,885 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:33,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:56:33,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:56:33,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:33,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:56:33,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:56:33,942 INFO L87 Difference]: Start difference. First operand 28053 states and 151628 transitions. Second operand 12 states. [2019-12-27 18:56:35,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:35,451 INFO L93 Difference]: Finished difference Result 105784 states and 469658 transitions. [2019-12-27 18:56:35,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 18:56:35,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-27 18:56:35,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:35,750 INFO L225 Difference]: With dead ends: 105784 [2019-12-27 18:56:35,750 INFO L226 Difference]: Without dead ends: 105777 [2019-12-27 18:56:35,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=589, Invalid=1861, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 18:56:35,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105777 states. [2019-12-27 18:56:37,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105777 to 27701. [2019-12-27 18:56:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27701 states. [2019-12-27 18:56:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27701 states to 27701 states and 149579 transitions. [2019-12-27 18:56:37,746 INFO L78 Accepts]: Start accepts. Automaton has 27701 states and 149579 transitions. Word has length 21 [2019-12-27 18:56:37,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:37,746 INFO L462 AbstractCegarLoop]: Abstraction has 27701 states and 149579 transitions. [2019-12-27 18:56:37,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:56:37,746 INFO L276 IsEmpty]: Start isEmpty. Operand 27701 states and 149579 transitions. [2019-12-27 18:56:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:56:37,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:37,747 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:37,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:37,948 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:37,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:37,949 INFO L82 PathProgramCache]: Analyzing trace with hash -555756425, now seen corresponding path program 2 times [2019-12-27 18:56:37,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:37,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541574631] [2019-12-27 18:56:37,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 18:56:37,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541574631] [2019-12-27 18:56:37,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753776660] [2019-12-27 18:56:37,989 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:38,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:56:38,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:56:38,079 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:56:38,079 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 18:56:38,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:38,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 18:56:38,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1191819389] [2019-12-27 18:56:38,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:38,084 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:38,091 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 18:56:38,091 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:38,204 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:56:38,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 18:56:38,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:38,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 18:56:38,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:56:38,205 INFO L87 Difference]: Start difference. First operand 27701 states and 149579 transitions. Second operand 16 states. [2019-12-27 18:56:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:40,317 INFO L93 Difference]: Finished difference Result 108381 states and 476214 transitions. [2019-12-27 18:56:40,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 18:56:40,318 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 18:56:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:41,214 INFO L225 Difference]: With dead ends: 108381 [2019-12-27 18:56:41,215 INFO L226 Difference]: Without dead ends: 108372 [2019-12-27 18:56:41,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1129, Invalid=3701, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 18:56:41,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108372 states. [2019-12-27 18:56:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108372 to 27343. [2019-12-27 18:56:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-27 18:56:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 147510 transitions. [2019-12-27 18:56:42,653 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 147510 transitions. Word has length 21 [2019-12-27 18:56:42,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:42,654 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 147510 transitions. [2019-12-27 18:56:42,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 18:56:42,654 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 147510 transitions. [2019-12-27 18:56:42,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:56:42,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:42,655 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:42,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:42,856 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:42,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:42,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1079646913, now seen corresponding path program 1 times [2019-12-27 18:56:42,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:42,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518779370] [2019-12-27 18:56:42,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:42,877 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-27 18:56:42,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518779370] [2019-12-27 18:56:42,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:56:42,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:56:42,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [341164506] [2019-12-27 18:56:42,878 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:42,879 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:42,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 18:56:42,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:42,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:56:42,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:56:42,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:42,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:56:42,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:56:42,883 INFO L87 Difference]: Start difference. First operand 27343 states and 147510 transitions. Second operand 5 states. [2019-12-27 18:56:43,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:43,218 INFO L93 Difference]: Finished difference Result 49005 states and 252892 transitions. [2019-12-27 18:56:43,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:56:43,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 18:56:43,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:43,369 INFO L225 Difference]: With dead ends: 49005 [2019-12-27 18:56:43,369 INFO L226 Difference]: Without dead ends: 48989 [2019-12-27 18:56:43,369 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-27 18:56:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48989 states. [2019-12-27 18:56:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48989 to 34182. [2019-12-27 18:56:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34182 states. [2019-12-27 18:56:44,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34182 states to 34182 states and 185907 transitions. [2019-12-27 18:56:44,741 INFO L78 Accepts]: Start accepts. Automaton has 34182 states and 185907 transitions. Word has length 21 [2019-12-27 18:56:44,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:44,742 INFO L462 AbstractCegarLoop]: Abstraction has 34182 states and 185907 transitions. [2019-12-27 18:56:44,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:56:44,742 INFO L276 IsEmpty]: Start isEmpty. Operand 34182 states and 185907 transitions. [2019-12-27 18:56:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:56:44,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:44,743 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:44,743 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:44,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:44,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1920279143, now seen corresponding path program 3 times [2019-12-27 18:56:44,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:44,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019071079] [2019-12-27 18:56:44,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:44,792 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-27 18:56:44,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019071079] [2019-12-27 18:56:44,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:56:44,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:56:44,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1904986069] [2019-12-27 18:56:44,793 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:44,795 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:44,798 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 18:56:44,798 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:44,798 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:56:44,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:56:44,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:44,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:56:44,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:56:44,799 INFO L87 Difference]: Start difference. First operand 34182 states and 185907 transitions. Second operand 9 states. [2019-12-27 18:56:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:45,973 INFO L93 Difference]: Finished difference Result 112418 states and 516541 transitions. [2019-12-27 18:56:45,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:56:45,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 18:56:45,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:46,331 INFO L225 Difference]: With dead ends: 112418 [2019-12-27 18:56:46,331 INFO L226 Difference]: Without dead ends: 112411 [2019-12-27 18:56:46,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:56:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112411 states. [2019-12-27 18:56:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112411 to 33330. [2019-12-27 18:56:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33330 states. [2019-12-27 18:56:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33330 states to 33330 states and 181229 transitions. [2019-12-27 18:56:48,651 INFO L78 Accepts]: Start accepts. Automaton has 33330 states and 181229 transitions. Word has length 21 [2019-12-27 18:56:48,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:48,651 INFO L462 AbstractCegarLoop]: Abstraction has 33330 states and 181229 transitions. [2019-12-27 18:56:48,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:56:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 33330 states and 181229 transitions. [2019-12-27 18:56:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:56:48,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:48,653 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:48,653 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:48,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:48,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1911440423, now seen corresponding path program 4 times [2019-12-27 18:56:48,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:48,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694677094] [2019-12-27 18:56:48,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:48,701 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-27 18:56:48,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694677094] [2019-12-27 18:56:48,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:56:48,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:56:48,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [927404225] [2019-12-27 18:56:48,703 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:48,705 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:48,707 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 18:56:48,707 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:48,708 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:56:48,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:56:48,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:48,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:56:48,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:56:48,708 INFO L87 Difference]: Start difference. First operand 33330 states and 181229 transitions. Second operand 9 states. [2019-12-27 18:56:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:49,918 INFO L93 Difference]: Finished difference Result 111816 states and 513526 transitions. [2019-12-27 18:56:49,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:56:49,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 18:56:49,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:50,881 INFO L225 Difference]: With dead ends: 111816 [2019-12-27 18:56:50,881 INFO L226 Difference]: Without dead ends: 111807 [2019-12-27 18:56:50,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:56:51,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111807 states. [2019-12-27 18:56:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111807 to 32802. [2019-12-27 18:56:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32802 states. [2019-12-27 18:56:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32802 states to 32802 states and 178191 transitions. [2019-12-27 18:56:52,377 INFO L78 Accepts]: Start accepts. Automaton has 32802 states and 178191 transitions. Word has length 21 [2019-12-27 18:56:52,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:52,377 INFO L462 AbstractCegarLoop]: Abstraction has 32802 states and 178191 transitions. [2019-12-27 18:56:52,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:56:52,378 INFO L276 IsEmpty]: Start isEmpty. Operand 32802 states and 178191 transitions. [2019-12-27 18:56:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:56:52,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:52,379 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:52,379 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:56:52,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:52,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1021577383, now seen corresponding path program 5 times [2019-12-27 18:56:52,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:52,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140690368] [2019-12-27 18:56:52,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:52,427 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-27 18:56:52,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140690368] [2019-12-27 18:56:52,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:56:52,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:56:52,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [62701736] [2019-12-27 18:56:52,428 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:52,430 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:52,435 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 18:56:52,435 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:52,486 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:56:52,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:56:52,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:52,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:56:52,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:56:52,487 INFO L87 Difference]: Start difference. First operand 32802 states and 178191 transitions. Second operand 13 states. [2019-12-27 18:56:54,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:54,940 INFO L93 Difference]: Finished difference Result 127187 states and 567692 transitions. [2019-12-27 18:56:54,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 18:56:54,940 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-12-27 18:56:54,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:55,307 INFO L225 Difference]: With dead ends: 127187 [2019-12-27 18:56:55,307 INFO L226 Difference]: Without dead ends: 127174 [2019-12-27 18:56:55,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1648 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1047, Invalid=3783, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 18:56:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127174 states. [2019-12-27 18:56:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127174 to 31950. [2019-12-27 18:56:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31950 states. [2019-12-27 18:57:00,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31950 states to 31950 states and 173513 transitions. [2019-12-27 18:57:00,107 INFO L78 Accepts]: Start accepts. Automaton has 31950 states and 173513 transitions. Word has length 21 [2019-12-27 18:57:00,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:00,107 INFO L462 AbstractCegarLoop]: Abstraction has 31950 states and 173513 transitions. [2019-12-27 18:57:00,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:57:00,108 INFO L276 IsEmpty]: Start isEmpty. Operand 31950 states and 173513 transitions. [2019-12-27 18:57:00,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:57:00,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:00,109 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:57:00,109 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:00,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:00,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1007143783, now seen corresponding path program 6 times [2019-12-27 18:57:00,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:00,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349894247] [2019-12-27 18:57:00,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:00,161 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-27 18:57:00,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349894247] [2019-12-27 18:57:00,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:57:00,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:57:00,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [37148646] [2019-12-27 18:57:00,162 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:00,165 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:00,169 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 18:57:00,169 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:00,291 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:57:00,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:57:00,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:00,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:57:00,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:57:00,293 INFO L87 Difference]: Start difference. First operand 31950 states and 173513 transitions. Second operand 17 states. [2019-12-27 18:57:03,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:03,141 INFO L93 Difference]: Finished difference Result 131458 states and 578305 transitions. [2019-12-27 18:57:03,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 18:57:03,141 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-12-27 18:57:03,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:03,517 INFO L225 Difference]: With dead ends: 131458 [2019-12-27 18:57:03,517 INFO L226 Difference]: Without dead ends: 131442 [2019-12-27 18:57:03,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3232 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1937, Invalid=6993, Unknown=0, NotChecked=0, Total=8930 [2019-12-27 18:57:04,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131442 states. [2019-12-27 18:57:05,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131442 to 30899. [2019-12-27 18:57:05,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30899 states. [2019-12-27 18:57:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30899 states to 30899 states and 167948 transitions. [2019-12-27 18:57:05,819 INFO L78 Accepts]: Start accepts. Automaton has 30899 states and 167948 transitions. Word has length 21 [2019-12-27 18:57:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:05,819 INFO L462 AbstractCegarLoop]: Abstraction has 30899 states and 167948 transitions. [2019-12-27 18:57:05,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:57:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 30899 states and 167948 transitions. [2019-12-27 18:57:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:57:05,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:05,821 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:57:05,821 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:05,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:05,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1454131756, now seen corresponding path program 1 times [2019-12-27 18:57:05,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:05,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28441107] [2019-12-27 18:57:05,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:57:05,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28441107] [2019-12-27 18:57:05,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636754226] [2019-12-27 18:57:05,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:05,943 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 18:57:05,944 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:05,945 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:57:05,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:05,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 18:57:05,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1741050942] [2019-12-27 18:57:05,946 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:05,947 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:05,952 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 18:57:05,952 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:06,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:57:06,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:57:06,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:06,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:57:06,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:57:06,024 INFO L87 Difference]: Start difference. First operand 30899 states and 167948 transitions. Second operand 11 states. [2019-12-27 18:57:07,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:07,541 INFO L93 Difference]: Finished difference Result 79677 states and 379896 transitions. [2019-12-27 18:57:07,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:57:07,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-27 18:57:07,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:07,794 INFO L225 Difference]: With dead ends: 79677 [2019-12-27 18:57:07,794 INFO L226 Difference]: Without dead ends: 79658 [2019-12-27 18:57:07,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2019-12-27 18:57:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79658 states. [2019-12-27 18:57:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79658 to 31876. [2019-12-27 18:57:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31876 states. [2019-12-27 18:57:09,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31876 states to 31876 states and 173008 transitions. [2019-12-27 18:57:09,020 INFO L78 Accepts]: Start accepts. Automaton has 31876 states and 173008 transitions. Word has length 23 [2019-12-27 18:57:09,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:09,021 INFO L462 AbstractCegarLoop]: Abstraction has 31876 states and 173008 transitions. [2019-12-27 18:57:09,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:57:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 31876 states and 173008 transitions. [2019-12-27 18:57:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:57:09,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:09,022 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:57:09,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:09,223 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:09,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:09,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1927215539, now seen corresponding path program 1 times [2019-12-27 18:57:09,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:09,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363877239] [2019-12-27 18:57:09,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:57:09,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363877239] [2019-12-27 18:57:09,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90604504] [2019-12-27 18:57:09,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:09,341 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 18:57:09,342 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:57:09,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:09,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 18:57:09,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [419302413] [2019-12-27 18:57:09,344 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:09,346 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:09,350 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 39 transitions. [2019-12-27 18:57:09,351 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:09,351 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:57:09,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:57:09,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:09,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:57:09,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:57:09,352 INFO L87 Difference]: Start difference. First operand 31876 states and 173008 transitions. Second operand 7 states. [2019-12-27 18:57:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:09,982 INFO L93 Difference]: Finished difference Result 77025 states and 375206 transitions. [2019-12-27 18:57:09,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:57:09,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 18:57:09,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:10,734 INFO L225 Difference]: With dead ends: 77025 [2019-12-27 18:57:10,734 INFO L226 Difference]: Without dead ends: 77011 [2019-12-27 18:57:10,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:57:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77011 states. [2019-12-27 18:57:11,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77011 to 32844. [2019-12-27 18:57:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32844 states. [2019-12-27 18:57:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32844 states to 32844 states and 178253 transitions. [2019-12-27 18:57:11,858 INFO L78 Accepts]: Start accepts. Automaton has 32844 states and 178253 transitions. Word has length 23 [2019-12-27 18:57:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:11,858 INFO L462 AbstractCegarLoop]: Abstraction has 32844 states and 178253 transitions. [2019-12-27 18:57:11,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:57:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 32844 states and 178253 transitions. [2019-12-27 18:57:11,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:57:11,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:11,860 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:57:12,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:12,061 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:12,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:12,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1841387275, now seen corresponding path program 2 times [2019-12-27 18:57:12,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:12,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110317238] [2019-12-27 18:57:12,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:12,096 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-27 18:57:12,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110317238] [2019-12-27 18:57:12,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:57:12,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:57:12,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1139484150] [2019-12-27 18:57:12,096 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:12,098 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:12,100 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 18:57:12,101 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:12,101 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:57:12,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:57:12,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:12,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:57:12,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:57:12,101 INFO L87 Difference]: Start difference. First operand 32844 states and 178253 transitions. Second operand 7 states. [2019-12-27 18:57:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:12,725 INFO L93 Difference]: Finished difference Result 78384 states and 382183 transitions. [2019-12-27 18:57:12,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:57:12,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 18:57:12,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:12,967 INFO L225 Difference]: With dead ends: 78384 [2019-12-27 18:57:12,967 INFO L226 Difference]: Without dead ends: 78365 [2019-12-27 18:57:12,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:57:13,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78365 states. [2019-12-27 18:57:14,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78365 to 33117. [2019-12-27 18:57:14,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33117 states. [2019-12-27 18:57:14,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33117 states to 33117 states and 179680 transitions. [2019-12-27 18:57:14,719 INFO L78 Accepts]: Start accepts. Automaton has 33117 states and 179680 transitions. Word has length 23 [2019-12-27 18:57:14,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:14,720 INFO L462 AbstractCegarLoop]: Abstraction has 33117 states and 179680 transitions. [2019-12-27 18:57:14,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:57:14,720 INFO L276 IsEmpty]: Start isEmpty. Operand 33117 states and 179680 transitions. [2019-12-27 18:57:14,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:57:14,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:14,723 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:57:14,723 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:14,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:14,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1841402310, now seen corresponding path program 2 times [2019-12-27 18:57:14,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:14,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958413139] [2019-12-27 18:57:14,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:14,757 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-27 18:57:14,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958413139] [2019-12-27 18:57:14,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:57:14,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:57:14,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1532470095] [2019-12-27 18:57:14,758 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:14,760 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:14,763 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 18:57:14,763 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:14,764 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:57:14,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:57:14,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:14,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:57:14,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:57:14,764 INFO L87 Difference]: Start difference. First operand 33117 states and 179680 transitions. Second operand 7 states. [2019-12-27 18:57:15,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:15,414 INFO L93 Difference]: Finished difference Result 78506 states and 382218 transitions. [2019-12-27 18:57:15,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:57:15,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 18:57:15,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:15,654 INFO L225 Difference]: With dead ends: 78506 [2019-12-27 18:57:15,654 INFO L226 Difference]: Without dead ends: 78487 [2019-12-27 18:57:15,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:57:15,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78487 states. [2019-12-27 18:57:17,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78487 to 33426. [2019-12-27 18:57:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33426 states. [2019-12-27 18:57:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33426 states to 33426 states and 181402 transitions. [2019-12-27 18:57:17,431 INFO L78 Accepts]: Start accepts. Automaton has 33426 states and 181402 transitions. Word has length 23 [2019-12-27 18:57:17,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:17,431 INFO L462 AbstractCegarLoop]: Abstraction has 33426 states and 181402 transitions. [2019-12-27 18:57:17,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:57:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 33426 states and 181402 transitions. [2019-12-27 18:57:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:57:17,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:17,433 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:57:17,434 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:17,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:17,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1841411517, now seen corresponding path program 1 times [2019-12-27 18:57:17,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:17,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427434577] [2019-12-27 18:57:17,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:17,468 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-27 18:57:17,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427434577] [2019-12-27 18:57:17,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:57:17,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:57:17,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1049012719] [2019-12-27 18:57:17,469 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:17,472 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:17,475 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 18:57:17,475 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:17,475 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:57:17,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:57:17,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:17,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:57:17,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:57:17,476 INFO L87 Difference]: Start difference. First operand 33426 states and 181402 transitions. Second operand 7 states. [2019-12-27 18:57:18,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:18,094 INFO L93 Difference]: Finished difference Result 80886 states and 394638 transitions. [2019-12-27 18:57:18,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:57:18,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 18:57:18,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:18,349 INFO L225 Difference]: With dead ends: 80886 [2019-12-27 18:57:18,349 INFO L226 Difference]: Without dead ends: 80867 [2019-12-27 18:57:18,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:57:18,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80867 states. [2019-12-27 18:57:20,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80867 to 35111. [2019-12-27 18:57:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35111 states. [2019-12-27 18:57:20,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35111 states to 35111 states and 190468 transitions. [2019-12-27 18:57:20,403 INFO L78 Accepts]: Start accepts. Automaton has 35111 states and 190468 transitions. Word has length 23 [2019-12-27 18:57:20,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:20,403 INFO L462 AbstractCegarLoop]: Abstraction has 35111 states and 190468 transitions. [2019-12-27 18:57:20,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:57:20,404 INFO L276 IsEmpty]: Start isEmpty. Operand 35111 states and 190468 transitions. [2019-12-27 18:57:20,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:57:20,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:20,406 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:57:20,406 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:20,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:20,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1840221117, now seen corresponding path program 2 times [2019-12-27 18:57:20,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:20,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483742737] [2019-12-27 18:57:20,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:20,453 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-27 18:57:20,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483742737] [2019-12-27 18:57:20,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:57:20,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:57:20,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2103117078] [2019-12-27 18:57:20,454 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:20,457 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:20,464 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 55 transitions. [2019-12-27 18:57:20,465 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:20,585 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:57:20,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:57:20,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:20,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:57:20,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:57:20,586 INFO L87 Difference]: Start difference. First operand 35111 states and 190468 transitions. Second operand 13 states. [2019-12-27 18:57:21,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:21,692 INFO L93 Difference]: Finished difference Result 93460 states and 441982 transitions. [2019-12-27 18:57:21,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 18:57:21,693 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-12-27 18:57:21,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:21,992 INFO L225 Difference]: With dead ends: 93460 [2019-12-27 18:57:21,992 INFO L226 Difference]: Without dead ends: 93431 [2019-12-27 18:57:21,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=314, Invalid=742, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 18:57:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93431 states. [2019-12-27 18:57:23,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93431 to 35912. [2019-12-27 18:57:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35912 states. [2019-12-27 18:57:26,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 195109 transitions. [2019-12-27 18:57:26,755 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 195109 transitions. Word has length 23 [2019-12-27 18:57:26,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:26,756 INFO L462 AbstractCegarLoop]: Abstraction has 35912 states and 195109 transitions. [2019-12-27 18:57:26,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:57:26,756 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 195109 transitions. [2019-12-27 18:57:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:26,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:26,759 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:57:26,759 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:26,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:26,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1580724000, now seen corresponding path program 1 times [2019-12-27 18:57:26,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:26,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338967155] [2019-12-27 18:57:26,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:57:26,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338967155] [2019-12-27 18:57:26,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992893819] [2019-12-27 18:57:26,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:26,899 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:57:26,899 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:57:26,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:26,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 18:57:26,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1223227782] [2019-12-27 18:57:26,902 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:26,903 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:26,910 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 18:57:26,910 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:27,035 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 18:57:27,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:57:27,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:27,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:57:27,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:57:27,036 INFO L87 Difference]: Start difference. First operand 35912 states and 195109 transitions. Second operand 17 states. [2019-12-27 18:57:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:29,231 INFO L93 Difference]: Finished difference Result 135566 states and 606990 transitions. [2019-12-27 18:57:29,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 18:57:29,232 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-12-27 18:57:29,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:29,618 INFO L225 Difference]: With dead ends: 135566 [2019-12-27 18:57:29,618 INFO L226 Difference]: Without dead ends: 135548 [2019-12-27 18:57:29,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1169, Invalid=3801, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 18:57:29,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135548 states. [2019-12-27 18:57:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135548 to 35598. [2019-12-27 18:57:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35598 states. [2019-12-27 18:57:32,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35598 states to 35598 states and 193118 transitions. [2019-12-27 18:57:32,056 INFO L78 Accepts]: Start accepts. Automaton has 35598 states and 193118 transitions. Word has length 25 [2019-12-27 18:57:32,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:32,057 INFO L462 AbstractCegarLoop]: Abstraction has 35598 states and 193118 transitions. [2019-12-27 18:57:32,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:57:32,057 INFO L276 IsEmpty]: Start isEmpty. Operand 35598 states and 193118 transitions. [2019-12-27 18:57:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:32,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:32,060 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:57:32,260 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:32,261 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:32,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:32,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1556261280, now seen corresponding path program 2 times [2019-12-27 18:57:32,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:32,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268913576] [2019-12-27 18:57:32,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:57:32,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268913576] [2019-12-27 18:57:32,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515615209] [2019-12-27 18:57:32,304 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:32,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:57:32,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:57:32,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:57:32,400 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:57:32,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:32,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 18:57:32,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [123060191] [2019-12-27 18:57:32,403 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:32,405 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:32,414 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 18:57:32,415 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:32,500 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:57:32,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:57:32,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:32,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:57:32,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:57:32,501 INFO L87 Difference]: Start difference. First operand 35598 states and 193118 transitions. Second operand 13 states. [2019-12-27 18:57:35,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:35,187 INFO L93 Difference]: Finished difference Result 129234 states and 584373 transitions. [2019-12-27 18:57:35,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 18:57:35,187 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 18:57:35,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:35,579 INFO L225 Difference]: With dead ends: 129234 [2019-12-27 18:57:35,579 INFO L226 Difference]: Without dead ends: 129215 [2019-12-27 18:57:35,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=622, Invalid=1928, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 18:57:35,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129215 states. [2019-12-27 18:57:37,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129215 to 35531. [2019-12-27 18:57:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-27 18:57:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 192612 transitions. [2019-12-27 18:57:37,396 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 192612 transitions. Word has length 25 [2019-12-27 18:57:37,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:37,396 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 192612 transitions. [2019-12-27 18:57:37,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:57:37,396 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 192612 transitions. [2019-12-27 18:57:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:37,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:37,400 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:57:37,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:37,602 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:37,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:37,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1556237038, now seen corresponding path program 1 times [2019-12-27 18:57:37,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:37,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56972513] [2019-12-27 18:57:37,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:57:37,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56972513] [2019-12-27 18:57:37,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937345925] [2019-12-27 18:57:37,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:37,735 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:57:37,736 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:57:37,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:37,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 18:57:37,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [143434473] [2019-12-27 18:57:37,738 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:37,739 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:37,746 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 18:57:37,746 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:37,828 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:57:37,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:57:37,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:37,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:57:37,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:57:37,830 INFO L87 Difference]: Start difference. First operand 35531 states and 192612 transitions. Second operand 13 states. [2019-12-27 18:57:38,181 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-12-27 18:57:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:39,860 INFO L93 Difference]: Finished difference Result 128198 states and 579481 transitions. [2019-12-27 18:57:39,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 18:57:39,860 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 18:57:39,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:40,239 INFO L225 Difference]: With dead ends: 128198 [2019-12-27 18:57:40,239 INFO L226 Difference]: Without dead ends: 128180 [2019-12-27 18:57:40,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=622, Invalid=1928, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 18:57:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128180 states. [2019-12-27 18:57:44,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128180 to 35223. [2019-12-27 18:57:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35223 states. [2019-12-27 18:57:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35223 states to 35223 states and 190755 transitions. [2019-12-27 18:57:45,096 INFO L78 Accepts]: Start accepts. Automaton has 35223 states and 190755 transitions. Word has length 25 [2019-12-27 18:57:45,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:45,096 INFO L462 AbstractCegarLoop]: Abstraction has 35223 states and 190755 transitions. [2019-12-27 18:57:45,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:57:45,096 INFO L276 IsEmpty]: Start isEmpty. Operand 35223 states and 190755 transitions. [2019-12-27 18:57:45,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:45,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:45,099 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:57:45,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:45,300 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:45,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:45,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1557427438, now seen corresponding path program 2 times [2019-12-27 18:57:45,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:45,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868484423] [2019-12-27 18:57:45,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:57:45,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868484423] [2019-12-27 18:57:45,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092068462] [2019-12-27 18:57:45,347 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:45,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:57:45,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:57:45,440 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:57:45,441 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:57:45,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:45,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 18:57:45,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1763182766] [2019-12-27 18:57:45,444 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:45,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:45,453 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 18:57:45,454 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:45,653 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 18:57:45,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 18:57:45,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:45,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 18:57:45,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:57:45,655 INFO L87 Difference]: Start difference. First operand 35223 states and 190755 transitions. Second operand 19 states. [2019-12-27 18:57:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:48,335 INFO L93 Difference]: Finished difference Result 132194 states and 590498 transitions. [2019-12-27 18:57:48,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 18:57:48,336 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-12-27 18:57:48,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:48,723 INFO L225 Difference]: With dead ends: 132194 [2019-12-27 18:57:48,723 INFO L226 Difference]: Without dead ends: 132175 [2019-12-27 18:57:48,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1456 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1271, Invalid=3985, Unknown=0, NotChecked=0, Total=5256 [2019-12-27 18:57:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132175 states. [2019-12-27 18:57:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132175 to 34934. [2019-12-27 18:57:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34934 states. [2019-12-27 18:57:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34934 states to 34934 states and 189032 transitions. [2019-12-27 18:57:51,124 INFO L78 Accepts]: Start accepts. Automaton has 34934 states and 189032 transitions. Word has length 25 [2019-12-27 18:57:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:51,124 INFO L462 AbstractCegarLoop]: Abstraction has 34934 states and 189032 transitions. [2019-12-27 18:57:51,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 18:57:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 34934 states and 189032 transitions. [2019-12-27 18:57:51,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:51,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:51,127 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:57:51,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:51,328 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:51,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:51,328 INFO L82 PathProgramCache]: Analyzing trace with hash 249951642, now seen corresponding path program 3 times [2019-12-27 18:57:51,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:51,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984317097] [2019-12-27 18:57:51,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:57:51,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984317097] [2019-12-27 18:57:51,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169175644] [2019-12-27 18:57:51,376 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:51,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 18:57:51,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:57:51,508 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:57:51,509 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:57:51,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:51,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 18:57:51,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [799840847] [2019-12-27 18:57:51,515 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:51,517 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:51,528 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 18:57:51,528 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:51,564 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:57:51,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:57:51,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:51,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:57:51,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:57:51,566 INFO L87 Difference]: Start difference. First operand 34934 states and 189032 transitions. Second operand 11 states. [2019-12-27 18:57:53,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:53,752 INFO L93 Difference]: Finished difference Result 126084 states and 571437 transitions. [2019-12-27 18:57:53,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 18:57:53,752 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-27 18:57:53,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:54,130 INFO L225 Difference]: With dead ends: 126084 [2019-12-27 18:57:54,130 INFO L226 Difference]: Without dead ends: 126070 [2019-12-27 18:57:54,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=494, Invalid=1486, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 18:57:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126070 states. [2019-12-27 18:57:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126070 to 34396. [2019-12-27 18:57:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34396 states. [2019-12-27 18:57:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34396 states to 34396 states and 186070 transitions. [2019-12-27 18:57:55,907 INFO L78 Accepts]: Start accepts. Automaton has 34396 states and 186070 transitions. Word has length 25 [2019-12-27 18:57:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:55,907 INFO L462 AbstractCegarLoop]: Abstraction has 34396 states and 186070 transitions. [2019-12-27 18:57:55,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:57:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 34396 states and 186070 transitions. [2019-12-27 18:57:55,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:55,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:55,910 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:57:56,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:56,111 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:57:56,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:56,112 INFO L82 PathProgramCache]: Analyzing trace with hash -923228474, now seen corresponding path program 4 times [2019-12-27 18:57:56,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:56,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739282118] [2019-12-27 18:57:56,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:57:56,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739282118] [2019-12-27 18:57:56,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896606764] [2019-12-27 18:57:56,156 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:56,491 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 18:57:56,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:57:56,492 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:57:56,492 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:57:56,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:56,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 18:57:56,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [704050962] [2019-12-27 18:57:56,495 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:56,497 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:56,503 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 18:57:56,503 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:56,504 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:57:56,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:57:56,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:56,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:57:56,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:57:56,505 INFO L87 Difference]: Start difference. First operand 34396 states and 186070 transitions. Second operand 9 states. [2019-12-27 18:57:57,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:57,679 INFO L93 Difference]: Finished difference Result 117673 states and 542950 transitions. [2019-12-27 18:57:57,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:57:57,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 18:57:57,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:58,024 INFO L225 Difference]: With dead ends: 117673 [2019-12-27 18:57:58,024 INFO L226 Difference]: Without dead ends: 117662 [2019-12-27 18:57:58,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:57:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117662 states. [2019-12-27 18:58:02,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117662 to 34329. [2019-12-27 18:58:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34329 states. [2019-12-27 18:58:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34329 states to 34329 states and 185564 transitions. [2019-12-27 18:58:02,852 INFO L78 Accepts]: Start accepts. Automaton has 34329 states and 185564 transitions. Word has length 25 [2019-12-27 18:58:02,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:02,852 INFO L462 AbstractCegarLoop]: Abstraction has 34329 states and 185564 transitions. [2019-12-27 18:58:02,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:58:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 34329 states and 185564 transitions. [2019-12-27 18:58:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:58:02,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:02,855 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:03,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:03,056 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:03,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:03,056 INFO L82 PathProgramCache]: Analyzing trace with hash -923237681, now seen corresponding path program 1 times [2019-12-27 18:58:03,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:03,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366043941] [2019-12-27 18:58:03,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:58:03,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366043941] [2019-12-27 18:58:03,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481153363] [2019-12-27 18:58:03,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:03,190 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:58:03,191 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:58:03,193 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:58:03,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:58:03,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 18:58:03,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2015136550] [2019-12-27 18:58:03,193 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:03,195 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:03,202 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 18:58:03,202 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:03,202 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:58:03,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:58:03,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:03,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:58:03,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:58:03,203 INFO L87 Difference]: Start difference. First operand 34329 states and 185564 transitions. Second operand 9 states. [2019-12-27 18:58:04,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:04,361 INFO L93 Difference]: Finished difference Result 117232 states and 541547 transitions. [2019-12-27 18:58:04,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:58:04,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 18:58:04,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:04,714 INFO L225 Difference]: With dead ends: 117232 [2019-12-27 18:58:04,714 INFO L226 Difference]: Without dead ends: 117222 [2019-12-27 18:58:04,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:58:04,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117222 states. [2019-12-27 18:58:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117222 to 34129. [2019-12-27 18:58:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34129 states. [2019-12-27 18:58:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34129 states to 34129 states and 184355 transitions. [2019-12-27 18:58:06,981 INFO L78 Accepts]: Start accepts. Automaton has 34129 states and 184355 transitions. Word has length 25 [2019-12-27 18:58:06,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:06,981 INFO L462 AbstractCegarLoop]: Abstraction has 34129 states and 184355 transitions. [2019-12-27 18:58:06,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:58:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 34129 states and 184355 transitions. [2019-12-27 18:58:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:58:06,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:06,984 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:07,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:07,185 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:07,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:07,185 INFO L82 PathProgramCache]: Analyzing trace with hash -922047281, now seen corresponding path program 2 times [2019-12-27 18:58:07,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:07,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933589490] [2019-12-27 18:58:07,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:58:07,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933589490] [2019-12-27 18:58:07,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2832299] [2019-12-27 18:58:07,228 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:07,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:58:07,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:58:07,319 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 18:58:07,320 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:58:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 18:58:07,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:58:07,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 18:58:07,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1331826082] [2019-12-27 18:58:07,322 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:07,323 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:07,328 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 18:58:07,328 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:07,381 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:58:07,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:58:07,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:07,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:58:07,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:58:07,383 INFO L87 Difference]: Start difference. First operand 34129 states and 184355 transitions. Second operand 13 states. [2019-12-27 18:58:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:09,374 INFO L93 Difference]: Finished difference Result 130450 states and 586382 transitions. [2019-12-27 18:58:09,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 18:58:09,374 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 18:58:09,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:09,760 INFO L225 Difference]: With dead ends: 130450 [2019-12-27 18:58:09,760 INFO L226 Difference]: Without dead ends: 130431 [2019-12-27 18:58:09,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=921, Invalid=3111, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 18:58:10,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130431 states. [2019-12-27 18:58:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130431 to 33768. [2019-12-27 18:58:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33768 states. [2019-12-27 18:58:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33768 states to 33768 states and 182277 transitions. [2019-12-27 18:58:12,256 INFO L78 Accepts]: Start accepts. Automaton has 33768 states and 182277 transitions. Word has length 25 [2019-12-27 18:58:12,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:12,256 INFO L462 AbstractCegarLoop]: Abstraction has 33768 states and 182277 transitions. [2019-12-27 18:58:12,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:58:12,256 INFO L276 IsEmpty]: Start isEmpty. Operand 33768 states and 182277 transitions. [2019-12-27 18:58:12,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:58:12,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:12,259 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:12,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:12,462 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:12,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:12,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1156631685, now seen corresponding path program 1 times [2019-12-27 18:58:12,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:12,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023855233] [2019-12-27 18:58:12,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-27 18:58:12,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023855233] [2019-12-27 18:58:12,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:12,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:58:12,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [501989935] [2019-12-27 18:58:12,482 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:12,484 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:12,487 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:58:12,487 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:12,487 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:58:12,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:58:12,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:12,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:58:12,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:58:12,488 INFO L87 Difference]: Start difference. First operand 33768 states and 182277 transitions. Second operand 5 states. [2019-12-27 18:58:12,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:12,884 INFO L93 Difference]: Finished difference Result 59584 states and 309872 transitions. [2019-12-27 18:58:12,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:58:12,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 18:58:12,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:13,079 INFO L225 Difference]: With dead ends: 59584 [2019-12-27 18:58:13,079 INFO L226 Difference]: Without dead ends: 59552 [2019-12-27 18:58:13,079 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-27 18:58:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59552 states. [2019-12-27 18:58:14,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59552 to 42643. [2019-12-27 18:58:14,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42643 states. [2019-12-27 18:58:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42643 states to 42643 states and 231050 transitions. [2019-12-27 18:58:14,710 INFO L78 Accepts]: Start accepts. Automaton has 42643 states and 231050 transitions. Word has length 25 [2019-12-27 18:58:14,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:14,710 INFO L462 AbstractCegarLoop]: Abstraction has 42643 states and 231050 transitions. [2019-12-27 18:58:14,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:58:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 42643 states and 231050 transitions. [2019-12-27 18:58:14,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:58:14,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:14,713 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:14,713 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:14,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:14,713 INFO L82 PathProgramCache]: Analyzing trace with hash -46645394, now seen corresponding path program 5 times [2019-12-27 18:58:14,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:14,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844163425] [2019-12-27 18:58:14,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:14,773 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-27 18:58:14,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844163425] [2019-12-27 18:58:14,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:14,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:58:14,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [99758851] [2019-12-27 18:58:14,773 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:14,776 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:14,781 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:58:14,781 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:14,781 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:58:14,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:58:14,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:14,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:58:14,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:58:14,782 INFO L87 Difference]: Start difference. First operand 42643 states and 231050 transitions. Second operand 9 states. [2019-12-27 18:58:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:16,077 INFO L93 Difference]: Finished difference Result 137478 states and 644727 transitions. [2019-12-27 18:58:16,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:58:16,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 18:58:16,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:16,485 INFO L225 Difference]: With dead ends: 137478 [2019-12-27 18:58:16,485 INFO L226 Difference]: Without dead ends: 137462 [2019-12-27 18:58:16,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:58:17,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137462 states. [2019-12-27 18:58:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137462 to 41717. [2019-12-27 18:58:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41717 states. [2019-12-27 18:58:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41717 states to 41717 states and 225875 transitions. [2019-12-27 18:58:19,208 INFO L78 Accepts]: Start accepts. Automaton has 41717 states and 225875 transitions. Word has length 25 [2019-12-27 18:58:19,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:19,209 INFO L462 AbstractCegarLoop]: Abstraction has 41717 states and 225875 transitions. [2019-12-27 18:58:19,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:58:19,209 INFO L276 IsEmpty]: Start isEmpty. Operand 41717 states and 225875 transitions. [2019-12-27 18:58:19,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:58:19,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:19,211 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:19,212 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:58:19,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:19,212 INFO L82 PathProgramCache]: Analyzing trace with hash -46654601, now seen corresponding path program 3 times [2019-12-27 18:58:19,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:19,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261390149] [2019-12-27 18:58:19,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:19,262 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-27 18:58:19,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261390149] [2019-12-27 18:58:19,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:19,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:58:19,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1842780149] [2019-12-27 18:58:19,263 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:19,267 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:19,272 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:58:19,272 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:19,272 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:58:19,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:58:19,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:19,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:58:19,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:58:19,273 INFO L87 Difference]: Start difference. First operand 41717 states and 225875 transitions. Second operand 9 states. [2019-12-27 18:58:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:21,232 INFO L93 Difference]: Finished difference Result 136774 states and 641773 transitions. [2019-12-27 18:58:21,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:58:21,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 18:58:21,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:21,660 INFO L225 Difference]: With dead ends: 136774 [2019-12-27 18:58:21,660 INFO L226 Difference]: Without dead ends: 136758 [2019-12-27 18:58:21,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:58:21,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136758 states. Received shutdown request... [2019-12-27 18:58:27,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136758 to 41129. [2019-12-27 18:58:27,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41129 states. [2019-12-27 18:58:27,463 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 18:58:27,467 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 18:58:27,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:58:27 BasicIcfg [2019-12-27 18:58:27,467 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:58:27,469 INFO L168 Benchmark]: Toolchain (without parser) took 230764.77 ms. Allocated memory was 147.3 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 102.5 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-27 18:58:27,469 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 147.3 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 18:58:27,469 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.11 ms. Allocated memory was 147.3 MB in the beginning and 205.5 MB in the end (delta: 58.2 MB). Free memory was 102.3 MB in the beginning and 164.9 MB in the end (delta: -62.6 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:58:27,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.17 ms. Allocated memory is still 205.5 MB. Free memory was 164.9 MB in the beginning and 162.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:58:27,470 INFO L168 Benchmark]: Boogie Preprocessor took 27.28 ms. Allocated memory is still 205.5 MB. Free memory was 162.4 MB in the beginning and 161.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:58:27,470 INFO L168 Benchmark]: RCFGBuilder took 432.39 ms. Allocated memory is still 205.5 MB. Free memory was 161.1 MB in the beginning and 142.4 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:58:27,470 INFO L168 Benchmark]: TraceAbstraction took 229518.70 ms. Allocated memory was 205.5 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 141.7 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-27 18:58:27,472 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.18 ms. Allocated memory is still 147.3 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 711.11 ms. Allocated memory was 147.3 MB in the beginning and 205.5 MB in the end (delta: 58.2 MB). Free memory was 102.3 MB in the beginning and 164.9 MB in the end (delta: -62.6 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.17 ms. Allocated memory is still 205.5 MB. Free memory was 164.9 MB in the beginning and 162.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.28 ms. Allocated memory is still 205.5 MB. Free memory was 162.4 MB in the beginning and 161.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 432.39 ms. Allocated memory is still 205.5 MB. Free memory was 161.1 MB in the beginning and 142.4 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 229518.70 ms. Allocated memory was 205.5 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 141.7 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 55 ProgramPointsBefore, 15 ProgramPointsAfterwards, 51 TransitionsBefore, 12 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 5 FixpointIterations, 13 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 366 VarBasedMoverChecksPositive, 5 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 5 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 524 CheckedPairsTotal, 42 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 76 ProgramPointsBefore, 26 ProgramPointsAfterwards, 69 TransitionsBefore, 21 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 6 FixpointIterations, 22 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 615 VarBasedMoverChecksPositive, 15 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 17 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 1164 CheckedPairsTotal, 55 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 97 ProgramPointsBefore, 34 ProgramPointsAfterwards, 87 TransitionsBefore, 27 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 4 ChoiceCompositions, 786 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 15 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1613 CheckedPairsTotal, 72 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 118 ProgramPointsBefore, 42 ProgramPointsAfterwards, 105 TransitionsBefore, 33 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 6 FixpointIterations, 45 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 3 ConcurrentYvCompositions, 5 ChoiceCompositions, 1107 VarBasedMoverChecksPositive, 24 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 26 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 2358 CheckedPairsTotal, 87 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.1s, 139 ProgramPointsBefore, 50 ProgramPointsAfterwards, 123 TransitionsBefore, 39 TransitionsAfterwards, 2860 CoEnabledTransitionPairs, 6 FixpointIterations, 54 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 6 ChoiceCompositions, 1320 VarBasedMoverChecksPositive, 23 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 27 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 3115 CheckedPairsTotal, 100 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.3s, 160 ProgramPointsBefore, 58 ProgramPointsAfterwards, 141 TransitionsBefore, 45 TransitionsAfterwards, 3612 CoEnabledTransitionPairs, 6 FixpointIterations, 63 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 1765 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 38 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 4276 CheckedPairsTotal, 117 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 676). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 1 error locations. Result: TIMEOUT, OverallTime: 142.4s, OverallIterations: 34, TraceHistogramMax: 5, AutomataDifference: 53.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2544 SDtfs, 11366 SDslu, 7850 SDs, 0 SdLazy, 12160 SolverSat, 1157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1467 GetRequests, 410 SyntacticMatches, 17 SemanticMatches, 1040 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15264 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42643occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 78.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 1939713 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1030 NumberOfCodeBlocks, 1022 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 982 ConstructedInterpolants, 0 QuantifiedInterpolants, 63276 SizeOfPredicates, 76 NumberOfNonLiveVariables, 1681 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 48 InterpolantComputations, 20 PerfectInterpolantSequences, 444/638 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