/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:50:02,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:50:02,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:50:02,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:50:02,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:50:02,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:50:02,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:50:02,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:50:02,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:50:02,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:50:02,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:50:02,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:50:02,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:50:02,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:50:02,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:50:02,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:50:02,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:50:02,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:50:02,445 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:50:02,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:50:02,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:50:02,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:50:02,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:50:02,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:50:02,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:50:02,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:50:02,476 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:50:02,477 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:50:02,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:50:02,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:50:02,479 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:50:02,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:50:02,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:50:02,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:50:02,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:50:02,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:50:02,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:50:02,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:50:02,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:50:02,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:50:02,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:50:02,485 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:50:02,507 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:50:02,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:50:02,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:50:02,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:50:02,509 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:50:02,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:50:02,509 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:50:02,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:50:02,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:50:02,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:50:02,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:50:02,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:50:02,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:50:02,510 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:50:02,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:50:02,511 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:50:02,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:50:02,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:50:02,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:50:02,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:50:02,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:50:02,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:50:02,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:50:02,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:50:02,512 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:50:02,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:50:02,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:50:02,513 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:50:02,513 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:50:02,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:50:02,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:50:02,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:50:02,847 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:50:02,847 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:50:02,848 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-1.i [2020-10-05 23:50:02,923 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/893b5cd49/0390fae9d0744fcf8e3676b8a0b25085/FLAG9cad729e9 [2020-10-05 23:50:03,480 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:50:03,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-1.i [2020-10-05 23:50:03,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/893b5cd49/0390fae9d0744fcf8e3676b8a0b25085/FLAG9cad729e9 [2020-10-05 23:50:03,790 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/893b5cd49/0390fae9d0744fcf8e3676b8a0b25085 [2020-10-05 23:50:03,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:50:03,799 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:50:03,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:50:03,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:50:03,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:50:03,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:50:03" (1/1) ... [2020-10-05 23:50:03,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647ed9dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:03, skipping insertion in model container [2020-10-05 23:50:03,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:50:03" (1/1) ... [2020-10-05 23:50:03,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:50:03,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:50:04,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:50:04,388 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:50:04,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:50:04,508 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:50:04,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:04 WrapperNode [2020-10-05 23:50:04,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:50:04,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:50:04,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:50:04,510 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:50:04,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:04" (1/1) ... [2020-10-05 23:50:04,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:04" (1/1) ... [2020-10-05 23:50:04,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:50:04,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:50:04,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:50:04,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:50:04,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:04" (1/1) ... [2020-10-05 23:50:04,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:04" (1/1) ... [2020-10-05 23:50:04,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:04" (1/1) ... [2020-10-05 23:50:04,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:04" (1/1) ... [2020-10-05 23:50:04,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:04" (1/1) ... [2020-10-05 23:50:04,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:04" (1/1) ... [2020-10-05 23:50:04,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:04" (1/1) ... [2020-10-05 23:50:04,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:50:04,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:50:04,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:50:04,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:50:04,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:04" (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 [2020-10-05 23:50:04,659 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2020-10-05 23:50:04,659 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2020-10-05 23:50:04,659 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-10-05 23:50:04,660 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-10-05 23:50:04,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:50:04,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:50:04,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:50:04,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:50:04,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:50:04,662 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:50:05,013 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:50:05,013 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-05 23:50:05,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:50:05 BoogieIcfgContainer [2020-10-05 23:50:05,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:50:05,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:50:05,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:50:05,020 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:50:05,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:50:03" (1/3) ... [2020-10-05 23:50:05,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fe65f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:50:05, skipping insertion in model container [2020-10-05 23:50:05,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:50:04" (2/3) ... [2020-10-05 23:50:05,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fe65f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:50:05, skipping insertion in model container [2020-10-05 23:50:05,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:50:05" (3/3) ... [2020-10-05 23:50:05,024 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2020-10-05 23:50:05,035 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:50:05,035 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:50:05,043 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-05 23:50:05,044 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:50:05,073 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,073 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,074 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,074 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,074 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,075 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,075 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,076 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,076 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,077 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,077 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,077 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,078 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,082 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,082 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,082 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,083 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,083 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,089 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,090 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,090 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:05,108 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-05 23:50:05,126 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:50:05,126 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:50:05,126 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:50:05,126 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:50:05,126 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:50:05,127 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:50:05,127 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:50:05,127 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:50:05,141 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 58 transitions, 126 flow [2020-10-05 23:50:05,142 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 61 places, 58 transitions, 126 flow [2020-10-05 23:50:05,184 INFO L129 PetriNetUnfolder]: 4/68 cut-off events. [2020-10-05 23:50:05,184 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:50:05,190 INFO L80 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 68 events. 4/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2020-10-05 23:50:05,193 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 61 places, 58 transitions, 126 flow [2020-10-05 23:50:05,215 INFO L129 PetriNetUnfolder]: 4/68 cut-off events. [2020-10-05 23:50:05,215 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:50:05,217 INFO L80 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 68 events. 4/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2020-10-05 23:50:05,219 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 592 [2020-10-05 23:50:05,220 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:50:06,448 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2020-10-05 23:50:06,704 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2020-10-05 23:50:06,810 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-10-05 23:50:06,940 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2020-10-05 23:50:07,020 INFO L206 etLargeBlockEncoding]: Checked pairs total: 486 [2020-10-05 23:50:07,021 INFO L214 etLargeBlockEncoding]: Total number of compositions: 51 [2020-10-05 23:50:07,025 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 12 transitions, 34 flow [2020-10-05 23:50:07,049 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-10-05 23:50:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-10-05 23:50:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:50:07,056 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:07,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:50:07,057 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:07,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:07,062 INFO L82 PathProgramCache]: Analyzing trace with hash 229686, now seen corresponding path program 1 times [2020-10-05 23:50:07,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:07,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941959055] [2020-10-05 23:50:07,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:07,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941959055] [2020-10-05 23:50:07,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:07,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:50:07,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4674580] [2020-10-05 23:50:07,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:50:07,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:07,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:50:07,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:50:07,279 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-10-05 23:50:07,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:07,317 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2020-10-05 23:50:07,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:50:07,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:50:07,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:07,329 INFO L225 Difference]: With dead ends: 35 [2020-10-05 23:50:07,329 INFO L226 Difference]: Without dead ends: 31 [2020-10-05 23:50:07,331 INFO L675 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 [2020-10-05 23:50:07,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-05 23:50:07,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-05 23:50:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-05 23:50:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-10-05 23:50:07,368 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2020-10-05 23:50:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:07,369 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-10-05 23:50:07,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:50:07,369 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-10-05 23:50:07,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-05 23:50:07,370 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:07,370 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:07,370 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:50:07,370 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:07,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:07,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1647647331, now seen corresponding path program 1 times [2020-10-05 23:50:07,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:07,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259180628] [2020-10-05 23:50:07,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:07,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:07,480 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259180628] [2020-10-05 23:50:07,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:07,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:50:07,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077244458] [2020-10-05 23:50:07,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:50:07,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:07,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:50:07,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:50:07,484 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2020-10-05 23:50:07,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:07,515 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-10-05 23:50:07,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:50:07,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-10-05 23:50:07,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:07,517 INFO L225 Difference]: With dead ends: 26 [2020-10-05 23:50:07,517 INFO L226 Difference]: Without dead ends: 24 [2020-10-05 23:50:07,518 INFO L675 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 [2020-10-05 23:50:07,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-05 23:50:07,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-05 23:50:07,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-05 23:50:07,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-10-05 23:50:07,522 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2020-10-05 23:50:07,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:07,523 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-10-05 23:50:07,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:50:07,523 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-10-05 23:50:07,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-05 23:50:07,524 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:07,524 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:07,524 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:50:07,525 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:07,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:07,525 INFO L82 PathProgramCache]: Analyzing trace with hash -462538936, now seen corresponding path program 1 times [2020-10-05 23:50:07,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:07,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800335195] [2020-10-05 23:50:07,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:50:07,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:50:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:50:07,566 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:50:07,591 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:50:07,592 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:50:07,592 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:50:07,592 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:50:07,593 WARN L363 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:50:07,594 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-10-05 23:50:07,602 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,602 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,602 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,602 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,603 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,603 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,603 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,603 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,604 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,604 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,607 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,607 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,607 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,608 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,608 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,608 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,613 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,615 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,615 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,615 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,616 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,616 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,618 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,619 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,619 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,619 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,619 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:07,627 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-05 23:50:07,627 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:50:07,627 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:50:07,628 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:50:07,628 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:50:07,628 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:50:07,628 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:50:07,628 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:50:07,628 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:50:07,631 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 74 transitions, 172 flow [2020-10-05 23:50:07,631 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 74 transitions, 172 flow [2020-10-05 23:50:07,653 INFO L129 PetriNetUnfolder]: 5/89 cut-off events. [2020-10-05 23:50:07,654 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-05 23:50:07,655 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 89 events. 5/89 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 120 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 98. Up to 6 conditions per place. [2020-10-05 23:50:07,659 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 74 transitions, 172 flow [2020-10-05 23:50:07,695 INFO L129 PetriNetUnfolder]: 5/89 cut-off events. [2020-10-05 23:50:07,695 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-05 23:50:07,698 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 89 events. 5/89 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 120 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 98. Up to 6 conditions per place. [2020-10-05 23:50:07,700 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 920 [2020-10-05 23:50:07,700 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:50:09,080 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-05 23:50:09,236 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-05 23:50:09,242 INFO L206 etLargeBlockEncoding]: Checked pairs total: 942 [2020-10-05 23:50:09,242 INFO L214 etLargeBlockEncoding]: Total number of compositions: 62 [2020-10-05 23:50:09,242 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 21 transitions, 66 flow [2020-10-05 23:50:09,255 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2020-10-05 23:50:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2020-10-05 23:50:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:50:09,256 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:09,256 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:50:09,256 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:50:09,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:09,257 INFO L82 PathProgramCache]: Analyzing trace with hash 384194, now seen corresponding path program 1 times [2020-10-05 23:50:09,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:09,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832182493] [2020-10-05 23:50:09,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:09,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832182493] [2020-10-05 23:50:09,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:09,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:50:09,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428132089] [2020-10-05 23:50:09,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:50:09,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:09,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:50:09,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:50:09,299 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2020-10-05 23:50:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:09,335 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2020-10-05 23:50:09,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:50:09,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:50:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:09,341 INFO L225 Difference]: With dead ends: 185 [2020-10-05 23:50:09,341 INFO L226 Difference]: Without dead ends: 171 [2020-10-05 23:50:09,342 INFO L675 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 [2020-10-05 23:50:09,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-05 23:50:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-10-05 23:50:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-10-05 23:50:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 418 transitions. [2020-10-05 23:50:09,375 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 418 transitions. Word has length 3 [2020-10-05 23:50:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:09,376 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 418 transitions. [2020-10-05 23:50:09,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:50:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 418 transitions. [2020-10-05 23:50:09,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:50:09,380 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:09,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:09,381 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:50:09,382 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:50:09,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:09,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1694917346, now seen corresponding path program 1 times [2020-10-05 23:50:09,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:09,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488520029] [2020-10-05 23:50:09,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:09,473 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488520029] [2020-10-05 23:50:09,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:09,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:50:09,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735646834] [2020-10-05 23:50:09,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:50:09,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:09,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:50:09,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:50:09,475 INFO L87 Difference]: Start difference. First operand 171 states and 418 transitions. Second operand 5 states. [2020-10-05 23:50:09,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:09,567 INFO L93 Difference]: Finished difference Result 205 states and 460 transitions. [2020-10-05 23:50:09,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:50:09,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:50:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:09,570 INFO L225 Difference]: With dead ends: 205 [2020-10-05 23:50:09,570 INFO L226 Difference]: Without dead ends: 201 [2020-10-05 23:50:09,570 INFO L675 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 [2020-10-05 23:50:09,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-05 23:50:09,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2020-10-05 23:50:09,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-05 23:50:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2020-10-05 23:50:09,590 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2020-10-05 23:50:09,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:09,591 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2020-10-05 23:50:09,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:50:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2020-10-05 23:50:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:50:09,592 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:09,592 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:09,593 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:50:09,593 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:50:09,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:09,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1027741454, now seen corresponding path program 1 times [2020-10-05 23:50:09,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:09,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025837970] [2020-10-05 23:50:09,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:09,653 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025837970] [2020-10-05 23:50:09,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:09,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:50:09,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837581269] [2020-10-05 23:50:09,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:50:09,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:09,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:50:09,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:50:09,655 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2020-10-05 23:50:09,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:09,735 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2020-10-05 23:50:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:50:09,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:50:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:09,738 INFO L225 Difference]: With dead ends: 189 [2020-10-05 23:50:09,738 INFO L226 Difference]: Without dead ends: 185 [2020-10-05 23:50:09,739 INFO L675 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 [2020-10-05 23:50:09,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-05 23:50:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2020-10-05 23:50:09,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-05 23:50:09,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2020-10-05 23:50:09,754 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2020-10-05 23:50:09,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:09,755 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2020-10-05 23:50:09,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:50:09,755 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2020-10-05 23:50:09,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:50:09,756 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:09,757 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:09,757 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:50:09,757 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:50:09,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:09,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1792799235, now seen corresponding path program 1 times [2020-10-05 23:50:09,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:09,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280135598] [2020-10-05 23:50:09,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:50:09,775 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:50:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:50:09,787 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:50:09,797 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:50:09,797 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:50:09,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:50:09,797 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:50:09,798 WARN L363 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:50:09,804 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-10-05 23:50:09,822 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,822 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,822 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,822 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,823 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,823 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,823 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,823 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,823 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,824 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,824 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,824 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,824 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,824 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,825 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,825 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,825 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,825 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,825 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,826 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,826 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,827 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,828 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,828 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,829 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,829 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,830 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,834 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,834 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,834 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,834 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,834 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,837 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,838 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,838 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,838 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,838 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,840 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,840 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,840 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,841 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,841 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,842 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,843 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,843 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,843 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,843 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,843 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,845 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,845 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,848 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,848 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,848 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:09,850 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:50:09,850 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:50:09,851 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:50:09,851 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:50:09,851 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:50:09,851 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:50:09,851 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:50:09,851 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:50:09,851 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:50:09,854 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 90 transitions, 222 flow [2020-10-05 23:50:09,854 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 90 transitions, 222 flow [2020-10-05 23:50:09,871 INFO L129 PetriNetUnfolder]: 6/110 cut-off events. [2020-10-05 23:50:09,872 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-05 23:50:09,873 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 6/110 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 163 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2020-10-05 23:50:09,875 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 90 transitions, 222 flow [2020-10-05 23:50:09,892 INFO L129 PetriNetUnfolder]: 6/110 cut-off events. [2020-10-05 23:50:09,892 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-05 23:50:09,893 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 6/110 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 163 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2020-10-05 23:50:09,896 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1308 [2020-10-05 23:50:09,896 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:50:11,196 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2020-10-05 23:50:11,432 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-10-05 23:50:11,578 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-05 23:50:11,584 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1426 [2020-10-05 23:50:11,585 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2020-10-05 23:50:11,585 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 27 transitions, 96 flow [2020-10-05 23:50:11,613 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2020-10-05 23:50:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2020-10-05 23:50:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:50:11,614 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:11,614 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:50:11,614 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:50:11,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:11,615 INFO L82 PathProgramCache]: Analyzing trace with hash 567457, now seen corresponding path program 1 times [2020-10-05 23:50:11,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:11,615 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854558684] [2020-10-05 23:50:11,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:11,641 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854558684] [2020-10-05 23:50:11,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:11,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:50:11,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612780953] [2020-10-05 23:50:11,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:50:11,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:11,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:50:11,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:50:11,643 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2020-10-05 23:50:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:11,719 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2020-10-05 23:50:11,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:50:11,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:50:11,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:11,729 INFO L225 Difference]: With dead ends: 600 [2020-10-05 23:50:11,729 INFO L226 Difference]: Without dead ends: 559 [2020-10-05 23:50:11,730 INFO L675 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 [2020-10-05 23:50:11,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-10-05 23:50:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2020-10-05 23:50:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2020-10-05 23:50:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1737 transitions. [2020-10-05 23:50:11,801 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1737 transitions. Word has length 3 [2020-10-05 23:50:11,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:11,801 INFO L479 AbstractCegarLoop]: Abstraction has 559 states and 1737 transitions. [2020-10-05 23:50:11,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:50:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1737 transitions. [2020-10-05 23:50:11,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:50:11,803 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:11,803 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:11,803 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:50:11,804 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:50:11,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:11,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1052273544, now seen corresponding path program 1 times [2020-10-05 23:50:11,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:11,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932414360] [2020-10-05 23:50:11,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:11,900 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932414360] [2020-10-05 23:50:11,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:11,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:50:11,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882066101] [2020-10-05 23:50:11,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:50:11,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:11,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:50:11,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:50:11,903 INFO L87 Difference]: Start difference. First operand 559 states and 1737 transitions. Second operand 5 states. [2020-10-05 23:50:12,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:12,034 INFO L93 Difference]: Finished difference Result 817 states and 2317 transitions. [2020-10-05 23:50:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:50:12,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:50:12,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:12,042 INFO L225 Difference]: With dead ends: 817 [2020-10-05 23:50:12,042 INFO L226 Difference]: Without dead ends: 812 [2020-10-05 23:50:12,043 INFO L675 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 [2020-10-05 23:50:12,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-10-05 23:50:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 585. [2020-10-05 23:50:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2020-10-05 23:50:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1832 transitions. [2020-10-05 23:50:12,071 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1832 transitions. Word has length 9 [2020-10-05 23:50:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:12,072 INFO L479 AbstractCegarLoop]: Abstraction has 585 states and 1832 transitions. [2020-10-05 23:50:12,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:50:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1832 transitions. [2020-10-05 23:50:12,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:50:12,079 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:12,079 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:12,079 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:50:12,079 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:50:12,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:12,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1096280394, now seen corresponding path program 1 times [2020-10-05 23:50:12,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:12,085 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108477178] [2020-10-05 23:50:12,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:12,165 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108477178] [2020-10-05 23:50:12,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:12,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:50:12,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875000756] [2020-10-05 23:50:12,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:50:12,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:12,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:50:12,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:50:12,167 INFO L87 Difference]: Start difference. First operand 585 states and 1832 transitions. Second operand 5 states. [2020-10-05 23:50:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:12,256 INFO L93 Difference]: Finished difference Result 843 states and 2406 transitions. [2020-10-05 23:50:12,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:50:12,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:50:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:12,263 INFO L225 Difference]: With dead ends: 843 [2020-10-05 23:50:12,263 INFO L226 Difference]: Without dead ends: 836 [2020-10-05 23:50:12,264 INFO L675 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 [2020-10-05 23:50:12,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2020-10-05 23:50:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 611. [2020-10-05 23:50:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2020-10-05 23:50:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1906 transitions. [2020-10-05 23:50:12,291 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1906 transitions. Word has length 13 [2020-10-05 23:50:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:12,291 INFO L479 AbstractCegarLoop]: Abstraction has 611 states and 1906 transitions. [2020-10-05 23:50:12,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:50:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1906 transitions. [2020-10-05 23:50:12,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:50:12,292 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:12,293 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:12,293 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:50:12,293 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:50:12,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:12,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2044985054, now seen corresponding path program 1 times [2020-10-05 23:50:12,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:12,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879158733] [2020-10-05 23:50:12,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:12,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879158733] [2020-10-05 23:50:12,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254833894] [2020-10-05 23:50:12,386 INFO L95 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 [2020-10-05 23:50:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:12,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:50:12,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:12,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:12,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:50:12,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911423454] [2020-10-05 23:50:12,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:50:12,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:12,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:50:12,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:50:12,564 INFO L87 Difference]: Start difference. First operand 611 states and 1906 transitions. Second operand 12 states. [2020-10-05 23:50:12,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:12,845 INFO L93 Difference]: Finished difference Result 1059 states and 2818 transitions. [2020-10-05 23:50:12,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:12,851 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-05 23:50:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:12,864 INFO L225 Difference]: With dead ends: 1059 [2020-10-05 23:50:12,864 INFO L226 Difference]: Without dead ends: 1052 [2020-10-05 23:50:12,865 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:50:12,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-10-05 23:50:12,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 591. [2020-10-05 23:50:12,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-05 23:50:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1840 transitions. [2020-10-05 23:50:12,892 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1840 transitions. Word has length 15 [2020-10-05 23:50:12,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:12,892 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 1840 transitions. [2020-10-05 23:50:12,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:50:12,893 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1840 transitions. [2020-10-05 23:50:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:50:12,893 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:12,894 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:13,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-10-05 23:50:13,109 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:50:13,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:13,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1258473782, now seen corresponding path program 2 times [2020-10-05 23:50:13,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:13,111 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023832465] [2020-10-05 23:50:13,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:13,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023832465] [2020-10-05 23:50:13,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:13,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:50:13,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551526723] [2020-10-05 23:50:13,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:50:13,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:13,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:50:13,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:50:13,180 INFO L87 Difference]: Start difference. First operand 591 states and 1840 transitions. Second operand 7 states. [2020-10-05 23:50:13,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:13,431 INFO L93 Difference]: Finished difference Result 1053 states and 2807 transitions. [2020-10-05 23:50:13,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:13,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:50:13,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:13,439 INFO L225 Difference]: With dead ends: 1053 [2020-10-05 23:50:13,440 INFO L226 Difference]: Without dead ends: 1045 [2020-10-05 23:50:13,440 INFO L675 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 [2020-10-05 23:50:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2020-10-05 23:50:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2020-10-05 23:50:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2020-10-05 23:50:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2020-10-05 23:50:13,468 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2020-10-05 23:50:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:13,468 INFO L479 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2020-10-05 23:50:13,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:50:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2020-10-05 23:50:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:50:13,470 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:13,470 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:13,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:50:13,470 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:50:13,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:13,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1734594488, now seen corresponding path program 1 times [2020-10-05 23:50:13,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:13,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067428295] [2020-10-05 23:50:13,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:50:13,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067428295] [2020-10-05 23:50:13,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:13,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:50:13,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832680453] [2020-10-05 23:50:13,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:50:13,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:13,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:50:13,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:50:13,516 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2020-10-05 23:50:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:13,602 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2020-10-05 23:50:13,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:50:13,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:50:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:13,608 INFO L225 Difference]: With dead ends: 736 [2020-10-05 23:50:13,608 INFO L226 Difference]: Without dead ends: 728 [2020-10-05 23:50:13,609 INFO L675 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 [2020-10-05 23:50:13,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-10-05 23:50:13,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2020-10-05 23:50:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2020-10-05 23:50:13,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2020-10-05 23:50:13,630 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2020-10-05 23:50:13,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:13,630 INFO L479 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2020-10-05 23:50:13,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:50:13,631 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2020-10-05 23:50:13,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:50:13,632 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:13,632 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:13,632 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:50:13,632 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:50:13,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:13,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2065233823, now seen corresponding path program 1 times [2020-10-05 23:50:13,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:13,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138812582] [2020-10-05 23:50:13,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:50:13,645 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:50:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:50:13,653 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:50:13,660 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:50:13,660 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:50:13,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:50:13,661 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:50:13,662 WARN L363 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:50:13,662 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-10-05 23:50:13,674 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,674 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,674 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,675 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,675 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,675 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,675 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,675 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,676 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,676 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,676 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,676 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,676 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,676 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,677 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,677 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,677 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,677 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,677 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,677 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,677 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,678 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,678 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,678 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,678 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,678 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,679 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,679 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,682 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,685 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,686 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,686 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,686 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,686 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,689 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,690 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,690 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,690 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,690 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,692 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,692 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,692 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,692 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,692 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,694 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,694 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,694 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,694 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,695 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,697 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,698 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,699 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,699 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,700 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,701 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:13,705 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 23:50:13,705 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:50:13,705 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:50:13,705 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:50:13,705 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:50:13,705 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:50:13,705 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:50:13,706 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:50:13,706 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:50:13,707 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 106 transitions, 276 flow [2020-10-05 23:50:13,708 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 106 transitions, 276 flow [2020-10-05 23:50:13,725 INFO L129 PetriNetUnfolder]: 7/131 cut-off events. [2020-10-05 23:50:13,725 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-05 23:50:13,727 INFO L80 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 131 events. 7/131 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 151. Up to 10 conditions per place. [2020-10-05 23:50:13,732 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 106 transitions, 276 flow [2020-10-05 23:50:13,747 INFO L129 PetriNetUnfolder]: 7/131 cut-off events. [2020-10-05 23:50:13,747 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-05 23:50:13,749 INFO L80 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 131 events. 7/131 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 151. Up to 10 conditions per place. [2020-10-05 23:50:13,754 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1756 [2020-10-05 23:50:13,754 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:50:15,210 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2020-10-05 23:50:15,320 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-10-05 23:50:15,510 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2020-10-05 23:50:15,673 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-10-05 23:50:15,767 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2033 [2020-10-05 23:50:15,767 INFO L214 etLargeBlockEncoding]: Total number of compositions: 86 [2020-10-05 23:50:15,768 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 33 transitions, 130 flow [2020-10-05 23:50:15,887 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2020-10-05 23:50:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2020-10-05 23:50:15,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:50:15,887 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:15,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:50:15,888 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:15,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:15,888 INFO L82 PathProgramCache]: Analyzing trace with hash 779528, now seen corresponding path program 1 times [2020-10-05 23:50:15,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:15,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430203554] [2020-10-05 23:50:15,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:15,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430203554] [2020-10-05 23:50:15,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:15,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:50:15,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109328466] [2020-10-05 23:50:15,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:50:15,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:15,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:50:15,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:50:15,909 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2020-10-05 23:50:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:15,955 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2020-10-05 23:50:15,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:50:15,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:50:15,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:15,972 INFO L225 Difference]: With dead ends: 1889 [2020-10-05 23:50:15,972 INFO L226 Difference]: Without dead ends: 1767 [2020-10-05 23:50:15,972 INFO L675 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 [2020-10-05 23:50:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2020-10-05 23:50:16,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2020-10-05 23:50:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2020-10-05 23:50:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 6690 transitions. [2020-10-05 23:50:16,057 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 6690 transitions. Word has length 3 [2020-10-05 23:50:16,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:16,057 INFO L479 AbstractCegarLoop]: Abstraction has 1767 states and 6690 transitions. [2020-10-05 23:50:16,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:50:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 6690 transitions. [2020-10-05 23:50:16,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:50:16,058 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:16,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:16,058 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:50:16,058 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:16,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:16,058 INFO L82 PathProgramCache]: Analyzing trace with hash -666106918, now seen corresponding path program 1 times [2020-10-05 23:50:16,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:16,059 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578274436] [2020-10-05 23:50:16,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:16,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578274436] [2020-10-05 23:50:16,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:16,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:50:16,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024124759] [2020-10-05 23:50:16,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:50:16,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:16,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:50:16,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:50:16,095 INFO L87 Difference]: Start difference. First operand 1767 states and 6690 transitions. Second operand 5 states. [2020-10-05 23:50:16,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:16,207 INFO L93 Difference]: Finished difference Result 2905 states and 10138 transitions. [2020-10-05 23:50:16,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:50:16,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:50:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:16,231 INFO L225 Difference]: With dead ends: 2905 [2020-10-05 23:50:16,232 INFO L226 Difference]: Without dead ends: 2899 [2020-10-05 23:50:16,232 INFO L675 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 [2020-10-05 23:50:16,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-10-05 23:50:16,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1966. [2020-10-05 23:50:16,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2020-10-05 23:50:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 7503 transitions. [2020-10-05 23:50:16,331 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 7503 transitions. Word has length 9 [2020-10-05 23:50:16,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:16,332 INFO L479 AbstractCegarLoop]: Abstraction has 1966 states and 7503 transitions. [2020-10-05 23:50:16,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:50:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 7503 transitions. [2020-10-05 23:50:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:50:16,333 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:16,333 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:16,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:50:16,333 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:16,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:16,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1766896000, now seen corresponding path program 1 times [2020-10-05 23:50:16,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:16,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922380037] [2020-10-05 23:50:16,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:16,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922380037] [2020-10-05 23:50:16,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:16,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:50:16,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037837147] [2020-10-05 23:50:16,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:50:16,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:16,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:50:16,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:50:16,430 INFO L87 Difference]: Start difference. First operand 1966 states and 7503 transitions. Second operand 5 states. [2020-10-05 23:50:16,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:16,537 INFO L93 Difference]: Finished difference Result 3204 states and 11312 transitions. [2020-10-05 23:50:16,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:50:16,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:50:16,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:16,564 INFO L225 Difference]: With dead ends: 3204 [2020-10-05 23:50:16,564 INFO L226 Difference]: Without dead ends: 3194 [2020-10-05 23:50:16,564 INFO L675 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 [2020-10-05 23:50:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2020-10-05 23:50:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2200. [2020-10-05 23:50:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2020-10-05 23:50:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 8453 transitions. [2020-10-05 23:50:16,663 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 8453 transitions. Word has length 13 [2020-10-05 23:50:16,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:16,663 INFO L479 AbstractCegarLoop]: Abstraction has 2200 states and 8453 transitions. [2020-10-05 23:50:16,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:50:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 8453 transitions. [2020-10-05 23:50:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:50:16,664 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:16,664 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:16,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:50:16,665 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:16,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:16,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1022394712, now seen corresponding path program 1 times [2020-10-05 23:50:16,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:16,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782690221] [2020-10-05 23:50:16,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:16,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782690221] [2020-10-05 23:50:16,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746963674] [2020-10-05 23:50:16,726 INFO L95 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 [2020-10-05 23:50:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:16,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:50:16,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:16,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:16,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:50:16,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575861042] [2020-10-05 23:50:16,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:50:16,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:16,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:50:16,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:50:16,863 INFO L87 Difference]: Start difference. First operand 2200 states and 8453 transitions. Second operand 12 states. [2020-10-05 23:50:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:17,206 INFO L93 Difference]: Finished difference Result 4556 states and 14911 transitions. [2020-10-05 23:50:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:17,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-05 23:50:17,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:17,250 INFO L225 Difference]: With dead ends: 4556 [2020-10-05 23:50:17,250 INFO L226 Difference]: Without dead ends: 4546 [2020-10-05 23:50:17,253 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:50:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2020-10-05 23:50:17,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 2157. [2020-10-05 23:50:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2020-10-05 23:50:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 8278 transitions. [2020-10-05 23:50:17,376 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 8278 transitions. Word has length 15 [2020-10-05 23:50:17,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:17,377 INFO L479 AbstractCegarLoop]: Abstraction has 2157 states and 8278 transitions. [2020-10-05 23:50:17,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:50:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 8278 transitions. [2020-10-05 23:50:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:50:17,378 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:17,378 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:17,592 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-05 23:50:17,593 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:17,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:17,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1474969304, now seen corresponding path program 2 times [2020-10-05 23:50:17,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:17,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672531713] [2020-10-05 23:50:17,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:17,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672531713] [2020-10-05 23:50:17,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:17,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:50:17,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61667629] [2020-10-05 23:50:17,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:50:17,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:17,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:50:17,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:50:17,648 INFO L87 Difference]: Start difference. First operand 2157 states and 8278 transitions. Second operand 7 states. [2020-10-05 23:50:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:18,000 INFO L93 Difference]: Finished difference Result 4612 states and 15111 transitions. [2020-10-05 23:50:18,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:18,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:50:18,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:18,021 INFO L225 Difference]: With dead ends: 4612 [2020-10-05 23:50:18,021 INFO L226 Difference]: Without dead ends: 4601 [2020-10-05 23:50:18,021 INFO L675 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 [2020-10-05 23:50:18,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2020-10-05 23:50:18,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 2035. [2020-10-05 23:50:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2020-10-05 23:50:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 7845 transitions. [2020-10-05 23:50:18,142 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 7845 transitions. Word has length 15 [2020-10-05 23:50:18,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:18,143 INFO L479 AbstractCegarLoop]: Abstraction has 2035 states and 7845 transitions. [2020-10-05 23:50:18,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:50:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 7845 transitions. [2020-10-05 23:50:18,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:50:18,144 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:18,144 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:18,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 23:50:18,145 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:18,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:18,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1278978660, now seen corresponding path program 1 times [2020-10-05 23:50:18,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:18,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944878740] [2020-10-05 23:50:18,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:18,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:50:18,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944878740] [2020-10-05 23:50:18,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:18,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:50:18,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566795571] [2020-10-05 23:50:18,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:50:18,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:18,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:50:18,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:50:18,196 INFO L87 Difference]: Start difference. First operand 2035 states and 7845 transitions. Second operand 5 states. [2020-10-05 23:50:18,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:18,310 INFO L93 Difference]: Finished difference Result 3265 states and 11681 transitions. [2020-10-05 23:50:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:50:18,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:50:18,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:18,323 INFO L225 Difference]: With dead ends: 3265 [2020-10-05 23:50:18,323 INFO L226 Difference]: Without dead ends: 3250 [2020-10-05 23:50:18,323 INFO L675 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 [2020-10-05 23:50:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2020-10-05 23:50:18,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2281. [2020-10-05 23:50:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2020-10-05 23:50:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 8755 transitions. [2020-10-05 23:50:18,424 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 8755 transitions. Word has length 17 [2020-10-05 23:50:18,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:18,424 INFO L479 AbstractCegarLoop]: Abstraction has 2281 states and 8755 transitions. [2020-10-05 23:50:18,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:50:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 8755 transitions. [2020-10-05 23:50:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:50:18,426 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:18,426 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:18,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 23:50:18,427 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:18,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:18,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1455436228, now seen corresponding path program 1 times [2020-10-05 23:50:18,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:18,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852061930] [2020-10-05 23:50:18,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:50:18,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852061930] [2020-10-05 23:50:18,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864784665] [2020-10-05 23:50:18,492 INFO L95 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 [2020-10-05 23:50:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:18,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:50:18,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:50:18,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:18,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:50:18,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863670956] [2020-10-05 23:50:18,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:50:18,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:18,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:50:18,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:50:18,671 INFO L87 Difference]: Start difference. First operand 2281 states and 8755 transitions. Second operand 12 states. [2020-10-05 23:50:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:19,052 INFO L93 Difference]: Finished difference Result 4825 states and 15986 transitions. [2020-10-05 23:50:19,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:19,061 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:50:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:19,082 INFO L225 Difference]: With dead ends: 4825 [2020-10-05 23:50:19,082 INFO L226 Difference]: Without dead ends: 4813 [2020-10-05 23:50:19,083 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:50:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2020-10-05 23:50:19,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 2305. [2020-10-05 23:50:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2020-10-05 23:50:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 8815 transitions. [2020-10-05 23:50:19,253 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 8815 transitions. Word has length 19 [2020-10-05 23:50:19,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:19,254 INFO L479 AbstractCegarLoop]: Abstraction has 2305 states and 8815 transitions. [2020-10-05 23:50:19,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:50:19,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 8815 transitions. [2020-10-05 23:50:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:50:19,256 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:19,256 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:19,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:50:19,469 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:19,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:19,470 INFO L82 PathProgramCache]: Analyzing trace with hash -979473248, now seen corresponding path program 1 times [2020-10-05 23:50:19,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:19,470 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764325618] [2020-10-05 23:50:19,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:19,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764325618] [2020-10-05 23:50:19,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713487033] [2020-10-05 23:50:19,525 INFO L95 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 [2020-10-05 23:50:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:19,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:50:19,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:19,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:19,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:50:19,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459828403] [2020-10-05 23:50:19,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:50:19,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:19,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:50:19,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:50:19,679 INFO L87 Difference]: Start difference. First operand 2305 states and 8815 transitions. Second operand 12 states. [2020-10-05 23:50:20,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:20,063 INFO L93 Difference]: Finished difference Result 4942 states and 16410 transitions. [2020-10-05 23:50:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:20,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:50:20,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:20,078 INFO L225 Difference]: With dead ends: 4942 [2020-10-05 23:50:20,079 INFO L226 Difference]: Without dead ends: 4925 [2020-10-05 23:50:20,079 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:50:20,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2020-10-05 23:50:20,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 2299. [2020-10-05 23:50:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2020-10-05 23:50:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 8782 transitions. [2020-10-05 23:50:20,207 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 8782 transitions. Word has length 19 [2020-10-05 23:50:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:20,207 INFO L479 AbstractCegarLoop]: Abstraction has 2299 states and 8782 transitions. [2020-10-05 23:50:20,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:50:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 8782 transitions. [2020-10-05 23:50:20,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:50:20,209 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:20,209 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:20,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:50:20,424 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:20,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:20,424 INFO L82 PathProgramCache]: Analyzing trace with hash -737855584, now seen corresponding path program 2 times [2020-10-05 23:50:20,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:20,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229501784] [2020-10-05 23:50:20,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:50:20,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229501784] [2020-10-05 23:50:20,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:20,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:50:20,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221505093] [2020-10-05 23:50:20,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:50:20,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:20,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:50:20,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:50:20,477 INFO L87 Difference]: Start difference. First operand 2299 states and 8782 transitions. Second operand 7 states. [2020-10-05 23:50:20,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:20,771 INFO L93 Difference]: Finished difference Result 4934 states and 16393 transitions. [2020-10-05 23:50:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:20,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:50:20,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:20,786 INFO L225 Difference]: With dead ends: 4934 [2020-10-05 23:50:20,786 INFO L226 Difference]: Without dead ends: 4917 [2020-10-05 23:50:20,786 INFO L675 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 [2020-10-05 23:50:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2020-10-05 23:50:20,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 2216. [2020-10-05 23:50:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2020-10-05 23:50:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 8477 transitions. [2020-10-05 23:50:20,895 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 8477 transitions. Word has length 19 [2020-10-05 23:50:20,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:20,896 INFO L479 AbstractCegarLoop]: Abstraction has 2216 states and 8477 transitions. [2020-10-05 23:50:20,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:50:20,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 8477 transitions. [2020-10-05 23:50:20,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:50:20,898 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:20,898 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:20,898 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-05 23:50:20,898 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:20,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:20,899 INFO L82 PathProgramCache]: Analyzing trace with hash -737840828, now seen corresponding path program 2 times [2020-10-05 23:50:20,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:20,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376736544] [2020-10-05 23:50:20,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:50:21,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376736544] [2020-10-05 23:50:21,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:21,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:50:21,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959293513] [2020-10-05 23:50:21,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:50:21,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:21,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:50:21,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:50:21,038 INFO L87 Difference]: Start difference. First operand 2216 states and 8477 transitions. Second operand 7 states. [2020-10-05 23:50:21,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:21,326 INFO L93 Difference]: Finished difference Result 4774 states and 15828 transitions. [2020-10-05 23:50:21,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:21,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:50:21,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:21,340 INFO L225 Difference]: With dead ends: 4774 [2020-10-05 23:50:21,340 INFO L226 Difference]: Without dead ends: 4757 [2020-10-05 23:50:21,340 INFO L675 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 [2020-10-05 23:50:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2020-10-05 23:50:21,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 2150. [2020-10-05 23:50:21,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2020-10-05 23:50:21,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 8243 transitions. [2020-10-05 23:50:21,430 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 8243 transitions. Word has length 19 [2020-10-05 23:50:21,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:21,430 INFO L479 AbstractCegarLoop]: Abstraction has 2150 states and 8243 transitions. [2020-10-05 23:50:21,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:50:21,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 8243 transitions. [2020-10-05 23:50:21,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:50:21,432 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:21,432 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:21,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-05 23:50:21,432 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:21,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:21,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1726751032, now seen corresponding path program 1 times [2020-10-05 23:50:21,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:21,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382678312] [2020-10-05 23:50:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:21,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:21,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382678312] [2020-10-05 23:50:21,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33670607] [2020-10-05 23:50:21,503 INFO L95 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 [2020-10-05 23:50:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:21,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:50:21,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:21,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:21,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:50:21,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846100956] [2020-10-05 23:50:21,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:50:21,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:21,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:50:21,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:50:21,673 INFO L87 Difference]: Start difference. First operand 2150 states and 8243 transitions. Second operand 16 states. [2020-10-05 23:50:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:22,479 INFO L93 Difference]: Finished difference Result 6025 states and 18746 transitions. [2020-10-05 23:50:22,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:50:22,479 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:50:22,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:22,492 INFO L225 Difference]: With dead ends: 6025 [2020-10-05 23:50:22,492 INFO L226 Difference]: Without dead ends: 6017 [2020-10-05 23:50:22,494 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:50:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-10-05 23:50:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 2117. [2020-10-05 23:50:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2020-10-05 23:50:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 8106 transitions. [2020-10-05 23:50:22,700 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 8106 transitions. Word has length 21 [2020-10-05 23:50:22,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:22,702 INFO L479 AbstractCegarLoop]: Abstraction has 2117 states and 8106 transitions. [2020-10-05 23:50:22,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:50:22,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 8106 transitions. [2020-10-05 23:50:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:50:22,704 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:22,704 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:22,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-10-05 23:50:22,918 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:22,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:22,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1485133368, now seen corresponding path program 2 times [2020-10-05 23:50:22,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:22,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44123885] [2020-10-05 23:50:22,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:50:22,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44123885] [2020-10-05 23:50:22,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254428173] [2020-10-05 23:50:22,984 INFO L93 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 [2020-10-05 23:50:23,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:50:23,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:50:23,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:50:23,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:50:23,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:23,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:50:23,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29642112] [2020-10-05 23:50:23,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:50:23,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:23,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:50:23,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:50:23,167 INFO L87 Difference]: Start difference. First operand 2117 states and 8106 transitions. Second operand 16 states. [2020-10-05 23:50:23,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:23,980 INFO L93 Difference]: Finished difference Result 5914 states and 18384 transitions. [2020-10-05 23:50:23,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:50:23,981 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:50:23,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:23,992 INFO L225 Difference]: With dead ends: 5914 [2020-10-05 23:50:23,993 INFO L226 Difference]: Without dead ends: 5903 [2020-10-05 23:50:23,993 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:50:24,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2020-10-05 23:50:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 2085. [2020-10-05 23:50:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2020-10-05 23:50:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 7975 transitions. [2020-10-05 23:50:24,093 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 7975 transitions. Word has length 21 [2020-10-05 23:50:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:24,093 INFO L479 AbstractCegarLoop]: Abstraction has 2085 states and 7975 transitions. [2020-10-05 23:50:24,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:50:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 7975 transitions. [2020-10-05 23:50:24,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:50:24,095 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:24,095 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:24,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:50:24,309 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:24,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:24,309 INFO L82 PathProgramCache]: Analyzing trace with hash -268549816, now seen corresponding path program 3 times [2020-10-05 23:50:24,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:24,310 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163830944] [2020-10-05 23:50:24,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:24,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163830944] [2020-10-05 23:50:24,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668567373] [2020-10-05 23:50:24,378 INFO L93 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 [2020-10-05 23:50:24,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:50:24,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:50:24,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:50:24,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:24,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:24,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:50:24,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691932044] [2020-10-05 23:50:24,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:50:24,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:24,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:50:24,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:50:24,547 INFO L87 Difference]: Start difference. First operand 2085 states and 7975 transitions. Second operand 16 states. [2020-10-05 23:50:25,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:25,422 INFO L93 Difference]: Finished difference Result 5907 states and 18375 transitions. [2020-10-05 23:50:25,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:50:25,423 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:50:25,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:25,432 INFO L225 Difference]: With dead ends: 5907 [2020-10-05 23:50:25,433 INFO L226 Difference]: Without dead ends: 5899 [2020-10-05 23:50:25,433 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:50:25,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2020-10-05 23:50:25,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 2008. [2020-10-05 23:50:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2008 states. [2020-10-05 23:50:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 7698 transitions. [2020-10-05 23:50:25,516 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 7698 transitions. Word has length 21 [2020-10-05 23:50:25,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:25,516 INFO L479 AbstractCegarLoop]: Abstraction has 2008 states and 7698 transitions. [2020-10-05 23:50:25,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:50:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 7698 transitions. [2020-10-05 23:50:25,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:50:25,518 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:25,518 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:25,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-10-05 23:50:25,733 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:25,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:25,733 INFO L82 PathProgramCache]: Analyzing trace with hash -675948728, now seen corresponding path program 4 times [2020-10-05 23:50:25,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:25,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491677502] [2020-10-05 23:50:25,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:25,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491677502] [2020-10-05 23:50:25,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226033494] [2020-10-05 23:50:25,824 INFO L93 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 [2020-10-05 23:50:25,893 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:50:25,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:50:25,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:50:25,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:26,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:26,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:50:26,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916021862] [2020-10-05 23:50:26,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:50:26,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:26,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:50:26,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:50:26,016 INFO L87 Difference]: Start difference. First operand 2008 states and 7698 transitions. Second operand 16 states. [2020-10-05 23:50:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:26,856 INFO L93 Difference]: Finished difference Result 5835 states and 18155 transitions. [2020-10-05 23:50:26,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:50:26,857 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:50:26,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:26,866 INFO L225 Difference]: With dead ends: 5835 [2020-10-05 23:50:26,866 INFO L226 Difference]: Without dead ends: 5824 [2020-10-05 23:50:26,867 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:50:26,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2020-10-05 23:50:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 1976. [2020-10-05 23:50:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2020-10-05 23:50:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 7567 transitions. [2020-10-05 23:50:27,031 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 7567 transitions. Word has length 21 [2020-10-05 23:50:27,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:27,031 INFO L479 AbstractCegarLoop]: Abstraction has 1976 states and 7567 transitions. [2020-10-05 23:50:27,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:50:27,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 7567 transitions. [2020-10-05 23:50:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:50:27,034 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:27,034 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:27,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-10-05 23:50:27,249 INFO L427 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:27,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:27,249 INFO L82 PathProgramCache]: Analyzing trace with hash -409607608, now seen corresponding path program 5 times [2020-10-05 23:50:27,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:27,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179272821] [2020-10-05 23:50:27,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:50:27,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179272821] [2020-10-05 23:50:27,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:27,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:50:27,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572464621] [2020-10-05 23:50:27,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:50:27,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:27,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:50:27,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:50:27,345 INFO L87 Difference]: Start difference. First operand 1976 states and 7567 transitions. Second operand 9 states. [2020-10-05 23:50:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:28,008 INFO L93 Difference]: Finished difference Result 5820 states and 18126 transitions. [2020-10-05 23:50:28,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:50:28,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:50:28,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:28,020 INFO L225 Difference]: With dead ends: 5820 [2020-10-05 23:50:28,020 INFO L226 Difference]: Without dead ends: 5812 [2020-10-05 23:50:28,021 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:50:28,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5812 states. [2020-10-05 23:50:28,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5812 to 1907. [2020-10-05 23:50:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2020-10-05 23:50:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 7310 transitions. [2020-10-05 23:50:28,088 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 7310 transitions. Word has length 21 [2020-10-05 23:50:28,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:28,089 INFO L479 AbstractCegarLoop]: Abstraction has 1907 states and 7310 transitions. [2020-10-05 23:50:28,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:50:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 7310 transitions. [2020-10-05 23:50:28,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:50:28,090 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:28,090 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:28,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-05 23:50:28,091 INFO L427 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:28,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:28,091 INFO L82 PathProgramCache]: Analyzing trace with hash -395441848, now seen corresponding path program 6 times [2020-10-05 23:50:28,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:28,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318426212] [2020-10-05 23:50:28,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:50:28,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318426212] [2020-10-05 23:50:28,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:28,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:50:28,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609862141] [2020-10-05 23:50:28,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:50:28,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:28,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:50:28,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:50:28,160 INFO L87 Difference]: Start difference. First operand 1907 states and 7310 transitions. Second operand 9 states. [2020-10-05 23:50:28,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:28,895 INFO L93 Difference]: Finished difference Result 5717 states and 17784 transitions. [2020-10-05 23:50:28,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:50:28,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:50:28,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:28,906 INFO L225 Difference]: With dead ends: 5717 [2020-10-05 23:50:28,906 INFO L226 Difference]: Without dead ends: 5705 [2020-10-05 23:50:28,907 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:50:28,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2020-10-05 23:50:28,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 1800. [2020-10-05 23:50:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2020-10-05 23:50:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 6961 transitions. [2020-10-05 23:50:28,999 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 6961 transitions. Word has length 21 [2020-10-05 23:50:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:29,000 INFO L479 AbstractCegarLoop]: Abstraction has 1800 states and 6961 transitions. [2020-10-05 23:50:29,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:50:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 6961 transitions. [2020-10-05 23:50:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:50:29,001 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:29,002 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:29,002 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-05 23:50:29,002 INFO L427 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:29,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:29,002 INFO L82 PathProgramCache]: Analyzing trace with hash -334654421, now seen corresponding path program 1 times [2020-10-05 23:50:29,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:29,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601693897] [2020-10-05 23:50:29,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:50:29,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601693897] [2020-10-05 23:50:29,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:29,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:50:29,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392746655] [2020-10-05 23:50:29,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:50:29,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:29,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:50:29,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:50:29,039 INFO L87 Difference]: Start difference. First operand 1800 states and 6961 transitions. Second operand 5 states. [2020-10-05 23:50:29,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:29,140 INFO L93 Difference]: Finished difference Result 2762 states and 9976 transitions. [2020-10-05 23:50:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:50:29,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-05 23:50:29,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:29,148 INFO L225 Difference]: With dead ends: 2762 [2020-10-05 23:50:29,148 INFO L226 Difference]: Without dead ends: 2746 [2020-10-05 23:50:29,148 INFO L675 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 [2020-10-05 23:50:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2020-10-05 23:50:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 1965. [2020-10-05 23:50:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2020-10-05 23:50:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2020-10-05 23:50:29,277 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2020-10-05 23:50:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:29,277 INFO L479 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2020-10-05 23:50:29,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:50:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2020-10-05 23:50:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:50:29,279 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:29,279 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:29,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-05 23:50:29,280 INFO L427 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:50:29,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:29,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1788555247, now seen corresponding path program 1 times [2020-10-05 23:50:29,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:29,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345635739] [2020-10-05 23:50:29,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:50:29,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:50:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:50:29,295 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:50:29,303 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:50:29,303 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:50:29,303 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-05 23:50:29,303 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:50:29,304 WARN L363 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:50:29,304 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-10-05 23:50:29,316 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,317 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,317 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,317 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,317 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,317 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,317 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,318 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,318 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,318 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,318 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,318 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,318 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,318 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,319 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,319 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,319 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,319 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,319 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,319 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,319 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,320 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,320 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,320 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,320 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,320 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,320 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,321 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,321 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,321 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,321 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,321 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,321 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,321 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,322 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,329 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,329 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,329 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,329 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,330 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,333 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,334 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,334 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,334 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,334 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,337 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,338 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,338 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,338 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,338 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,343 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,344 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,344 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,344 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,344 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,347 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,347 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,348 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,348 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,348 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,349 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,349 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,350 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,350 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,351 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,351 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,352 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,352 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,353 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,354 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,354 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,355 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,355 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,356 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,356 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,357 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,357 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,358 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:50:29,359 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-05 23:50:29,359 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:50:29,360 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:50:29,360 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:50:29,360 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:50:29,360 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:50:29,360 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:50:29,360 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:50:29,360 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:50:29,362 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 122 transitions, 334 flow [2020-10-05 23:50:29,362 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 122 transitions, 334 flow [2020-10-05 23:50:29,381 INFO L129 PetriNetUnfolder]: 8/152 cut-off events. [2020-10-05 23:50:29,382 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-05 23:50:29,384 INFO L80 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 152 events. 8/152 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 251 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 179. Up to 12 conditions per place. [2020-10-05 23:50:29,389 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 122 transitions, 334 flow [2020-10-05 23:50:29,407 INFO L129 PetriNetUnfolder]: 8/152 cut-off events. [2020-10-05 23:50:29,408 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-05 23:50:29,409 INFO L80 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 152 events. 8/152 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 251 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 179. Up to 12 conditions per place. [2020-10-05 23:50:29,415 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2264 [2020-10-05 23:50:29,415 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:50:31,206 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2020-10-05 23:50:31,425 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-10-05 23:50:31,527 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2999 [2020-10-05 23:50:31,527 INFO L214 etLargeBlockEncoding]: Total number of compositions: 104 [2020-10-05 23:50:31,529 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 39 transitions, 168 flow [2020-10-05 23:50:31,940 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2020-10-05 23:50:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2020-10-05 23:50:31,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:50:31,940 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:31,940 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:50:31,941 INFO L427 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]=== [2020-10-05 23:50:31,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:31,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1026170, now seen corresponding path program 1 times [2020-10-05 23:50:31,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:31,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728924909] [2020-10-05 23:50:31,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:31,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:31,954 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728924909] [2020-10-05 23:50:31,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:31,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:50:31,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053862909] [2020-10-05 23:50:31,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:50:31,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:31,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:50:31,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:50:31,956 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2020-10-05 23:50:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:32,036 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2020-10-05 23:50:32,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:50:32,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:50:32,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:32,056 INFO L225 Difference]: With dead ends: 5844 [2020-10-05 23:50:32,057 INFO L226 Difference]: Without dead ends: 5479 [2020-10-05 23:50:32,059 INFO L675 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 [2020-10-05 23:50:32,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-10-05 23:50:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-10-05 23:50:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-10-05 23:50:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 24493 transitions. [2020-10-05 23:50:32,354 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 24493 transitions. Word has length 3 [2020-10-05 23:50:32,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:32,354 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 24493 transitions. [2020-10-05 23:50:32,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:50:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 24493 transitions. [2020-10-05 23:50:32,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:50:32,355 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:32,355 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:32,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-05 23:50:32,356 INFO L427 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]=== [2020-10-05 23:50:32,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:32,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1344335463, now seen corresponding path program 1 times [2020-10-05 23:50:32,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:32,357 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791150549] [2020-10-05 23:50:32,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:32,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791150549] [2020-10-05 23:50:32,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:32,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:50:32,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170879717] [2020-10-05 23:50:32,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:50:32,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:32,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:50:32,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:50:32,413 INFO L87 Difference]: Start difference. First operand 5479 states and 24493 transitions. Second operand 5 states. [2020-10-05 23:50:32,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:32,611 INFO L93 Difference]: Finished difference Result 9673 states and 40333 transitions. [2020-10-05 23:50:32,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:50:32,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:50:32,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:32,645 INFO L225 Difference]: With dead ends: 9673 [2020-10-05 23:50:32,645 INFO L226 Difference]: Without dead ends: 9666 [2020-10-05 23:50:32,647 INFO L675 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 [2020-10-05 23:50:32,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9666 states. [2020-10-05 23:50:32,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 6331. [2020-10-05 23:50:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6331 states. [2020-10-05 23:50:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6331 states to 6331 states and 28544 transitions. [2020-10-05 23:50:32,947 INFO L78 Accepts]: Start accepts. Automaton has 6331 states and 28544 transitions. Word has length 9 [2020-10-05 23:50:32,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:32,947 INFO L479 AbstractCegarLoop]: Abstraction has 6331 states and 28544 transitions. [2020-10-05 23:50:32,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:50:32,947 INFO L276 IsEmpty]: Start isEmpty. Operand 6331 states and 28544 transitions. [2020-10-05 23:50:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:50:32,947 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:32,948 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:32,948 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-05 23:50:32,948 INFO L427 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]=== [2020-10-05 23:50:32,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:32,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1513378118, now seen corresponding path program 1 times [2020-10-05 23:50:32,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:32,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441812815] [2020-10-05 23:50:32,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:32,977 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441812815] [2020-10-05 23:50:32,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:32,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:50:32,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521783472] [2020-10-05 23:50:32,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:50:32,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:32,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:50:32,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:50:32,978 INFO L87 Difference]: Start difference. First operand 6331 states and 28544 transitions. Second operand 5 states. [2020-10-05 23:50:33,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:33,803 INFO L93 Difference]: Finished difference Result 11081 states and 46826 transitions. [2020-10-05 23:50:33,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:50:33,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:50:33,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:33,853 INFO L225 Difference]: With dead ends: 11081 [2020-10-05 23:50:33,854 INFO L226 Difference]: Without dead ends: 11068 [2020-10-05 23:50:33,855 INFO L675 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 [2020-10-05 23:50:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11068 states. [2020-10-05 23:50:34,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11068 to 7391. [2020-10-05 23:50:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7391 states. [2020-10-05 23:50:34,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 33694 transitions. [2020-10-05 23:50:34,178 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 33694 transitions. Word has length 13 [2020-10-05 23:50:34,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:34,178 INFO L479 AbstractCegarLoop]: Abstraction has 7391 states and 33694 transitions. [2020-10-05 23:50:34,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:50:34,178 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 33694 transitions. [2020-10-05 23:50:34,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:50:34,179 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:34,179 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:34,179 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-05 23:50:34,179 INFO L427 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]=== [2020-10-05 23:50:34,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:34,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1678648171, now seen corresponding path program 1 times [2020-10-05 23:50:34,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:34,180 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834524635] [2020-10-05 23:50:34,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:34,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:34,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834524635] [2020-10-05 23:50:34,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103966902] [2020-10-05 23:50:34,223 INFO L95 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 [2020-10-05 23:50:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:34,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:50:34,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:34,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:34,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:50:34,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319502108] [2020-10-05 23:50:34,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:50:34,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:34,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:50:34,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:50:34,362 INFO L87 Difference]: Start difference. First operand 7391 states and 33694 transitions. Second operand 12 states. [2020-10-05 23:50:34,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:34,744 INFO L93 Difference]: Finished difference Result 16749 states and 66010 transitions. [2020-10-05 23:50:34,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:34,745 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-05 23:50:34,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:34,798 INFO L225 Difference]: With dead ends: 16749 [2020-10-05 23:50:34,798 INFO L226 Difference]: Without dead ends: 16736 [2020-10-05 23:50:34,799 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:50:34,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16736 states. [2020-10-05 23:50:35,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16736 to 7303. [2020-10-05 23:50:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2020-10-05 23:50:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 33260 transitions. [2020-10-05 23:50:35,333 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 33260 transitions. Word has length 15 [2020-10-05 23:50:35,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:35,334 INFO L479 AbstractCegarLoop]: Abstraction has 7303 states and 33260 transitions. [2020-10-05 23:50:35,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:50:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 33260 transitions. [2020-10-05 23:50:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:50:35,334 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:35,335 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:35,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:50:35,536 INFO L427 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]=== [2020-10-05 23:50:35,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:35,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1637555113, now seen corresponding path program 2 times [2020-10-05 23:50:35,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:35,537 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019530492] [2020-10-05 23:50:35,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:35,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019530492] [2020-10-05 23:50:35,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:35,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:50:35,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044639112] [2020-10-05 23:50:35,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:50:35,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:35,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:50:35,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:50:35,585 INFO L87 Difference]: Start difference. First operand 7303 states and 33260 transitions. Second operand 7 states. [2020-10-05 23:50:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:35,969 INFO L93 Difference]: Finished difference Result 17085 states and 67393 transitions. [2020-10-05 23:50:35,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:35,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:50:35,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:36,016 INFO L225 Difference]: With dead ends: 17085 [2020-10-05 23:50:36,016 INFO L226 Difference]: Without dead ends: 17071 [2020-10-05 23:50:36,016 INFO L675 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 [2020-10-05 23:50:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17071 states. [2020-10-05 23:50:36,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17071 to 7048. [2020-10-05 23:50:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7048 states. [2020-10-05 23:50:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 32136 transitions. [2020-10-05 23:50:36,318 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 32136 transitions. Word has length 15 [2020-10-05 23:50:36,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:36,318 INFO L479 AbstractCegarLoop]: Abstraction has 7048 states and 32136 transitions. [2020-10-05 23:50:36,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:50:36,318 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 32136 transitions. [2020-10-05 23:50:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:50:36,318 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:36,319 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:36,319 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-05 23:50:36,319 INFO L427 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]=== [2020-10-05 23:50:36,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:36,319 INFO L82 PathProgramCache]: Analyzing trace with hash -288445665, now seen corresponding path program 1 times [2020-10-05 23:50:36,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:36,319 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934105068] [2020-10-05 23:50:36,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:50:36,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934105068] [2020-10-05 23:50:36,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:36,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:50:36,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814763472] [2020-10-05 23:50:36,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:50:36,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:36,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:50:36,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:50:36,359 INFO L87 Difference]: Start difference. First operand 7048 states and 32136 transitions. Second operand 5 states. [2020-10-05 23:50:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:36,512 INFO L93 Difference]: Finished difference Result 12234 states and 52488 transitions. [2020-10-05 23:50:36,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:50:36,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:50:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:36,543 INFO L225 Difference]: With dead ends: 12234 [2020-10-05 23:50:36,544 INFO L226 Difference]: Without dead ends: 12212 [2020-10-05 23:50:36,544 INFO L675 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 [2020-10-05 23:50:36,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2020-10-05 23:50:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 8342. [2020-10-05 23:50:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8342 states. [2020-10-05 23:50:36,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8342 states to 8342 states and 38278 transitions. [2020-10-05 23:50:36,797 INFO L78 Accepts]: Start accepts. Automaton has 8342 states and 38278 transitions. Word has length 17 [2020-10-05 23:50:36,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:36,797 INFO L479 AbstractCegarLoop]: Abstraction has 8342 states and 38278 transitions. [2020-10-05 23:50:36,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:50:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 8342 states and 38278 transitions. [2020-10-05 23:50:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:50:36,798 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:36,798 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:36,798 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-05 23:50:36,799 INFO L427 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]=== [2020-10-05 23:50:36,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:36,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1255672082, now seen corresponding path program 1 times [2020-10-05 23:50:36,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:36,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818733775] [2020-10-05 23:50:36,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:50:36,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818733775] [2020-10-05 23:50:36,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511744025] [2020-10-05 23:50:36,846 INFO L95 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 [2020-10-05 23:50:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:36,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:50:36,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:37,128 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:50:37,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:37,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:50:37,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988228487] [2020-10-05 23:50:37,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:50:37,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:37,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:50:37,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:50:37,130 INFO L87 Difference]: Start difference. First operand 8342 states and 38278 transitions. Second operand 12 states. [2020-10-05 23:50:37,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:37,501 INFO L93 Difference]: Finished difference Result 19016 states and 76191 transitions. [2020-10-05 23:50:37,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:37,502 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:50:37,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:37,548 INFO L225 Difference]: With dead ends: 19016 [2020-10-05 23:50:37,549 INFO L226 Difference]: Without dead ends: 18998 [2020-10-05 23:50:37,549 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:50:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18998 states. [2020-10-05 23:50:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18998 to 8452. [2020-10-05 23:50:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8452 states. [2020-10-05 23:50:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8452 states to 8452 states and 38704 transitions. [2020-10-05 23:50:37,877 INFO L78 Accepts]: Start accepts. Automaton has 8452 states and 38704 transitions. Word has length 19 [2020-10-05 23:50:37,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:37,877 INFO L479 AbstractCegarLoop]: Abstraction has 8452 states and 38704 transitions. [2020-10-05 23:50:37,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:50:37,877 INFO L276 IsEmpty]: Start isEmpty. Operand 8452 states and 38704 transitions. [2020-10-05 23:50:37,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:50:37,878 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:37,878 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:38,092 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-10-05 23:50:38,093 INFO L427 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]=== [2020-10-05 23:50:38,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:38,093 INFO L82 PathProgramCache]: Analyzing trace with hash 402059005, now seen corresponding path program 1 times [2020-10-05 23:50:38,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:38,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304074414] [2020-10-05 23:50:38,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:38,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304074414] [2020-10-05 23:50:38,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191485440] [2020-10-05 23:50:38,139 INFO L95 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 [2020-10-05 23:50:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:38,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:50:38,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:38,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:38,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:38,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:50:38,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786642694] [2020-10-05 23:50:38,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:50:38,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:38,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:50:38,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:50:38,308 INFO L87 Difference]: Start difference. First operand 8452 states and 38704 transitions. Second operand 12 states. [2020-10-05 23:50:38,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:38,763 INFO L93 Difference]: Finished difference Result 19670 states and 79028 transitions. [2020-10-05 23:50:38,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:38,764 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:50:38,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:38,846 INFO L225 Difference]: With dead ends: 19670 [2020-10-05 23:50:38,846 INFO L226 Difference]: Without dead ends: 19645 [2020-10-05 23:50:38,847 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:50:39,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19645 states. [2020-10-05 23:50:39,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19645 to 8480. [2020-10-05 23:50:39,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8480 states. [2020-10-05 23:50:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 38825 transitions. [2020-10-05 23:50:39,412 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 38825 transitions. Word has length 19 [2020-10-05 23:50:39,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:39,412 INFO L479 AbstractCegarLoop]: Abstraction has 8480 states and 38825 transitions. [2020-10-05 23:50:39,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:50:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 38825 transitions. [2020-10-05 23:50:39,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:50:39,413 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:39,413 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:39,614 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-10-05 23:50:39,614 INFO L427 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]=== [2020-10-05 23:50:39,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:39,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1976597437, now seen corresponding path program 2 times [2020-10-05 23:50:39,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:39,615 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175818743] [2020-10-05 23:50:39,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:39,668 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:50:39,668 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175818743] [2020-10-05 23:50:39,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:39,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:50:39,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696663841] [2020-10-05 23:50:39,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:50:39,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:39,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:50:39,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:50:39,669 INFO L87 Difference]: Start difference. First operand 8480 states and 38825 transitions. Second operand 7 states. [2020-10-05 23:50:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:40,045 INFO L93 Difference]: Finished difference Result 19852 states and 79846 transitions. [2020-10-05 23:50:40,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:40,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:50:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:40,104 INFO L225 Difference]: With dead ends: 19852 [2020-10-05 23:50:40,104 INFO L226 Difference]: Without dead ends: 19827 [2020-10-05 23:50:40,104 INFO L675 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 [2020-10-05 23:50:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19827 states. [2020-10-05 23:50:40,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19827 to 8379. [2020-10-05 23:50:40,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8379 states. [2020-10-05 23:50:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8379 states to 8379 states and 38406 transitions. [2020-10-05 23:50:40,473 INFO L78 Accepts]: Start accepts. Automaton has 8379 states and 38406 transitions. Word has length 19 [2020-10-05 23:50:40,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:40,473 INFO L479 AbstractCegarLoop]: Abstraction has 8379 states and 38406 transitions. [2020-10-05 23:50:40,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:50:40,473 INFO L276 IsEmpty]: Start isEmpty. Operand 8379 states and 38406 transitions. [2020-10-05 23:50:40,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:50:40,474 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:40,474 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:40,474 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-05 23:50:40,475 INFO L427 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]=== [2020-10-05 23:50:40,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:40,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1976577008, now seen corresponding path program 2 times [2020-10-05 23:50:40,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:40,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160848735] [2020-10-05 23:50:40,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:40,522 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:50:40,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160848735] [2020-10-05 23:50:40,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:40,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:50:40,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076024419] [2020-10-05 23:50:40,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:50:40,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:40,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:50:40,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:50:40,524 INFO L87 Difference]: Start difference. First operand 8379 states and 38406 transitions. Second operand 7 states. [2020-10-05 23:50:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:40,903 INFO L93 Difference]: Finished difference Result 19555 states and 78564 transitions. [2020-10-05 23:50:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:40,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:50:40,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:40,957 INFO L225 Difference]: With dead ends: 19555 [2020-10-05 23:50:40,957 INFO L226 Difference]: Without dead ends: 19530 [2020-10-05 23:50:40,957 INFO L675 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 [2020-10-05 23:50:41,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2020-10-05 23:50:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 8317. [2020-10-05 23:50:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8317 states. [2020-10-05 23:50:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8317 states to 8317 states and 38184 transitions. [2020-10-05 23:50:41,474 INFO L78 Accepts]: Start accepts. Automaton has 8317 states and 38184 transitions. Word has length 19 [2020-10-05 23:50:41,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:41,474 INFO L479 AbstractCegarLoop]: Abstraction has 8317 states and 38184 transitions. [2020-10-05 23:50:41,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:50:41,474 INFO L276 IsEmpty]: Start isEmpty. Operand 8317 states and 38184 transitions. [2020-10-05 23:50:41,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:50:41,476 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:41,476 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:41,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-05 23:50:41,476 INFO L427 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]=== [2020-10-05 23:50:41,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:41,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1389591796, now seen corresponding path program 1 times [2020-10-05 23:50:41,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:41,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377070279] [2020-10-05 23:50:41,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:41,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377070279] [2020-10-05 23:50:41,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595353519] [2020-10-05 23:50:41,548 INFO L95 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 [2020-10-05 23:50:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:41,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:50:41,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:50:41,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:41,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:50:41,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818168394] [2020-10-05 23:50:41,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:50:41,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:41,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:50:41,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:50:41,737 INFO L87 Difference]: Start difference. First operand 8317 states and 38184 transitions. Second operand 16 states. [2020-10-05 23:50:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:42,742 INFO L93 Difference]: Finished difference Result 26969 states and 101544 transitions. [2020-10-05 23:50:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:50:42,742 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:50:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:42,805 INFO L225 Difference]: With dead ends: 26969 [2020-10-05 23:50:42,805 INFO L226 Difference]: Without dead ends: 26957 [2020-10-05 23:50:42,806 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:50:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26957 states. [2020-10-05 23:50:43,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26957 to 8204. [2020-10-05 23:50:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2020-10-05 23:50:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 37628 transitions. [2020-10-05 23:50:43,197 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 37628 transitions. Word has length 21 [2020-10-05 23:50:43,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:43,197 INFO L479 AbstractCegarLoop]: Abstraction has 8204 states and 37628 transitions. [2020-10-05 23:50:43,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:50:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 37628 transitions. [2020-10-05 23:50:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:50:43,198 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:43,198 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:43,402 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:50:43,402 INFO L427 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]=== [2020-10-05 23:50:43,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:43,403 INFO L82 PathProgramCache]: Analyzing trace with hash 184946636, now seen corresponding path program 2 times [2020-10-05 23:50:43,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:43,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607439763] [2020-10-05 23:50:43,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:43,470 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:50:43,470 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607439763] [2020-10-05 23:50:43,471 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742721754] [2020-10-05 23:50:43,471 INFO L93 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 [2020-10-05 23:50:43,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:50:43,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:50:43,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:50:43,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:50:43,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:43,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:50:43,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664899389] [2020-10-05 23:50:43,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:50:43,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:43,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:50:43,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:50:43,661 INFO L87 Difference]: Start difference. First operand 8204 states and 37628 transitions. Second operand 16 states. [2020-10-05 23:50:44,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:44,686 INFO L93 Difference]: Finished difference Result 26661 states and 100277 transitions. [2020-10-05 23:50:44,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:50:44,687 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:50:44,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:44,748 INFO L225 Difference]: With dead ends: 26661 [2020-10-05 23:50:44,748 INFO L226 Difference]: Without dead ends: 26645 [2020-10-05 23:50:44,749 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:50:44,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26645 states. [2020-10-05 23:50:45,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26645 to 8091. [2020-10-05 23:50:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8091 states. [2020-10-05 23:50:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8091 states to 8091 states and 37076 transitions. [2020-10-05 23:50:45,127 INFO L78 Accepts]: Start accepts. Automaton has 8091 states and 37076 transitions. Word has length 21 [2020-10-05 23:50:45,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:45,127 INFO L479 AbstractCegarLoop]: Abstraction has 8091 states and 37076 transitions. [2020-10-05 23:50:45,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:50:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 8091 states and 37076 transitions. [2020-10-05 23:50:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:50:45,128 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:45,128 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:45,335 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2020-10-05 23:50:45,336 INFO L427 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]=== [2020-10-05 23:50:45,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:45,336 INFO L82 PathProgramCache]: Analyzing trace with hash -231570740, now seen corresponding path program 3 times [2020-10-05 23:50:45,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:45,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979953450] [2020-10-05 23:50:45,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:45,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979953450] [2020-10-05 23:50:45,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933305076] [2020-10-05 23:50:45,414 INFO L93 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 [2020-10-05 23:50:45,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:50:45,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:50:45,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:50:45,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:45,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:45,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:50:45,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107214953] [2020-10-05 23:50:45,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:50:45,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:45,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:50:45,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:50:45,634 INFO L87 Difference]: Start difference. First operand 8091 states and 37076 transitions. Second operand 16 states. [2020-10-05 23:50:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:46,559 INFO L93 Difference]: Finished difference Result 26686 states and 100402 transitions. [2020-10-05 23:50:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:50:46,560 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:50:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:46,626 INFO L225 Difference]: With dead ends: 26686 [2020-10-05 23:50:46,627 INFO L226 Difference]: Without dead ends: 26674 [2020-10-05 23:50:46,627 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:50:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26674 states. [2020-10-05 23:50:47,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26674 to 7861. [2020-10-05 23:50:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7861 states. [2020-10-05 23:50:47,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 36066 transitions. [2020-10-05 23:50:47,191 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 36066 transitions. Word has length 21 [2020-10-05 23:50:47,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:47,191 INFO L479 AbstractCegarLoop]: Abstraction has 7861 states and 36066 transitions. [2020-10-05 23:50:47,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:50:47,192 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 36066 transitions. [2020-10-05 23:50:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:50:47,193 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:47,193 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:47,393 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:50:47,394 INFO L427 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]=== [2020-10-05 23:50:47,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:47,394 INFO L82 PathProgramCache]: Analyzing trace with hash -168366002, now seen corresponding path program 4 times [2020-10-05 23:50:47,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:47,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230654359] [2020-10-05 23:50:47,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:47,457 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230654359] [2020-10-05 23:50:47,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632659694] [2020-10-05 23:50:47,458 INFO L93 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 [2020-10-05 23:50:47,547 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:50:47,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:50:47,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:50:47,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:47,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:50:47,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:47,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:50:47,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127103662] [2020-10-05 23:50:47,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:50:47,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:47,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:50:47,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:50:47,666 INFO L87 Difference]: Start difference. First operand 7861 states and 36066 transitions. Second operand 16 states. [2020-10-05 23:50:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:48,675 INFO L93 Difference]: Finished difference Result 26489 states and 99650 transitions. [2020-10-05 23:50:48,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:50:48,676 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:50:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:48,748 INFO L225 Difference]: With dead ends: 26489 [2020-10-05 23:50:48,748 INFO L226 Difference]: Without dead ends: 26473 [2020-10-05 23:50:48,749 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:50:48,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26473 states. [2020-10-05 23:50:49,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26473 to 7748. [2020-10-05 23:50:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7748 states. [2020-10-05 23:50:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7748 states to 7748 states and 35514 transitions. [2020-10-05 23:50:49,135 INFO L78 Accepts]: Start accepts. Automaton has 7748 states and 35514 transitions. Word has length 21 [2020-10-05 23:50:49,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:49,136 INFO L479 AbstractCegarLoop]: Abstraction has 7748 states and 35514 transitions. [2020-10-05 23:50:49,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:50:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 7748 states and 35514 transitions. [2020-10-05 23:50:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:50:49,137 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:49,137 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:49,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2020-10-05 23:50:49,338 INFO L427 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]=== [2020-10-05 23:50:49,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:49,339 INFO L82 PathProgramCache]: Analyzing trace with hash 210203517, now seen corresponding path program 1 times [2020-10-05 23:50:49,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:49,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187434512] [2020-10-05 23:50:49,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:50:49,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187434512] [2020-10-05 23:50:49,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:49,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:50:49,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396275223] [2020-10-05 23:50:49,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:50:49,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:49,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:50:49,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:50:49,383 INFO L87 Difference]: Start difference. First operand 7748 states and 35514 transitions. Second operand 5 states. [2020-10-05 23:50:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:49,540 INFO L93 Difference]: Finished difference Result 13251 states and 57501 transitions. [2020-10-05 23:50:49,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:50:49,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-05 23:50:49,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:49,574 INFO L225 Difference]: With dead ends: 13251 [2020-10-05 23:50:49,574 INFO L226 Difference]: Without dead ends: 13220 [2020-10-05 23:50:49,574 INFO L675 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 [2020-10-05 23:50:49,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13220 states. [2020-10-05 23:50:49,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13220 to 9255. [2020-10-05 23:50:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9255 states. [2020-10-05 23:50:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9255 states to 9255 states and 42368 transitions. [2020-10-05 23:50:50,003 INFO L78 Accepts]: Start accepts. Automaton has 9255 states and 42368 transitions. Word has length 21 [2020-10-05 23:50:50,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:50,004 INFO L479 AbstractCegarLoop]: Abstraction has 9255 states and 42368 transitions. [2020-10-05 23:50:50,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:50:50,004 INFO L276 IsEmpty]: Start isEmpty. Operand 9255 states and 42368 transitions. [2020-10-05 23:50:50,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:50:50,005 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:50,006 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:50,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-10-05 23:50:50,006 INFO L427 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]=== [2020-10-05 23:50:50,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:50,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1134578958, now seen corresponding path program 5 times [2020-10-05 23:50:50,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:50,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468335641] [2020-10-05 23:50:50,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:50:50,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468335641] [2020-10-05 23:50:50,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:50,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:50:50,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944356722] [2020-10-05 23:50:50,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:50:50,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:50,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:50:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:50:50,083 INFO L87 Difference]: Start difference. First operand 9255 states and 42368 transitions. Second operand 9 states. [2020-10-05 23:50:50,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:50,949 INFO L93 Difference]: Finished difference Result 29788 states and 113841 transitions. [2020-10-05 23:50:50,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:50:50,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:50:50,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:51,022 INFO L225 Difference]: With dead ends: 29788 [2020-10-05 23:50:51,022 INFO L226 Difference]: Without dead ends: 29770 [2020-10-05 23:50:51,023 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:50:51,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29770 states. [2020-10-05 23:50:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29770 to 8964. [2020-10-05 23:50:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2020-10-05 23:50:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 41031 transitions. [2020-10-05 23:50:51,515 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 41031 transitions. Word has length 21 [2020-10-05 23:50:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:51,516 INFO L479 AbstractCegarLoop]: Abstraction has 8964 states and 41031 transitions. [2020-10-05 23:50:51,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:50:51,516 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 41031 transitions. [2020-10-05 23:50:51,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:50:51,517 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:51,517 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:51,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-10-05 23:50:51,518 INFO L427 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]=== [2020-10-05 23:50:51,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:51,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1114967118, now seen corresponding path program 6 times [2020-10-05 23:50:51,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:51,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669658066] [2020-10-05 23:50:51,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:50:51,593 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669658066] [2020-10-05 23:50:51,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:51,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:50:51,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284082936] [2020-10-05 23:50:51,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:50:51,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:51,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:50:51,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:50:51,595 INFO L87 Difference]: Start difference. First operand 8964 states and 41031 transitions. Second operand 9 states. [2020-10-05 23:50:52,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:52,498 INFO L93 Difference]: Finished difference Result 29379 states and 112099 transitions. [2020-10-05 23:50:52,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:50:52,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:50:52,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:52,564 INFO L225 Difference]: With dead ends: 29379 [2020-10-05 23:50:52,564 INFO L226 Difference]: Without dead ends: 29356 [2020-10-05 23:50:52,564 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:50:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29356 states. [2020-10-05 23:50:53,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29356 to 8573. [2020-10-05 23:50:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8573 states. [2020-10-05 23:50:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8573 states to 8573 states and 39353 transitions. [2020-10-05 23:50:53,287 INFO L78 Accepts]: Start accepts. Automaton has 8573 states and 39353 transitions. Word has length 21 [2020-10-05 23:50:53,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:53,288 INFO L479 AbstractCegarLoop]: Abstraction has 8573 states and 39353 transitions. [2020-10-05 23:50:53,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:50:53,288 INFO L276 IsEmpty]: Start isEmpty. Operand 8573 states and 39353 transitions. [2020-10-05 23:50:53,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:50:53,289 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:53,289 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:53,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-10-05 23:50:53,290 INFO L427 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]=== [2020-10-05 23:50:53,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:53,290 INFO L82 PathProgramCache]: Analyzing trace with hash 715669452, now seen corresponding path program 1 times [2020-10-05 23:50:53,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:53,290 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299383384] [2020-10-05 23:50:53,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:50:53,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299383384] [2020-10-05 23:50:53,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835086430] [2020-10-05 23:50:53,334 INFO L95 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 [2020-10-05 23:50:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:53,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:50:53,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:50:53,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:53,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:50:53,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967959812] [2020-10-05 23:50:53,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:50:53,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:53,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:50:53,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:50:53,480 INFO L87 Difference]: Start difference. First operand 8573 states and 39353 transitions. Second operand 12 states. [2020-10-05 23:50:53,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:53,899 INFO L93 Difference]: Finished difference Result 19727 states and 80274 transitions. [2020-10-05 23:50:53,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:53,899 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:50:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:53,948 INFO L225 Difference]: With dead ends: 19727 [2020-10-05 23:50:53,949 INFO L226 Difference]: Without dead ends: 19703 [2020-10-05 23:50:53,949 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:50:54,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19703 states. [2020-10-05 23:50:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19703 to 8847. [2020-10-05 23:50:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2020-10-05 23:50:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40495 transitions. [2020-10-05 23:50:54,311 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40495 transitions. Word has length 23 [2020-10-05 23:50:54,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:54,311 INFO L479 AbstractCegarLoop]: Abstraction has 8847 states and 40495 transitions. [2020-10-05 23:50:54,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:50:54,311 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40495 transitions. [2020-10-05 23:50:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:50:54,313 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:54,313 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:54,514 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-10-05 23:50:54,514 INFO L427 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]=== [2020-10-05 23:50:54,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:54,515 INFO L82 PathProgramCache]: Analyzing trace with hash 504272987, now seen corresponding path program 1 times [2020-10-05 23:50:54,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:54,516 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227645433] [2020-10-05 23:50:54,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:54,559 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:50:54,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227645433] [2020-10-05 23:50:54,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138203899] [2020-10-05 23:50:54,560 INFO L95 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 [2020-10-05 23:50:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:54,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:50:54,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:50:54,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:54,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:50:54,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154014209] [2020-10-05 23:50:54,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:50:54,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:54,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:50:54,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:50:54,710 INFO L87 Difference]: Start difference. First operand 8847 states and 40495 transitions. Second operand 12 states. [2020-10-05 23:50:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:55,114 INFO L93 Difference]: Finished difference Result 20694 states and 84261 transitions. [2020-10-05 23:50:55,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:55,115 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:50:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:55,174 INFO L225 Difference]: With dead ends: 20694 [2020-10-05 23:50:55,174 INFO L226 Difference]: Without dead ends: 20666 [2020-10-05 23:50:55,175 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:50:55,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20666 states. [2020-10-05 23:50:55,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20666 to 9115. [2020-10-05 23:50:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9115 states. [2020-10-05 23:50:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9115 states to 9115 states and 41679 transitions. [2020-10-05 23:50:55,536 INFO L78 Accepts]: Start accepts. Automaton has 9115 states and 41679 transitions. Word has length 23 [2020-10-05 23:50:55,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:55,536 INFO L479 AbstractCegarLoop]: Abstraction has 9115 states and 41679 transitions. [2020-10-05 23:50:55,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:50:55,536 INFO L276 IsEmpty]: Start isEmpty. Operand 9115 states and 41679 transitions. [2020-10-05 23:50:55,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:50:55,538 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:55,538 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:55,738 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:50:55,739 INFO L427 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]=== [2020-10-05 23:50:55,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:55,739 INFO L82 PathProgramCache]: Analyzing trace with hash 591685125, now seen corresponding path program 1 times [2020-10-05 23:50:55,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:55,740 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18305497] [2020-10-05 23:50:55,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:50:55,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18305497] [2020-10-05 23:50:55,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814992957] [2020-10-05 23:50:55,786 INFO L95 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 [2020-10-05 23:50:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:55,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:50:55,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:50:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:50:55,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:50:55,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:50:55,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235904047] [2020-10-05 23:50:55,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:50:55,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:55,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:50:55,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:50:55,941 INFO L87 Difference]: Start difference. First operand 9115 states and 41679 transitions. Second operand 12 states. [2020-10-05 23:50:56,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:56,357 INFO L93 Difference]: Finished difference Result 21396 states and 87360 transitions. [2020-10-05 23:50:56,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:56,357 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:50:56,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:56,541 INFO L225 Difference]: With dead ends: 21396 [2020-10-05 23:50:56,542 INFO L226 Difference]: Without dead ends: 21359 [2020-10-05 23:50:56,542 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:50:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21359 states. [2020-10-05 23:50:56,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21359 to 9320. [2020-10-05 23:50:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9320 states. [2020-10-05 23:50:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9320 states to 9320 states and 42648 transitions. [2020-10-05 23:50:56,851 INFO L78 Accepts]: Start accepts. Automaton has 9320 states and 42648 transitions. Word has length 23 [2020-10-05 23:50:56,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:56,851 INFO L479 AbstractCegarLoop]: Abstraction has 9320 states and 42648 transitions. [2020-10-05 23:50:56,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:50:56,852 INFO L276 IsEmpty]: Start isEmpty. Operand 9320 states and 42648 transitions. [2020-10-05 23:50:56,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:50:56,853 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:56,853 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:57,054 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2020-10-05 23:50:57,054 INFO L427 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]=== [2020-10-05 23:50:57,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:57,055 INFO L82 PathProgramCache]: Analyzing trace with hash 142124187, now seen corresponding path program 2 times [2020-10-05 23:50:57,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:57,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107515175] [2020-10-05 23:50:57,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:50:57,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107515175] [2020-10-05 23:50:57,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:57,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:50:57,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670455739] [2020-10-05 23:50:57,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:50:57,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:57,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:50:57,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:50:57,108 INFO L87 Difference]: Start difference. First operand 9320 states and 42648 transitions. Second operand 7 states. [2020-10-05 23:50:57,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:57,505 INFO L93 Difference]: Finished difference Result 21489 states and 87752 transitions. [2020-10-05 23:50:57,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:57,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:50:57,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:57,558 INFO L225 Difference]: With dead ends: 21489 [2020-10-05 23:50:57,558 INFO L226 Difference]: Without dead ends: 21452 [2020-10-05 23:50:57,558 INFO L675 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 [2020-10-05 23:50:57,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21452 states. [2020-10-05 23:50:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21452 to 9401. [2020-10-05 23:50:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9401 states. [2020-10-05 23:50:57,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9401 states to 9401 states and 43010 transitions. [2020-10-05 23:50:57,931 INFO L78 Accepts]: Start accepts. Automaton has 9401 states and 43010 transitions. Word has length 23 [2020-10-05 23:50:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:57,932 INFO L479 AbstractCegarLoop]: Abstraction has 9401 states and 43010 transitions. [2020-10-05 23:50:57,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:50:57,932 INFO L276 IsEmpty]: Start isEmpty. Operand 9401 states and 43010 transitions. [2020-10-05 23:50:57,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:50:57,935 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:57,935 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:57,935 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-10-05 23:50:57,935 INFO L427 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]=== [2020-10-05 23:50:57,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:57,936 INFO L82 PathProgramCache]: Analyzing trace with hash 142117429, now seen corresponding path program 2 times [2020-10-05 23:50:57,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:57,936 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226490661] [2020-10-05 23:50:57,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:50:57,977 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226490661] [2020-10-05 23:50:57,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:57,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:50:57,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106243732] [2020-10-05 23:50:57,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:50:57,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:57,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:50:57,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:50:57,979 INFO L87 Difference]: Start difference. First operand 9401 states and 43010 transitions. Second operand 7 states. [2020-10-05 23:50:58,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:58,391 INFO L93 Difference]: Finished difference Result 21198 states and 86437 transitions. [2020-10-05 23:50:58,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:58,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:50:58,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:58,444 INFO L225 Difference]: With dead ends: 21198 [2020-10-05 23:50:58,444 INFO L226 Difference]: Without dead ends: 21161 [2020-10-05 23:50:58,444 INFO L675 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 [2020-10-05 23:50:58,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21161 states. [2020-10-05 23:50:58,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21161 to 9396. [2020-10-05 23:50:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9396 states. [2020-10-05 23:50:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9396 states to 9396 states and 42985 transitions. [2020-10-05 23:50:58,803 INFO L78 Accepts]: Start accepts. Automaton has 9396 states and 42985 transitions. Word has length 23 [2020-10-05 23:50:58,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:58,804 INFO L479 AbstractCegarLoop]: Abstraction has 9396 states and 42985 transitions. [2020-10-05 23:50:58,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:50:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 9396 states and 42985 transitions. [2020-10-05 23:50:58,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:50:58,806 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:58,806 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:58,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-10-05 23:50:58,806 INFO L427 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]=== [2020-10-05 23:50:58,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:58,807 INFO L82 PathProgramCache]: Analyzing trace with hash 142103758, now seen corresponding path program 2 times [2020-10-05 23:50:58,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:58,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402609981] [2020-10-05 23:50:58,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:50:58,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402609981] [2020-10-05 23:50:58,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:50:58,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:50:58,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814294762] [2020-10-05 23:50:58,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:50:58,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:50:58,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:50:58,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:50:58,857 INFO L87 Difference]: Start difference. First operand 9396 states and 42985 transitions. Second operand 7 states. [2020-10-05 23:50:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:50:59,248 INFO L93 Difference]: Finished difference Result 21067 states and 85734 transitions. [2020-10-05 23:50:59,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:50:59,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:50:59,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:50:59,301 INFO L225 Difference]: With dead ends: 21067 [2020-10-05 23:50:59,301 INFO L226 Difference]: Without dead ends: 21030 [2020-10-05 23:50:59,301 INFO L675 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 [2020-10-05 23:50:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21030 states. [2020-10-05 23:50:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21030 to 9426. [2020-10-05 23:50:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9426 states. [2020-10-05 23:50:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9426 states to 9426 states and 43057 transitions. [2020-10-05 23:50:59,793 INFO L78 Accepts]: Start accepts. Automaton has 9426 states and 43057 transitions. Word has length 23 [2020-10-05 23:50:59,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:50:59,794 INFO L479 AbstractCegarLoop]: Abstraction has 9426 states and 43057 transitions. [2020-10-05 23:50:59,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:50:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 9426 states and 43057 transitions. [2020-10-05 23:50:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:50:59,797 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:50:59,797 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:50:59,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-10-05 23:50:59,797 INFO L427 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]=== [2020-10-05 23:50:59,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:50:59,797 INFO L82 PathProgramCache]: Analyzing trace with hash 925732074, now seen corresponding path program 1 times [2020-10-05 23:50:59,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:50:59,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426279151] [2020-10-05 23:50:59,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:50:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:50:59,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426279151] [2020-10-05 23:50:59,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256114580] [2020-10-05 23:50:59,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-05 23:50:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:50:59,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:50:59,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:51:00,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:00,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:00,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453650567] [2020-10-05 23:51:00,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:00,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:00,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:00,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:00,024 INFO L87 Difference]: Start difference. First operand 9426 states and 43057 transitions. Second operand 16 states. [2020-10-05 23:51:01,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:01,156 INFO L93 Difference]: Finished difference Result 30145 states and 115754 transitions. [2020-10-05 23:51:01,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:01,157 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:51:01,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:01,230 INFO L225 Difference]: With dead ends: 30145 [2020-10-05 23:51:01,231 INFO L226 Difference]: Without dead ends: 30125 [2020-10-05 23:51:01,231 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:01,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30125 states. [2020-10-05 23:51:01,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30125 to 9338. [2020-10-05 23:51:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9338 states. [2020-10-05 23:51:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9338 states to 9338 states and 42582 transitions. [2020-10-05 23:51:01,702 INFO L78 Accepts]: Start accepts. Automaton has 9338 states and 42582 transitions. Word has length 25 [2020-10-05 23:51:01,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:01,702 INFO L479 AbstractCegarLoop]: Abstraction has 9338 states and 42582 transitions. [2020-10-05 23:51:01,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 9338 states and 42582 transitions. [2020-10-05 23:51:01,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:01,706 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:01,706 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:01,906 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2020-10-05 23:51:01,906 INFO L427 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]=== [2020-10-05 23:51:01,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:01,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1013144212, now seen corresponding path program 1 times [2020-10-05 23:51:01,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:01,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746822915] [2020-10-05 23:51:01,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:51:01,980 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746822915] [2020-10-05 23:51:01,980 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468286612] [2020-10-05 23:51:01,980 INFO L95 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 [2020-10-05 23:51:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:02,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:02,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:51:02,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:02,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:02,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645370076] [2020-10-05 23:51:02,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:02,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:02,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:02,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:02,160 INFO L87 Difference]: Start difference. First operand 9338 states and 42582 transitions. Second operand 16 states. [2020-10-05 23:51:03,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:03,140 INFO L93 Difference]: Finished difference Result 29696 states and 113916 transitions. [2020-10-05 23:51:03,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:03,140 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:51:03,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:03,212 INFO L225 Difference]: With dead ends: 29696 [2020-10-05 23:51:03,212 INFO L226 Difference]: Without dead ends: 29676 [2020-10-05 23:51:03,213 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:03,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29676 states. [2020-10-05 23:51:03,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29676 to 9291. [2020-10-05 23:51:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9291 states. [2020-10-05 23:51:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9291 states to 9291 states and 42295 transitions. [2020-10-05 23:51:03,878 INFO L78 Accepts]: Start accepts. Automaton has 9291 states and 42295 transitions. Word has length 25 [2020-10-05 23:51:03,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:03,878 INFO L479 AbstractCegarLoop]: Abstraction has 9291 states and 42295 transitions. [2020-10-05 23:51:03,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 9291 states and 42295 transitions. [2020-10-05 23:51:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:03,881 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:03,881 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:04,082 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2020-10-05 23:51:04,082 INFO L427 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]=== [2020-10-05 23:51:04,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:04,083 INFO L82 PathProgramCache]: Analyzing trace with hash 563583274, now seen corresponding path program 2 times [2020-10-05 23:51:04,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:04,084 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022151748] [2020-10-05 23:51:04,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:04,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022151748] [2020-10-05 23:51:04,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708643069] [2020-10-05 23:51:04,150 INFO L93 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 [2020-10-05 23:51:04,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:51:04,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:51:04,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:04,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:04,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:04,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:04,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996895441] [2020-10-05 23:51:04,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:04,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:04,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:04,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:04,342 INFO L87 Difference]: Start difference. First operand 9291 states and 42295 transitions. Second operand 16 states. [2020-10-05 23:51:05,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:05,342 INFO L93 Difference]: Finished difference Result 29267 states and 112142 transitions. [2020-10-05 23:51:05,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:05,343 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:51:05,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:05,415 INFO L225 Difference]: With dead ends: 29267 [2020-10-05 23:51:05,415 INFO L226 Difference]: Without dead ends: 29245 [2020-10-05 23:51:05,416 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:05,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2020-10-05 23:51:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 9288. [2020-10-05 23:51:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9288 states. [2020-10-05 23:51:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9288 states to 9288 states and 42242 transitions. [2020-10-05 23:51:05,878 INFO L78 Accepts]: Start accepts. Automaton has 9288 states and 42242 transitions. Word has length 25 [2020-10-05 23:51:05,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:05,878 INFO L479 AbstractCegarLoop]: Abstraction has 9288 states and 42242 transitions. [2020-10-05 23:51:05,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:05,878 INFO L276 IsEmpty]: Start isEmpty. Operand 9288 states and 42242 transitions. [2020-10-05 23:51:05,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:05,881 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:05,882 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:06,082 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2020-10-05 23:51:06,083 INFO L427 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]=== [2020-10-05 23:51:06,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:06,083 INFO L82 PathProgramCache]: Analyzing trace with hash 563576516, now seen corresponding path program 2 times [2020-10-05 23:51:06,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:06,084 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261663126] [2020-10-05 23:51:06,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:06,156 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261663126] [2020-10-05 23:51:06,157 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85013616] [2020-10-05 23:51:06,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:06,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:51:06,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:51:06,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:06,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:06,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:06,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:06,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577581767] [2020-10-05 23:51:06,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:06,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:06,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:06,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:06,342 INFO L87 Difference]: Start difference. First operand 9288 states and 42242 transitions. Second operand 16 states. [2020-10-05 23:51:07,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:07,417 INFO L93 Difference]: Finished difference Result 28920 states and 110796 transitions. [2020-10-05 23:51:07,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:07,418 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:51:07,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:07,484 INFO L225 Difference]: With dead ends: 28920 [2020-10-05 23:51:07,484 INFO L226 Difference]: Without dead ends: 28898 [2020-10-05 23:51:07,484 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28898 states. [2020-10-05 23:51:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28898 to 9176. [2020-10-05 23:51:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2020-10-05 23:51:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 41695 transitions. [2020-10-05 23:51:07,904 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 41695 transitions. Word has length 25 [2020-10-05 23:51:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:07,904 INFO L479 AbstractCegarLoop]: Abstraction has 9176 states and 41695 transitions. [2020-10-05 23:51:07,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 41695 transitions. [2020-10-05 23:51:07,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:07,907 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:07,907 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:08,107 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:08,108 INFO L427 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]=== [2020-10-05 23:51:08,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:08,109 INFO L82 PathProgramCache]: Analyzing trace with hash -2052215638, now seen corresponding path program 3 times [2020-10-05 23:51:08,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:08,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18822526] [2020-10-05 23:51:08,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-05 23:51:08,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18822526] [2020-10-05 23:51:08,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081171499] [2020-10-05 23:51:08,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:08,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-05 23:51:08,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:51:08,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:08,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-05 23:51:08,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:08,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:08,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598426637] [2020-10-05 23:51:08,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:08,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:08,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:08,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:08,373 INFO L87 Difference]: Start difference. First operand 9176 states and 41695 transitions. Second operand 16 states. [2020-10-05 23:51:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:09,472 INFO L93 Difference]: Finished difference Result 29038 states and 111216 transitions. [2020-10-05 23:51:09,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:09,472 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:51:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:09,538 INFO L225 Difference]: With dead ends: 29038 [2020-10-05 23:51:09,539 INFO L226 Difference]: Without dead ends: 29018 [2020-10-05 23:51:09,539 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:09,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29018 states. [2020-10-05 23:51:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29018 to 9000. [2020-10-05 23:51:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9000 states. [2020-10-05 23:51:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9000 states to 9000 states and 40897 transitions. [2020-10-05 23:51:09,963 INFO L78 Accepts]: Start accepts. Automaton has 9000 states and 40897 transitions. Word has length 25 [2020-10-05 23:51:09,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:09,963 INFO L479 AbstractCegarLoop]: Abstraction has 9000 states and 40897 transitions. [2020-10-05 23:51:09,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:09,963 INFO L276 IsEmpty]: Start isEmpty. Operand 9000 states and 40897 transitions. [2020-10-05 23:51:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:09,966 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:09,966 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:10,166 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2020-10-05 23:51:10,167 INFO L427 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]=== [2020-10-05 23:51:10,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:10,168 INFO L82 PathProgramCache]: Analyzing trace with hash -275395741, now seen corresponding path program 1 times [2020-10-05 23:51:10,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:10,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416858692] [2020-10-05 23:51:10,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:51:10,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416858692] [2020-10-05 23:51:10,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923617663] [2020-10-05 23:51:10,228 INFO L95 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 [2020-10-05 23:51:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:10,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:10,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:51:10,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:10,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:10,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066809709] [2020-10-05 23:51:10,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:10,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:10,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:10,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:10,402 INFO L87 Difference]: Start difference. First operand 9000 states and 40897 transitions. Second operand 16 states. [2020-10-05 23:51:11,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:11,449 INFO L93 Difference]: Finished difference Result 29417 states and 113034 transitions. [2020-10-05 23:51:11,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:11,449 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:51:11,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:11,516 INFO L225 Difference]: With dead ends: 29417 [2020-10-05 23:51:11,516 INFO L226 Difference]: Without dead ends: 29397 [2020-10-05 23:51:11,516 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29397 states. [2020-10-05 23:51:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29397 to 8990. [2020-10-05 23:51:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8990 states. [2020-10-05 23:51:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8990 states to 8990 states and 40786 transitions. [2020-10-05 23:51:11,943 INFO L78 Accepts]: Start accepts. Automaton has 8990 states and 40786 transitions. Word has length 25 [2020-10-05 23:51:11,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:11,943 INFO L479 AbstractCegarLoop]: Abstraction has 8990 states and 40786 transitions. [2020-10-05 23:51:11,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:11,943 INFO L276 IsEmpty]: Start isEmpty. Operand 8990 states and 40786 transitions. [2020-10-05 23:51:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:11,946 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:11,946 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:12,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:12,147 INFO L427 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]=== [2020-10-05 23:51:12,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:12,148 INFO L82 PathProgramCache]: Analyzing trace with hash -724963437, now seen corresponding path program 2 times [2020-10-05 23:51:12,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:12,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322307983] [2020-10-05 23:51:12,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:51:12,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322307983] [2020-10-05 23:51:12,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550456550] [2020-10-05 23:51:12,213 INFO L93 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 [2020-10-05 23:51:12,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:51:12,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:51:12,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:12,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:12,444 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:51:12,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:12,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:12,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016118810] [2020-10-05 23:51:12,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:12,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:12,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:12,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:12,446 INFO L87 Difference]: Start difference. First operand 8990 states and 40786 transitions. Second operand 16 states. [2020-10-05 23:51:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:13,739 INFO L93 Difference]: Finished difference Result 29064 states and 111552 transitions. [2020-10-05 23:51:13,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:13,740 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:51:13,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:13,839 INFO L225 Difference]: With dead ends: 29064 [2020-10-05 23:51:13,839 INFO L226 Difference]: Without dead ends: 29037 [2020-10-05 23:51:13,840 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29037 states. [2020-10-05 23:51:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29037 to 8953. [2020-10-05 23:51:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8953 states. [2020-10-05 23:51:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8953 states to 8953 states and 40609 transitions. [2020-10-05 23:51:14,491 INFO L78 Accepts]: Start accepts. Automaton has 8953 states and 40609 transitions. Word has length 25 [2020-10-05 23:51:14,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:14,493 INFO L479 AbstractCegarLoop]: Abstraction has 8953 states and 40609 transitions. [2020-10-05 23:51:14,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:14,493 INFO L276 IsEmpty]: Start isEmpty. Operand 8953 states and 40609 transitions. [2020-10-05 23:51:14,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:14,498 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:14,498 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:14,711 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2020-10-05 23:51:14,712 INFO L427 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]=== [2020-10-05 23:51:14,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:14,712 INFO L82 PathProgramCache]: Analyzing trace with hash -724977108, now seen corresponding path program 4 times [2020-10-05 23:51:14,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:14,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54940151] [2020-10-05 23:51:14,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:51:14,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54940151] [2020-10-05 23:51:14,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105864619] [2020-10-05 23:51:14,780 INFO L93 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 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 [2020-10-05 23:51:14,858 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:51:14,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:51:14,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:14,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:14,961 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:51:14,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:14,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:14,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361064918] [2020-10-05 23:51:14,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:14,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:14,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:14,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:14,963 INFO L87 Difference]: Start difference. First operand 8953 states and 40609 transitions. Second operand 16 states. [2020-10-05 23:51:15,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:15,905 INFO L93 Difference]: Finished difference Result 28523 states and 109227 transitions. [2020-10-05 23:51:15,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:15,905 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:51:15,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:15,979 INFO L225 Difference]: With dead ends: 28523 [2020-10-05 23:51:15,979 INFO L226 Difference]: Without dead ends: 28501 [2020-10-05 23:51:15,979 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28501 states. [2020-10-05 23:51:16,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28501 to 8841. [2020-10-05 23:51:16,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8841 states. [2020-10-05 23:51:16,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 40062 transitions. [2020-10-05 23:51:16,433 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 40062 transitions. Word has length 25 [2020-10-05 23:51:16,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:16,433 INFO L479 AbstractCegarLoop]: Abstraction has 8841 states and 40062 transitions. [2020-10-05 23:51:16,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:16,434 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 40062 transitions. [2020-10-05 23:51:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:16,437 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:16,438 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:16,638 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:16,639 INFO L427 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]=== [2020-10-05 23:51:16,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:16,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1969402905, now seen corresponding path program 3 times [2020-10-05 23:51:16,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:16,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612058314] [2020-10-05 23:51:16,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:16,701 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612058314] [2020-10-05 23:51:16,701 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366670246] [2020-10-05 23:51:16,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-10-05 23:51:16,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:51:16,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:51:16,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:16,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:16,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:16,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:16,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623482311] [2020-10-05 23:51:16,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:16,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:16,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:16,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:16,875 INFO L87 Difference]: Start difference. First operand 8841 states and 40062 transitions. Second operand 16 states. [2020-10-05 23:51:17,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:17,778 INFO L93 Difference]: Finished difference Result 28636 states and 109852 transitions. [2020-10-05 23:51:17,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:17,778 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:51:17,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:17,847 INFO L225 Difference]: With dead ends: 28636 [2020-10-05 23:51:17,847 INFO L226 Difference]: Without dead ends: 28616 [2020-10-05 23:51:17,848 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:17,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28616 states. [2020-10-05 23:51:18,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28616 to 8702. [2020-10-05 23:51:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8702 states. [2020-10-05 23:51:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8702 states to 8702 states and 39438 transitions. [2020-10-05 23:51:18,254 INFO L78 Accepts]: Start accepts. Automaton has 8702 states and 39438 transitions. Word has length 25 [2020-10-05 23:51:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:18,254 INFO L479 AbstractCegarLoop]: Abstraction has 8702 states and 39438 transitions. [2020-10-05 23:51:18,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 8702 states and 39438 transitions. [2020-10-05 23:51:18,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:18,258 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:18,258 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:18,463 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2020-10-05 23:51:18,464 INFO L427 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]=== [2020-10-05 23:51:18,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:18,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1576190868, now seen corresponding path program 3 times [2020-10-05 23:51:18,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:18,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798976128] [2020-10-05 23:51:18,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:18,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798976128] [2020-10-05 23:51:18,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760690481] [2020-10-05 23:51:18,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-10-05 23:51:18,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:51:18,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:51:18,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:18,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:18,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:18,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:18,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467176057] [2020-10-05 23:51:18,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:18,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:18,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:18,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:18,799 INFO L87 Difference]: Start difference. First operand 8702 states and 39438 transitions. Second operand 16 states. [2020-10-05 23:51:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:20,052 INFO L93 Difference]: Finished difference Result 28297 states and 108461 transitions. [2020-10-05 23:51:20,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:20,053 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:51:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:20,164 INFO L225 Difference]: With dead ends: 28297 [2020-10-05 23:51:20,164 INFO L226 Difference]: Without dead ends: 28277 [2020-10-05 23:51:20,165 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:20,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28277 states. [2020-10-05 23:51:20,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28277 to 8596. [2020-10-05 23:51:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8596 states. [2020-10-05 23:51:20,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8596 states to 8596 states and 38978 transitions. [2020-10-05 23:51:20,816 INFO L78 Accepts]: Start accepts. Automaton has 8596 states and 38978 transitions. Word has length 25 [2020-10-05 23:51:20,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:20,816 INFO L479 AbstractCegarLoop]: Abstraction has 8596 states and 38978 transitions. [2020-10-05 23:51:20,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 8596 states and 38978 transitions. [2020-10-05 23:51:20,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:20,820 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:20,820 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:21,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:21,035 INFO L427 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]=== [2020-10-05 23:51:21,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:21,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1673729315, now seen corresponding path program 4 times [2020-10-05 23:51:21,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:21,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776585290] [2020-10-05 23:51:21,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:21,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776585290] [2020-10-05 23:51:21,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188756858] [2020-10-05 23:51:21,100 INFO L93 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 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 [2020-10-05 23:51:21,172 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:51:21,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:51:21,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:21,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:21,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:21,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:21,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003503776] [2020-10-05 23:51:21,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:21,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:21,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:21,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:21,290 INFO L87 Difference]: Start difference. First operand 8596 states and 38978 transitions. Second operand 16 states. [2020-10-05 23:51:22,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:22,417 INFO L93 Difference]: Finished difference Result 28565 states and 109596 transitions. [2020-10-05 23:51:22,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:22,417 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:51:22,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:22,478 INFO L225 Difference]: With dead ends: 28565 [2020-10-05 23:51:22,478 INFO L226 Difference]: Without dead ends: 28538 [2020-10-05 23:51:22,478 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2020-10-05 23:51:22,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 8563. [2020-10-05 23:51:22,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8563 states. [2020-10-05 23:51:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8563 states to 8563 states and 38809 transitions. [2020-10-05 23:51:22,905 INFO L78 Accepts]: Start accepts. Automaton has 8563 states and 38809 transitions. Word has length 25 [2020-10-05 23:51:22,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:22,905 INFO L479 AbstractCegarLoop]: Abstraction has 8563 states and 38809 transitions. [2020-10-05 23:51:22,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:22,905 INFO L276 IsEmpty]: Start isEmpty. Operand 8563 states and 38809 transitions. [2020-10-05 23:51:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:22,908 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:22,909 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:23,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2020-10-05 23:51:23,109 INFO L427 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]=== [2020-10-05 23:51:23,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:23,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1673708886, now seen corresponding path program 4 times [2020-10-05 23:51:23,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:23,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957743090] [2020-10-05 23:51:23,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:23,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957743090] [2020-10-05 23:51:23,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969608579] [2020-10-05 23:51:23,175 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:23,276 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:51:23,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:51:23,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:51:23,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:23,401 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:51:23,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:23,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:51:23,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341366045] [2020-10-05 23:51:23,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:51:23,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:23,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:51:23,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:51:23,403 INFO L87 Difference]: Start difference. First operand 8563 states and 38809 transitions. Second operand 16 states. [2020-10-05 23:51:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:24,517 INFO L93 Difference]: Finished difference Result 28213 states and 108237 transitions. [2020-10-05 23:51:24,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:24,518 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:51:24,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:24,592 INFO L225 Difference]: With dead ends: 28213 [2020-10-05 23:51:24,592 INFO L226 Difference]: Without dead ends: 28186 [2020-10-05 23:51:24,593 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:51:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28186 states. [2020-10-05 23:51:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28186 to 8421. [2020-10-05 23:51:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8421 states. [2020-10-05 23:51:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8421 states to 8421 states and 38146 transitions. [2020-10-05 23:51:25,023 INFO L78 Accepts]: Start accepts. Automaton has 8421 states and 38146 transitions. Word has length 25 [2020-10-05 23:51:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:25,023 INFO L479 AbstractCegarLoop]: Abstraction has 8421 states and 38146 transitions. [2020-10-05 23:51:25,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:51:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 8421 states and 38146 transitions. [2020-10-05 23:51:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:25,027 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:25,027 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:25,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:25,228 INFO L427 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]=== [2020-10-05 23:51:25,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:25,228 INFO L82 PathProgramCache]: Analyzing trace with hash -857609261, now seen corresponding path program 5 times [2020-10-05 23:51:25,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:25,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206571847] [2020-10-05 23:51:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:51:25,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206571847] [2020-10-05 23:51:25,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:25,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:51:25,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462722943] [2020-10-05 23:51:25,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:51:25,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:25,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:51:25,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:51:25,300 INFO L87 Difference]: Start difference. First operand 8421 states and 38146 transitions. Second operand 9 states. [2020-10-05 23:51:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:26,226 INFO L93 Difference]: Finished difference Result 28226 states and 108274 transitions. [2020-10-05 23:51:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:26,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:51:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:26,290 INFO L225 Difference]: With dead ends: 28226 [2020-10-05 23:51:26,290 INFO L226 Difference]: Without dead ends: 28206 [2020-10-05 23:51:26,290 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:51:26,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28206 states. [2020-10-05 23:51:26,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28206 to 8277. [2020-10-05 23:51:26,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8277 states. [2020-10-05 23:51:26,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8277 states to 8277 states and 37487 transitions. [2020-10-05 23:51:26,884 INFO L78 Accepts]: Start accepts. Automaton has 8277 states and 37487 transitions. Word has length 25 [2020-10-05 23:51:26,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:26,885 INFO L479 AbstractCegarLoop]: Abstraction has 8277 states and 37487 transitions. [2020-10-05 23:51:26,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:51:26,885 INFO L276 IsEmpty]: Start isEmpty. Operand 8277 states and 37487 transitions. [2020-10-05 23:51:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:26,889 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:26,890 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:26,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-10-05 23:51:26,890 INFO L427 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]=== [2020-10-05 23:51:26,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:26,890 INFO L82 PathProgramCache]: Analyzing trace with hash -857622932, now seen corresponding path program 5 times [2020-10-05 23:51:26,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:26,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223242082] [2020-10-05 23:51:26,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:51:26,963 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223242082] [2020-10-05 23:51:26,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:26,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:51:26,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338820815] [2020-10-05 23:51:26,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:51:26,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:26,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:51:26,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:51:26,965 INFO L87 Difference]: Start difference. First operand 8277 states and 37487 transitions. Second operand 9 states. [2020-10-05 23:51:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:27,884 INFO L93 Difference]: Finished difference Result 27801 states and 106552 transitions. [2020-10-05 23:51:27,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:27,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:51:27,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:27,959 INFO L225 Difference]: With dead ends: 27801 [2020-10-05 23:51:27,959 INFO L226 Difference]: Without dead ends: 27781 [2020-10-05 23:51:27,959 INFO L675 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 [2020-10-05 23:51:28,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27781 states. [2020-10-05 23:51:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27781 to 8127. [2020-10-05 23:51:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8127 states. [2020-10-05 23:51:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8127 states to 8127 states and 36806 transitions. [2020-10-05 23:51:28,407 INFO L78 Accepts]: Start accepts. Automaton has 8127 states and 36806 transitions. Word has length 25 [2020-10-05 23:51:28,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:28,407 INFO L479 AbstractCegarLoop]: Abstraction has 8127 states and 36806 transitions. [2020-10-05 23:51:28,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:51:28,407 INFO L276 IsEmpty]: Start isEmpty. Operand 8127 states and 36806 transitions. [2020-10-05 23:51:28,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:28,410 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:28,410 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:28,411 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2020-10-05 23:51:28,411 INFO L427 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]=== [2020-10-05 23:51:28,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:28,411 INFO L82 PathProgramCache]: Analyzing trace with hash -864096941, now seen corresponding path program 6 times [2020-10-05 23:51:28,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:28,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184488109] [2020-10-05 23:51:28,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:51:28,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184488109] [2020-10-05 23:51:28,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:28,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:51:28,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216720392] [2020-10-05 23:51:28,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:51:28,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:28,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:51:28,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:51:28,477 INFO L87 Difference]: Start difference. First operand 8127 states and 36806 transitions. Second operand 9 states. [2020-10-05 23:51:29,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:29,400 INFO L93 Difference]: Finished difference Result 27548 states and 105447 transitions. [2020-10-05 23:51:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:29,401 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:51:29,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:29,462 INFO L225 Difference]: With dead ends: 27548 [2020-10-05 23:51:29,462 INFO L226 Difference]: Without dead ends: 27521 [2020-10-05 23:51:29,462 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:51:29,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27521 states. [2020-10-05 23:51:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27521 to 7841. [2020-10-05 23:51:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7841 states. [2020-10-05 23:51:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7841 states to 7841 states and 35578 transitions. [2020-10-05 23:51:29,863 INFO L78 Accepts]: Start accepts. Automaton has 7841 states and 35578 transitions. Word has length 25 [2020-10-05 23:51:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:29,863 INFO L479 AbstractCegarLoop]: Abstraction has 7841 states and 35578 transitions. [2020-10-05 23:51:29,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:51:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 7841 states and 35578 transitions. [2020-10-05 23:51:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:29,866 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:29,866 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:29,866 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2020-10-05 23:51:29,866 INFO L427 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]=== [2020-10-05 23:51:29,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:29,867 INFO L82 PathProgramCache]: Analyzing trace with hash -864117370, now seen corresponding path program 5 times [2020-10-05 23:51:29,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:29,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017626817] [2020-10-05 23:51:29,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:51:29,928 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017626817] [2020-10-05 23:51:29,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:29,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:51:29,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56936542] [2020-10-05 23:51:29,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:51:29,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:29,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:51:29,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:51:29,929 INFO L87 Difference]: Start difference. First operand 7841 states and 35578 transitions. Second operand 9 states. [2020-10-05 23:51:30,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:30,863 INFO L93 Difference]: Finished difference Result 27167 states and 103966 transitions. [2020-10-05 23:51:30,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:30,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:51:30,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:30,931 INFO L225 Difference]: With dead ends: 27167 [2020-10-05 23:51:30,932 INFO L226 Difference]: Without dead ends: 27147 [2020-10-05 23:51:30,932 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:51:31,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27147 states. [2020-10-05 23:51:31,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27147 to 7743. [2020-10-05 23:51:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7743 states. [2020-10-05 23:51:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7743 states to 7743 states and 35142 transitions. [2020-10-05 23:51:31,318 INFO L78 Accepts]: Start accepts. Automaton has 7743 states and 35142 transitions. Word has length 25 [2020-10-05 23:51:31,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:31,318 INFO L479 AbstractCegarLoop]: Abstraction has 7743 states and 35142 transitions. [2020-10-05 23:51:31,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:51:31,318 INFO L276 IsEmpty]: Start isEmpty. Operand 7743 states and 35142 transitions. [2020-10-05 23:51:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:31,321 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:31,321 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:31,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2020-10-05 23:51:31,321 INFO L427 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]=== [2020-10-05 23:51:31,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:31,322 INFO L82 PathProgramCache]: Analyzing trace with hash -877234772, now seen corresponding path program 6 times [2020-10-05 23:51:31,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:31,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846401077] [2020-10-05 23:51:31,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:51:31,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846401077] [2020-10-05 23:51:31,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:31,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:51:31,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922981975] [2020-10-05 23:51:31,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:51:31,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:31,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:51:31,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:51:31,383 INFO L87 Difference]: Start difference. First operand 7743 states and 35142 transitions. Second operand 9 states. [2020-10-05 23:51:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:32,305 INFO L93 Difference]: Finished difference Result 26955 states and 103085 transitions. [2020-10-05 23:51:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:32,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:51:32,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:32,372 INFO L225 Difference]: With dead ends: 26955 [2020-10-05 23:51:32,372 INFO L226 Difference]: Without dead ends: 26928 [2020-10-05 23:51:32,372 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:51:32,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26928 states. [2020-10-05 23:51:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26928 to 7532. [2020-10-05 23:51:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7532 states. [2020-10-05 23:51:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7532 states to 7532 states and 34256 transitions. [2020-10-05 23:51:32,891 INFO L78 Accepts]: Start accepts. Automaton has 7532 states and 34256 transitions. Word has length 25 [2020-10-05 23:51:32,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:32,891 INFO L479 AbstractCegarLoop]: Abstraction has 7532 states and 34256 transitions. [2020-10-05 23:51:32,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:51:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 7532 states and 34256 transitions. [2020-10-05 23:51:32,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:32,894 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:32,894 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:32,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2020-10-05 23:51:32,895 INFO L427 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]=== [2020-10-05 23:51:32,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:32,895 INFO L82 PathProgramCache]: Analyzing trace with hash -877241530, now seen corresponding path program 6 times [2020-10-05 23:51:32,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:32,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78031607] [2020-10-05 23:51:32,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:51:32,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78031607] [2020-10-05 23:51:32,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:32,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:51:32,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899456194] [2020-10-05 23:51:32,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:51:32,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:32,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:51:32,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:51:32,962 INFO L87 Difference]: Start difference. First operand 7532 states and 34256 transitions. Second operand 9 states. [2020-10-05 23:51:33,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:33,914 INFO L93 Difference]: Finished difference Result 26632 states and 101828 transitions. [2020-10-05 23:51:33,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:51:33,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:51:33,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:33,984 INFO L225 Difference]: With dead ends: 26632 [2020-10-05 23:51:33,984 INFO L226 Difference]: Without dead ends: 26605 [2020-10-05 23:51:33,985 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:51:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26605 states. [2020-10-05 23:51:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26605 to 7269. [2020-10-05 23:51:34,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7269 states. [2020-10-05 23:51:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7269 states to 7269 states and 33154 transitions. [2020-10-05 23:51:34,342 INFO L78 Accepts]: Start accepts. Automaton has 7269 states and 33154 transitions. Word has length 25 [2020-10-05 23:51:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:34,342 INFO L479 AbstractCegarLoop]: Abstraction has 7269 states and 33154 transitions. [2020-10-05 23:51:34,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:51:34,342 INFO L276 IsEmpty]: Start isEmpty. Operand 7269 states and 33154 transitions. [2020-10-05 23:51:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:51:34,345 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:34,345 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:34,345 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2020-10-05 23:51:34,345 INFO L427 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]=== [2020-10-05 23:51:34,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:34,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1311164244, now seen corresponding path program 1 times [2020-10-05 23:51:34,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:34,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113310796] [2020-10-05 23:51:34,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-05 23:51:34,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113310796] [2020-10-05 23:51:34,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:34,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:51:34,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413639330] [2020-10-05 23:51:34,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:51:34,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:34,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:51:34,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:51:34,378 INFO L87 Difference]: Start difference. First operand 7269 states and 33154 transitions. Second operand 5 states. [2020-10-05 23:51:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:34,531 INFO L93 Difference]: Finished difference Result 11919 states and 51979 transitions. [2020-10-05 23:51:34,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:51:34,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-10-05 23:51:34,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:34,558 INFO L225 Difference]: With dead ends: 11919 [2020-10-05 23:51:34,558 INFO L226 Difference]: Without dead ends: 11887 [2020-10-05 23:51:34,558 INFO L675 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 [2020-10-05 23:51:34,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2020-10-05 23:51:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 8560. [2020-10-05 23:51:34,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8560 states. [2020-10-05 23:51:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8560 states to 8560 states and 38495 transitions. [2020-10-05 23:51:34,800 INFO L78 Accepts]: Start accepts. Automaton has 8560 states and 38495 transitions. Word has length 25 [2020-10-05 23:51:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:34,800 INFO L479 AbstractCegarLoop]: Abstraction has 8560 states and 38495 transitions. [2020-10-05 23:51:34,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:51:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 8560 states and 38495 transitions. [2020-10-05 23:51:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-05 23:51:34,804 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:34,804 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:34,804 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-10-05 23:51:34,804 INFO L427 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]=== [2020-10-05 23:51:34,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:34,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1986416772, now seen corresponding path program 1 times [2020-10-05 23:51:34,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:34,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997785869] [2020-10-05 23:51:34,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:51:34,810 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:51:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:51:34,815 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:51:34,825 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:51:34,825 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:51:34,825 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2020-10-05 23:51:34,826 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:51:34,826 WARN L363 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:51:34,826 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2020-10-05 23:51:34,840 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,841 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,841 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,841 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,841 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,841 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,841 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,842 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,842 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,842 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,842 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,842 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,842 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,842 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,843 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,843 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,843 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,843 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,843 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,843 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,843 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,844 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,844 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,844 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,844 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,844 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,844 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,844 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,844 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,844 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,844 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,845 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,845 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,845 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,845 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,845 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,845 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,845 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,845 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,846 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,846 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,846 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,846 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,846 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,847 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,847 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,848 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,848 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,848 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,848 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,849 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,849 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,849 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,851 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,851 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,851 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,852 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,852 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,852 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,853 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,853 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,853 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,853 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,853 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,853 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,853 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,854 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,854 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,854 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,854 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,856 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,856 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,856 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,856 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,856 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,857 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,857 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,857 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,857 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,858 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,860 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,860 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,860 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,860 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,860 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,861 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,861 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,861 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,861 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,861 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,862 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,862 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,862 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,863 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,863 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,864 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,864 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,864 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,864 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,868 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,871 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,871 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,871 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:51:34,872 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-10-05 23:51:34,873 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:51:34,873 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:51:34,873 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:51:34,873 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:51:34,873 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:51:34,873 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:51:34,873 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:51:34,873 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:51:34,875 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 138 transitions, 396 flow [2020-10-05 23:51:34,875 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 156 places, 138 transitions, 396 flow [2020-10-05 23:51:34,894 INFO L129 PetriNetUnfolder]: 9/173 cut-off events. [2020-10-05 23:51:34,894 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-05 23:51:34,895 INFO L80 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 173 events. 9/173 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 284 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 208. Up to 14 conditions per place. [2020-10-05 23:51:34,900 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 156 places, 138 transitions, 396 flow [2020-10-05 23:51:34,921 INFO L129 PetriNetUnfolder]: 9/173 cut-off events. [2020-10-05 23:51:34,921 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-05 23:51:34,922 INFO L80 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 173 events. 9/173 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 284 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 208. Up to 14 conditions per place. [2020-10-05 23:51:34,929 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2020-10-05 23:51:34,929 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:51:36,854 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2020-10-05 23:51:37,152 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-10-05 23:51:37,299 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-05 23:51:37,307 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3678 [2020-10-05 23:51:37,307 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2020-10-05 23:51:37,307 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 45 transitions, 210 flow [2020-10-05 23:51:38,930 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2020-10-05 23:51:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2020-10-05 23:51:38,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:51:38,931 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:38,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:51:38,931 INFO L427 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]=== [2020-10-05 23:51:38,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:38,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1298891, now seen corresponding path program 1 times [2020-10-05 23:51:38,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:38,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173135630] [2020-10-05 23:51:38,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:38,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173135630] [2020-10-05 23:51:38,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:38,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:51:38,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122064214] [2020-10-05 23:51:38,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:51:38,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:38,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:51:38,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:51:38,940 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2020-10-05 23:51:39,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:39,333 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2020-10-05 23:51:39,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:51:39,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:51:39,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:39,389 INFO L225 Difference]: With dead ends: 17885 [2020-10-05 23:51:39,389 INFO L226 Difference]: Without dead ends: 16791 [2020-10-05 23:51:39,390 INFO L675 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 [2020-10-05 23:51:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2020-10-05 23:51:40,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16791. [2020-10-05 23:51:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16791 states. [2020-10-05 23:51:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16791 states to 16791 states and 86558 transitions. [2020-10-05 23:51:40,167 INFO L78 Accepts]: Start accepts. Automaton has 16791 states and 86558 transitions. Word has length 3 [2020-10-05 23:51:40,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:40,167 INFO L479 AbstractCegarLoop]: Abstraction has 16791 states and 86558 transitions. [2020-10-05 23:51:40,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:51:40,167 INFO L276 IsEmpty]: Start isEmpty. Operand 16791 states and 86558 transitions. [2020-10-05 23:51:40,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:51:40,168 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:40,168 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:40,168 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2020-10-05 23:51:40,168 INFO L427 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]=== [2020-10-05 23:51:40,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:40,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1091574945, now seen corresponding path program 1 times [2020-10-05 23:51:40,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:40,168 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209368541] [2020-10-05 23:51:40,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:40,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209368541] [2020-10-05 23:51:40,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:40,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:51:40,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296803241] [2020-10-05 23:51:40,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:51:40,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:40,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:51:40,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:51:40,192 INFO L87 Difference]: Start difference. First operand 16791 states and 86558 transitions. Second operand 5 states. [2020-10-05 23:51:40,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:40,490 INFO L93 Difference]: Finished difference Result 30985 states and 150574 transitions. [2020-10-05 23:51:40,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:51:40,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:51:40,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:40,607 INFO L225 Difference]: With dead ends: 30985 [2020-10-05 23:51:40,608 INFO L226 Difference]: Without dead ends: 30977 [2020-10-05 23:51:40,608 INFO L675 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 [2020-10-05 23:51:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30977 states. [2020-10-05 23:51:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30977 to 19868. [2020-10-05 23:51:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19868 states. [2020-10-05 23:51:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19868 states to 19868 states and 103363 transitions. [2020-10-05 23:51:41,660 INFO L78 Accepts]: Start accepts. Automaton has 19868 states and 103363 transitions. Word has length 9 [2020-10-05 23:51:41,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:41,660 INFO L479 AbstractCegarLoop]: Abstraction has 19868 states and 103363 transitions. [2020-10-05 23:51:41,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:51:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 19868 states and 103363 transitions. [2020-10-05 23:51:41,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:51:41,661 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:41,661 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:41,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2020-10-05 23:51:41,661 INFO L427 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]=== [2020-10-05 23:51:41,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:41,661 INFO L82 PathProgramCache]: Analyzing trace with hash -231509072, now seen corresponding path program 1 times [2020-10-05 23:51:41,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:41,661 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981383838] [2020-10-05 23:51:41,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:41,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981383838] [2020-10-05 23:51:41,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:41,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:51:41,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639124125] [2020-10-05 23:51:41,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:51:41,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:41,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:51:41,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:51:41,683 INFO L87 Difference]: Start difference. First operand 19868 states and 103363 transitions. Second operand 5 states. [2020-10-05 23:51:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:41,990 INFO L93 Difference]: Finished difference Result 36296 states and 178836 transitions. [2020-10-05 23:51:41,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:51:41,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:51:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:42,105 INFO L225 Difference]: With dead ends: 36296 [2020-10-05 23:51:42,105 INFO L226 Difference]: Without dead ends: 36280 [2020-10-05 23:51:42,105 INFO L675 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 [2020-10-05 23:51:42,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36280 states. [2020-10-05 23:51:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36280 to 23806. [2020-10-05 23:51:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23806 states. [2020-10-05 23:51:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23806 states to 23806 states and 125455 transitions. [2020-10-05 23:51:45,135 INFO L78 Accepts]: Start accepts. Automaton has 23806 states and 125455 transitions. Word has length 13 [2020-10-05 23:51:45,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:45,135 INFO L479 AbstractCegarLoop]: Abstraction has 23806 states and 125455 transitions. [2020-10-05 23:51:45,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:51:45,135 INFO L276 IsEmpty]: Start isEmpty. Operand 23806 states and 125455 transitions. [2020-10-05 23:51:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:51:45,135 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:45,135 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:45,135 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-10-05 23:51:45,136 INFO L427 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]=== [2020-10-05 23:51:45,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:45,136 INFO L82 PathProgramCache]: Analyzing trace with hash -588793474, now seen corresponding path program 1 times [2020-10-05 23:51:45,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:45,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310142672] [2020-10-05 23:51:45,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:45,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310142672] [2020-10-05 23:51:45,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113919826] [2020-10-05 23:51:45,176 INFO L95 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 [2020-10-05 23:51:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:45,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:51:45,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:45,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:51:45,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:45,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:51:45,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482845221] [2020-10-05 23:51:45,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:51:45,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:45,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:51:45,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:51:45,323 INFO L87 Difference]: Start difference. First operand 23806 states and 125455 transitions. Second operand 12 states. [2020-10-05 23:51:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:46,026 INFO L93 Difference]: Finished difference Result 56720 states and 262685 transitions. [2020-10-05 23:51:46,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:46,027 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-05 23:51:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:46,194 INFO L225 Difference]: With dead ends: 56720 [2020-10-05 23:51:46,195 INFO L226 Difference]: Without dead ends: 56704 [2020-10-05 23:51:46,195 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:51:46,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56704 states. [2020-10-05 23:51:47,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56704 to 23629. [2020-10-05 23:51:47,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23629 states. [2020-10-05 23:51:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23629 states to 23629 states and 124418 transitions. [2020-10-05 23:51:47,651 INFO L78 Accepts]: Start accepts. Automaton has 23629 states and 124418 transitions. Word has length 15 [2020-10-05 23:51:47,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:47,651 INFO L479 AbstractCegarLoop]: Abstraction has 23629 states and 124418 transitions. [2020-10-05 23:51:47,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:51:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 23629 states and 124418 transitions. [2020-10-05 23:51:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:51:47,652 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:47,652 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:47,852 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2020-10-05 23:51:47,852 INFO L427 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]=== [2020-10-05 23:51:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:47,853 INFO L82 PathProgramCache]: Analyzing trace with hash 858081470, now seen corresponding path program 2 times [2020-10-05 23:51:47,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:47,853 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878375018] [2020-10-05 23:51:47,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:47,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878375018] [2020-10-05 23:51:47,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:47,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:51:47,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041653487] [2020-10-05 23:51:47,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:51:47,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:47,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:51:47,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:51:47,891 INFO L87 Difference]: Start difference. First operand 23629 states and 124418 transitions. Second operand 7 states. [2020-10-05 23:51:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:48,509 INFO L93 Difference]: Finished difference Result 58078 states and 269185 transitions. [2020-10-05 23:51:48,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:48,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:51:48,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:50,914 INFO L225 Difference]: With dead ends: 58078 [2020-10-05 23:51:50,914 INFO L226 Difference]: Without dead ends: 58061 [2020-10-05 23:51:50,914 INFO L675 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 [2020-10-05 23:51:51,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58061 states. [2020-10-05 23:51:52,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58061 to 23109. [2020-10-05 23:51:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23109 states. [2020-10-05 23:51:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23109 states to 23109 states and 121651 transitions. [2020-10-05 23:51:52,389 INFO L78 Accepts]: Start accepts. Automaton has 23109 states and 121651 transitions. Word has length 15 [2020-10-05 23:51:52,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:52,389 INFO L479 AbstractCegarLoop]: Abstraction has 23109 states and 121651 transitions. [2020-10-05 23:51:52,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:51:52,389 INFO L276 IsEmpty]: Start isEmpty. Operand 23109 states and 121651 transitions. [2020-10-05 23:51:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:51:52,390 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:52,390 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:52,390 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2020-10-05 23:51:52,390 INFO L427 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]=== [2020-10-05 23:51:52,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:52,391 INFO L82 PathProgramCache]: Analyzing trace with hash 704376303, now seen corresponding path program 1 times [2020-10-05 23:51:52,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:52,391 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798234505] [2020-10-05 23:51:52,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:51:52,410 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798234505] [2020-10-05 23:51:52,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:51:52,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:51:52,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519574548] [2020-10-05 23:51:52,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:51:52,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:52,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:51:52,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:51:52,412 INFO L87 Difference]: Start difference. First operand 23109 states and 121651 transitions. Second operand 5 states. [2020-10-05 23:51:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:52,773 INFO L93 Difference]: Finished difference Result 41885 states and 209629 transitions. [2020-10-05 23:51:52,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:51:52,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:51:52,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:52,913 INFO L225 Difference]: With dead ends: 41885 [2020-10-05 23:51:52,914 INFO L226 Difference]: Without dead ends: 41856 [2020-10-05 23:51:52,914 INFO L675 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 [2020-10-05 23:51:53,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41856 states. [2020-10-05 23:51:54,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41856 to 28237. [2020-10-05 23:51:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28237 states. [2020-10-05 23:51:54,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28237 states to 28237 states and 150261 transitions. [2020-10-05 23:51:54,322 INFO L78 Accepts]: Start accepts. Automaton has 28237 states and 150261 transitions. Word has length 17 [2020-10-05 23:51:54,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:54,322 INFO L479 AbstractCegarLoop]: Abstraction has 28237 states and 150261 transitions. [2020-10-05 23:51:54,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:51:54,322 INFO L276 IsEmpty]: Start isEmpty. Operand 28237 states and 150261 transitions. [2020-10-05 23:51:54,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:51:54,323 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:54,323 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:54,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2020-10-05 23:51:54,323 INFO L427 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]=== [2020-10-05 23:51:54,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:54,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1918672061, now seen corresponding path program 1 times [2020-10-05 23:51:54,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:54,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039648072] [2020-10-05 23:51:54,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:51:54,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039648072] [2020-10-05 23:51:54,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485904144] [2020-10-05 23:51:54,361 INFO L95 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 [2020-10-05 23:51:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:54,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:51:54,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:51:55,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:55,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:51:55,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274026742] [2020-10-05 23:51:55,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:51:55,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:55,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:51:55,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:51:55,006 INFO L87 Difference]: Start difference. First operand 28237 states and 150261 transitions. Second operand 12 states. [2020-10-05 23:51:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:55,765 INFO L93 Difference]: Finished difference Result 66831 states and 314874 transitions. [2020-10-05 23:51:55,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:55,766 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:51:55,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:56,001 INFO L225 Difference]: With dead ends: 66831 [2020-10-05 23:51:56,001 INFO L226 Difference]: Without dead ends: 66807 [2020-10-05 23:51:56,001 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:51:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66807 states. [2020-10-05 23:51:57,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66807 to 28673. [2020-10-05 23:51:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28673 states. [2020-10-05 23:51:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28673 states to 28673 states and 152375 transitions. [2020-10-05 23:51:57,721 INFO L78 Accepts]: Start accepts. Automaton has 28673 states and 152375 transitions. Word has length 19 [2020-10-05 23:51:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:51:57,721 INFO L479 AbstractCegarLoop]: Abstraction has 28673 states and 152375 transitions. [2020-10-05 23:51:57,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:51:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 28673 states and 152375 transitions. [2020-10-05 23:51:57,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:51:57,722 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:51:57,722 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:51:57,937 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2020-10-05 23:51:57,938 INFO L427 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]=== [2020-10-05 23:51:57,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:51:57,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1064014108, now seen corresponding path program 1 times [2020-10-05 23:51:57,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:51:57,939 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840717012] [2020-10-05 23:51:57,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:51:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:57,973 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840717012] [2020-10-05 23:51:57,973 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122221865] [2020-10-05 23:51:57,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:51:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:51:58,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:51:58,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:51:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:51:58,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:51:58,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:51:58,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172232176] [2020-10-05 23:51:58,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:51:58,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:51:58,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:51:58,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:51:58,121 INFO L87 Difference]: Start difference. First operand 28673 states and 152375 transitions. Second operand 12 states. [2020-10-05 23:51:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:51:58,832 INFO L93 Difference]: Finished difference Result 69484 states and 328264 transitions. [2020-10-05 23:51:58,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:51:58,833 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:51:58,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:51:59,047 INFO L225 Difference]: With dead ends: 69484 [2020-10-05 23:51:59,047 INFO L226 Difference]: Without dead ends: 69451 [2020-10-05 23:51:59,047 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:52:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69451 states. [2020-10-05 23:52:01,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69451 to 28873. [2020-10-05 23:52:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28873 states. [2020-10-05 23:52:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28873 states to 28873 states and 153454 transitions. [2020-10-05 23:52:01,319 INFO L78 Accepts]: Start accepts. Automaton has 28873 states and 153454 transitions. Word has length 19 [2020-10-05 23:52:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:01,319 INFO L479 AbstractCegarLoop]: Abstraction has 28873 states and 153454 transitions. [2020-10-05 23:52:01,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:52:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 28873 states and 153454 transitions. [2020-10-05 23:52:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:52:01,320 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:01,320 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:01,521 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:01,521 INFO L427 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]=== [2020-10-05 23:52:01,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:01,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1699177508, now seen corresponding path program 2 times [2020-10-05 23:52:01,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:01,522 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77771113] [2020-10-05 23:52:01,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:52:01,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77771113] [2020-10-05 23:52:01,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:01,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:52:01,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781706285] [2020-10-05 23:52:01,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:52:01,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:01,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:52:01,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:52:01,562 INFO L87 Difference]: Start difference. First operand 28873 states and 153454 transitions. Second operand 7 states. [2020-10-05 23:52:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:02,272 INFO L93 Difference]: Finished difference Result 70510 states and 333491 transitions. [2020-10-05 23:52:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:52:02,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:52:02,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:02,516 INFO L225 Difference]: With dead ends: 70510 [2020-10-05 23:52:02,516 INFO L226 Difference]: Without dead ends: 70477 [2020-10-05 23:52:02,517 INFO L675 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 [2020-10-05 23:52:03,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70477 states. [2020-10-05 23:52:04,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70477 to 28942. [2020-10-05 23:52:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28942 states. [2020-10-05 23:52:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28942 states to 28942 states and 153921 transitions. [2020-10-05 23:52:04,862 INFO L78 Accepts]: Start accepts. Automaton has 28942 states and 153921 transitions. Word has length 19 [2020-10-05 23:52:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:04,862 INFO L479 AbstractCegarLoop]: Abstraction has 28942 states and 153921 transitions. [2020-10-05 23:52:04,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:52:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 28942 states and 153921 transitions. [2020-10-05 23:52:04,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:52:04,863 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:04,863 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:04,863 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2020-10-05 23:52:04,864 INFO L427 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]=== [2020-10-05 23:52:04,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:04,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1699205315, now seen corresponding path program 2 times [2020-10-05 23:52:04,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:04,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407300479] [2020-10-05 23:52:04,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:52:04,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407300479] [2020-10-05 23:52:04,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:04,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:52:04,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017304407] [2020-10-05 23:52:04,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:52:04,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:04,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:52:04,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:52:04,906 INFO L87 Difference]: Start difference. First operand 28942 states and 153921 transitions. Second operand 7 states. [2020-10-05 23:52:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:05,591 INFO L93 Difference]: Finished difference Result 70096 states and 331298 transitions. [2020-10-05 23:52:05,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:52:05,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:52:05,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:05,841 INFO L225 Difference]: With dead ends: 70096 [2020-10-05 23:52:05,841 INFO L226 Difference]: Without dead ends: 70063 [2020-10-05 23:52:05,841 INFO L675 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 [2020-10-05 23:52:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70063 states. [2020-10-05 23:52:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70063 to 29094. [2020-10-05 23:52:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29094 states. [2020-10-05 23:52:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29094 states to 29094 states and 154883 transitions. [2020-10-05 23:52:07,649 INFO L78 Accepts]: Start accepts. Automaton has 29094 states and 154883 transitions. Word has length 19 [2020-10-05 23:52:07,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:07,649 INFO L479 AbstractCegarLoop]: Abstraction has 29094 states and 154883 transitions. [2020-10-05 23:52:07,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:52:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 29094 states and 154883 transitions. [2020-10-05 23:52:07,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:52:07,650 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:07,650 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:07,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2020-10-05 23:52:07,650 INFO L427 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]=== [2020-10-05 23:52:07,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:07,651 INFO L82 PathProgramCache]: Analyzing trace with hash -228866966, now seen corresponding path program 1 times [2020-10-05 23:52:07,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:07,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380398728] [2020-10-05 23:52:07,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:52:07,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380398728] [2020-10-05 23:52:07,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109382964] [2020-10-05 23:52:07,706 INFO L95 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 [2020-10-05 23:52:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:07,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:52:07,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:52:07,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:07,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:52:07,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326453939] [2020-10-05 23:52:07,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:52:07,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:07,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:52:07,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:52:07,900 INFO L87 Difference]: Start difference. First operand 29094 states and 154883 transitions. Second operand 16 states. [2020-10-05 23:52:08,604 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-10-05 23:52:09,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:09,691 INFO L93 Difference]: Finished difference Result 100731 states and 448596 transitions. [2020-10-05 23:52:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:09,692 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:52:09,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:10,008 INFO L225 Difference]: With dead ends: 100731 [2020-10-05 23:52:10,008 INFO L226 Difference]: Without dead ends: 100715 [2020-10-05 23:52:10,009 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:52:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100715 states. [2020-10-05 23:52:12,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100715 to 28719. [2020-10-05 23:52:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28719 states. [2020-10-05 23:52:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28719 states to 28719 states and 152760 transitions. [2020-10-05 23:52:12,357 INFO L78 Accepts]: Start accepts. Automaton has 28719 states and 152760 transitions. Word has length 21 [2020-10-05 23:52:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:12,358 INFO L479 AbstractCegarLoop]: Abstraction has 28719 states and 152760 transitions. [2020-10-05 23:52:12,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:52:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 28719 states and 152760 transitions. [2020-10-05 23:52:12,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:52:12,359 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:12,359 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:14,195 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2020-10-05 23:52:14,195 INFO L427 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]=== [2020-10-05 23:52:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:14,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1302908714, now seen corresponding path program 2 times [2020-10-05 23:52:14,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:14,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624631261] [2020-10-05 23:52:14,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:52:14,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624631261] [2020-10-05 23:52:14,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937192172] [2020-10-05 23:52:14,255 INFO L93 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 [2020-10-05 23:52:14,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:52:14,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:52:14,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:52:14,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:52:14,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:14,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:52:14,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158860662] [2020-10-05 23:52:14,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:52:14,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:14,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:52:14,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:52:14,436 INFO L87 Difference]: Start difference. First operand 28719 states and 152760 transitions. Second operand 16 states. [2020-10-05 23:52:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:15,920 INFO L93 Difference]: Finished difference Result 99876 states and 444348 transitions. [2020-10-05 23:52:15,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:15,920 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:52:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:16,208 INFO L225 Difference]: With dead ends: 99876 [2020-10-05 23:52:16,208 INFO L226 Difference]: Without dead ends: 99855 [2020-10-05 23:52:16,209 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:52:17,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99855 states. [2020-10-05 23:52:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99855 to 28343. [2020-10-05 23:52:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28343 states. [2020-10-05 23:52:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28343 states to 28343 states and 150639 transitions. [2020-10-05 23:52:19,025 INFO L78 Accepts]: Start accepts. Automaton has 28343 states and 150639 transitions. Word has length 21 [2020-10-05 23:52:19,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:19,025 INFO L479 AbstractCegarLoop]: Abstraction has 28343 states and 150639 transitions. [2020-10-05 23:52:19,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:52:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 28343 states and 150639 transitions. [2020-10-05 23:52:19,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:52:19,026 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:19,026 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:19,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:19,227 INFO L427 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]=== [2020-10-05 23:52:19,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:19,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1149181014, now seen corresponding path program 3 times [2020-10-05 23:52:19,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:19,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955209095] [2020-10-05 23:52:19,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:52:19,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955209095] [2020-10-05 23:52:19,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649132498] [2020-10-05 23:52:19,286 INFO L93 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 [2020-10-05 23:52:19,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:52:19,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:52:19,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:52:19,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:52:19,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:19,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:52:19,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000387628] [2020-10-05 23:52:19,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:52:19,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:19,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:52:19,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:52:19,470 INFO L87 Difference]: Start difference. First operand 28343 states and 150639 transitions. Second operand 16 states. [2020-10-05 23:52:21,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:21,070 INFO L93 Difference]: Finished difference Result 100071 states and 445291 transitions. [2020-10-05 23:52:21,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:21,071 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:52:21,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:21,411 INFO L225 Difference]: With dead ends: 100071 [2020-10-05 23:52:21,411 INFO L226 Difference]: Without dead ends: 100055 [2020-10-05 23:52:21,412 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:52:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100055 states. [2020-10-05 23:52:24,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100055 to 27654. [2020-10-05 23:52:24,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27654 states. [2020-10-05 23:52:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27654 states to 27654 states and 147080 transitions. [2020-10-05 23:52:24,237 INFO L78 Accepts]: Start accepts. Automaton has 27654 states and 147080 transitions. Word has length 21 [2020-10-05 23:52:24,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:24,237 INFO L479 AbstractCegarLoop]: Abstraction has 27654 states and 147080 transitions. [2020-10-05 23:52:24,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:52:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 27654 states and 147080 transitions. [2020-10-05 23:52:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:52:24,238 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:24,238 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:24,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2020-10-05 23:52:24,439 INFO L427 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]=== [2020-10-05 23:52:24,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:24,440 INFO L82 PathProgramCache]: Analyzing trace with hash 315341610, now seen corresponding path program 4 times [2020-10-05 23:52:24,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:24,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991708766] [2020-10-05 23:52:24,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:52:24,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991708766] [2020-10-05 23:52:24,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902782422] [2020-10-05 23:52:24,500 INFO L93 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 [2020-10-05 23:52:24,587 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:52:24,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:52:24,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:52:24,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:52:24,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:24,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:52:24,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411137385] [2020-10-05 23:52:24,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:52:24,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:24,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:52:24,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:52:24,711 INFO L87 Difference]: Start difference. First operand 27654 states and 147080 transitions. Second operand 16 states. [2020-10-05 23:52:26,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:26,188 INFO L93 Difference]: Finished difference Result 99523 states and 442763 transitions. [2020-10-05 23:52:26,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:26,189 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:52:26,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:26,547 INFO L225 Difference]: With dead ends: 99523 [2020-10-05 23:52:26,547 INFO L226 Difference]: Without dead ends: 99502 [2020-10-05 23:52:26,547 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:52:27,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99502 states. [2020-10-05 23:52:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99502 to 27278. [2020-10-05 23:52:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27278 states. [2020-10-05 23:52:29,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27278 states to 27278 states and 144959 transitions. [2020-10-05 23:52:29,331 INFO L78 Accepts]: Start accepts. Automaton has 27278 states and 144959 transitions. Word has length 21 [2020-10-05 23:52:29,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:29,332 INFO L479 AbstractCegarLoop]: Abstraction has 27278 states and 144959 transitions. [2020-10-05 23:52:29,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:52:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 27278 states and 144959 transitions. [2020-10-05 23:52:29,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:52:29,333 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:29,333 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:29,533 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2020-10-05 23:52:29,534 INFO L427 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]=== [2020-10-05 23:52:29,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:29,534 INFO L82 PathProgramCache]: Analyzing trace with hash -822012438, now seen corresponding path program 5 times [2020-10-05 23:52:29,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:29,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617016118] [2020-10-05 23:52:29,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:52:29,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617016118] [2020-10-05 23:52:29,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:29,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:52:29,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972417722] [2020-10-05 23:52:29,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:52:29,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:29,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:52:29,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:52:29,593 INFO L87 Difference]: Start difference. First operand 27278 states and 144959 transitions. Second operand 9 states. [2020-10-05 23:52:30,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:30,990 INFO L93 Difference]: Finished difference Result 99710 states and 443686 transitions. [2020-10-05 23:52:30,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:30,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:52:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:31,280 INFO L225 Difference]: With dead ends: 99710 [2020-10-05 23:52:31,280 INFO L226 Difference]: Without dead ends: 99694 [2020-10-05 23:52:31,280 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:52:32,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99694 states. [2020-10-05 23:52:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99694 to 26597. [2020-10-05 23:52:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26597 states. [2020-10-05 23:52:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26597 states to 26597 states and 141420 transitions. [2020-10-05 23:52:33,916 INFO L78 Accepts]: Start accepts. Automaton has 26597 states and 141420 transitions. Word has length 21 [2020-10-05 23:52:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:33,916 INFO L479 AbstractCegarLoop]: Abstraction has 26597 states and 141420 transitions. [2020-10-05 23:52:33,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:52:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 26597 states and 141420 transitions. [2020-10-05 23:52:33,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:52:33,917 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:33,917 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:33,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2020-10-05 23:52:33,917 INFO L427 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]=== [2020-10-05 23:52:33,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:33,918 INFO L82 PathProgramCache]: Analyzing trace with hash -848707158, now seen corresponding path program 6 times [2020-10-05 23:52:33,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:33,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807885605] [2020-10-05 23:52:33,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:33,972 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:52:33,973 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807885605] [2020-10-05 23:52:33,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:33,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:52:33,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24105218] [2020-10-05 23:52:33,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:52:33,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:33,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:52:33,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:52:33,974 INFO L87 Difference]: Start difference. First operand 26597 states and 141420 transitions. Second operand 9 states. [2020-10-05 23:52:35,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:35,410 INFO L93 Difference]: Finished difference Result 98863 states and 439458 transitions. [2020-10-05 23:52:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:52:35,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:52:35,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:35,759 INFO L225 Difference]: With dead ends: 98863 [2020-10-05 23:52:35,760 INFO L226 Difference]: Without dead ends: 98841 [2020-10-05 23:52:35,760 INFO L675 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 [2020-10-05 23:52:36,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98841 states. [2020-10-05 23:52:38,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98841 to 25744. [2020-10-05 23:52:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25744 states. [2020-10-05 23:52:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25744 states to 25744 states and 137181 transitions. [2020-10-05 23:52:38,486 INFO L78 Accepts]: Start accepts. Automaton has 25744 states and 137181 transitions. Word has length 21 [2020-10-05 23:52:38,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:38,486 INFO L479 AbstractCegarLoop]: Abstraction has 25744 states and 137181 transitions. [2020-10-05 23:52:38,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:52:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 25744 states and 137181 transitions. [2020-10-05 23:52:38,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:52:38,487 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:38,487 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:38,488 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2020-10-05 23:52:38,488 INFO L427 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]=== [2020-10-05 23:52:38,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:38,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1818695965, now seen corresponding path program 1 times [2020-10-05 23:52:38,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:38,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474102499] [2020-10-05 23:52:38,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:52:38,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474102499] [2020-10-05 23:52:38,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:38,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:52:38,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563304402] [2020-10-05 23:52:38,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:52:38,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:38,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:52:38,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:52:38,510 INFO L87 Difference]: Start difference. First operand 25744 states and 137181 transitions. Second operand 5 states. [2020-10-05 23:52:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:38,876 INFO L93 Difference]: Finished difference Result 46463 states and 236107 transitions. [2020-10-05 23:52:38,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:52:38,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-05 23:52:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:39,013 INFO L225 Difference]: With dead ends: 46463 [2020-10-05 23:52:39,013 INFO L226 Difference]: Without dead ends: 46417 [2020-10-05 23:52:39,013 INFO L675 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 [2020-10-05 23:52:39,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46417 states. [2020-10-05 23:52:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46417 to 31960. [2020-10-05 23:52:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31960 states. [2020-10-05 23:52:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31960 states to 31960 states and 171209 transitions. [2020-10-05 23:52:40,397 INFO L78 Accepts]: Start accepts. Automaton has 31960 states and 171209 transitions. Word has length 21 [2020-10-05 23:52:40,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:40,397 INFO L479 AbstractCegarLoop]: Abstraction has 31960 states and 171209 transitions. [2020-10-05 23:52:40,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:52:40,397 INFO L276 IsEmpty]: Start isEmpty. Operand 31960 states and 171209 transitions. [2020-10-05 23:52:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:52:40,399 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:40,399 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:40,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2020-10-05 23:52:40,399 INFO L427 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]=== [2020-10-05 23:52:40,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:40,399 INFO L82 PathProgramCache]: Analyzing trace with hash 605532395, now seen corresponding path program 1 times [2020-10-05 23:52:40,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:40,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040238273] [2020-10-05 23:52:40,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:52:40,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040238273] [2020-10-05 23:52:40,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774610012] [2020-10-05 23:52:40,443 INFO L95 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 [2020-10-05 23:52:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:40,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:52:40,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:52:41,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:41,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:52:41,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35628829] [2020-10-05 23:52:41,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:52:41,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:41,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:52:41,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:52:41,041 INFO L87 Difference]: Start difference. First operand 31960 states and 171209 transitions. Second operand 12 states. [2020-10-05 23:52:41,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:41,875 INFO L93 Difference]: Finished difference Result 75380 states and 361389 transitions. [2020-10-05 23:52:41,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:52:41,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:52:41,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:42,096 INFO L225 Difference]: With dead ends: 75380 [2020-10-05 23:52:42,096 INFO L226 Difference]: Without dead ends: 75344 [2020-10-05 23:52:42,097 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:52:42,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75344 states. [2020-10-05 23:52:43,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75344 to 32974. [2020-10-05 23:52:43,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32974 states. [2020-10-05 23:52:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32974 states to 32974 states and 176363 transitions. [2020-10-05 23:52:43,953 INFO L78 Accepts]: Start accepts. Automaton has 32974 states and 176363 transitions. Word has length 23 [2020-10-05 23:52:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:43,954 INFO L479 AbstractCegarLoop]: Abstraction has 32974 states and 176363 transitions. [2020-10-05 23:52:43,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:52:43,954 INFO L276 IsEmpty]: Start isEmpty. Operand 32974 states and 176363 transitions. [2020-10-05 23:52:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:52:43,955 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:43,955 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:44,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:44,156 INFO L427 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]=== [2020-10-05 23:52:44,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:44,157 INFO L82 PathProgramCache]: Analyzing trace with hash 768040394, now seen corresponding path program 1 times [2020-10-05 23:52:44,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:44,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852875299] [2020-10-05 23:52:44,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:52:44,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852875299] [2020-10-05 23:52:44,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376238207] [2020-10-05 23:52:44,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:44,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:52:44,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:52:44,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:44,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:52:44,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566556250] [2020-10-05 23:52:44,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:52:44,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:44,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:52:44,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:52:44,348 INFO L87 Difference]: Start difference. First operand 32974 states and 176363 transitions. Second operand 12 states. [2020-10-05 23:52:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:45,452 INFO L93 Difference]: Finished difference Result 79487 states and 381757 transitions. [2020-10-05 23:52:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:52:45,453 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:52:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:45,707 INFO L225 Difference]: With dead ends: 79487 [2020-10-05 23:52:45,707 INFO L226 Difference]: Without dead ends: 79445 [2020-10-05 23:52:45,707 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:52:46,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79445 states. [2020-10-05 23:52:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79445 to 33981. [2020-10-05 23:52:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33981 states. [2020-10-05 23:52:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33981 states to 33981 states and 181710 transitions. [2020-10-05 23:52:47,731 INFO L78 Accepts]: Start accepts. Automaton has 33981 states and 181710 transitions. Word has length 23 [2020-10-05 23:52:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:47,732 INFO L479 AbstractCegarLoop]: Abstraction has 33981 states and 181710 transitions. [2020-10-05 23:52:47,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:52:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 33981 states and 181710 transitions. [2020-10-05 23:52:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:52:47,733 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:47,733 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:47,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:47,934 INFO L427 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]=== [2020-10-05 23:52:47,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:47,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1041867770, now seen corresponding path program 1 times [2020-10-05 23:52:47,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:47,935 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526810824] [2020-10-05 23:52:47,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:52:47,973 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526810824] [2020-10-05 23:52:47,973 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982798349] [2020-10-05 23:52:47,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:48,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:52:48,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:52:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:52:48,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:52:48,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:52:48,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91804279] [2020-10-05 23:52:48,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:52:48,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:48,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:52:48,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:52:48,115 INFO L87 Difference]: Start difference. First operand 33981 states and 181710 transitions. Second operand 12 states. [2020-10-05 23:52:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:49,160 INFO L93 Difference]: Finished difference Result 82728 states and 398553 transitions. [2020-10-05 23:52:49,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:52:49,161 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:52:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:49,408 INFO L225 Difference]: With dead ends: 82728 [2020-10-05 23:52:49,408 INFO L226 Difference]: Without dead ends: 82673 [2020-10-05 23:52:49,408 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:52:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82673 states. [2020-10-05 23:52:51,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82673 to 34821. [2020-10-05 23:52:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34821 states. [2020-10-05 23:52:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 186422 transitions. [2020-10-05 23:52:51,475 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 186422 transitions. Word has length 23 [2020-10-05 23:52:51,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:51,475 INFO L479 AbstractCegarLoop]: Abstraction has 34821 states and 186422 transitions. [2020-10-05 23:52:51,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:52:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 186422 transitions. [2020-10-05 23:52:51,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:52:51,477 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:51,477 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:51,678 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:52:51,678 INFO L427 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]=== [2020-10-05 23:52:51,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:51,679 INFO L82 PathProgramCache]: Analyzing trace with hash -284839030, now seen corresponding path program 2 times [2020-10-05 23:52:51,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:51,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012456797] [2020-10-05 23:52:51,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:52:51,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012456797] [2020-10-05 23:52:51,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:51,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:52:51,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186564768] [2020-10-05 23:52:51,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:52:51,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:51,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:52:51,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:52:51,721 INFO L87 Difference]: Start difference. First operand 34821 states and 186422 transitions. Second operand 7 states. [2020-10-05 23:52:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:52,875 INFO L93 Difference]: Finished difference Result 83507 states and 402693 transitions. [2020-10-05 23:52:52,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:52:52,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:52:52,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:53,166 INFO L225 Difference]: With dead ends: 83507 [2020-10-05 23:52:53,166 INFO L226 Difference]: Without dead ends: 83452 [2020-10-05 23:52:53,166 INFO L675 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 [2020-10-05 23:52:54,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83452 states. [2020-10-05 23:52:55,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83452 to 35694. [2020-10-05 23:52:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35694 states. [2020-10-05 23:52:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35694 states to 35694 states and 191145 transitions. [2020-10-05 23:52:55,194 INFO L78 Accepts]: Start accepts. Automaton has 35694 states and 191145 transitions. Word has length 23 [2020-10-05 23:52:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:55,194 INFO L479 AbstractCegarLoop]: Abstraction has 35694 states and 191145 transitions. [2020-10-05 23:52:55,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:52:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 35694 states and 191145 transitions. [2020-10-05 23:52:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:52:55,196 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:55,196 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:55,197 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2020-10-05 23:52:55,197 INFO L427 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]=== [2020-10-05 23:52:55,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:55,197 INFO L82 PathProgramCache]: Analyzing trace with hash -284850438, now seen corresponding path program 2 times [2020-10-05 23:52:55,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:55,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895430841] [2020-10-05 23:52:55,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:52:55,234 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895430841] [2020-10-05 23:52:55,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:55,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:52:55,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738401064] [2020-10-05 23:52:55,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:52:55,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:55,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:52:55,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:52:55,235 INFO L87 Difference]: Start difference. First operand 35694 states and 191145 transitions. Second operand 7 states. [2020-10-05 23:52:56,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:52:56,522 INFO L93 Difference]: Finished difference Result 83523 states and 402462 transitions. [2020-10-05 23:52:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:52:56,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:52:56,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:52:56,827 INFO L225 Difference]: With dead ends: 83523 [2020-10-05 23:52:56,827 INFO L226 Difference]: Without dead ends: 83468 [2020-10-05 23:52:56,827 INFO L675 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 [2020-10-05 23:52:57,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83468 states. [2020-10-05 23:52:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83468 to 36306. [2020-10-05 23:52:58,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36306 states. [2020-10-05 23:52:58,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36306 states to 36306 states and 194552 transitions. [2020-10-05 23:52:58,847 INFO L78 Accepts]: Start accepts. Automaton has 36306 states and 194552 transitions. Word has length 23 [2020-10-05 23:52:58,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:52:58,847 INFO L479 AbstractCegarLoop]: Abstraction has 36306 states and 194552 transitions. [2020-10-05 23:52:58,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:52:58,847 INFO L276 IsEmpty]: Start isEmpty. Operand 36306 states and 194552 transitions. [2020-10-05 23:52:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:52:58,849 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:52:58,849 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:52:58,849 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2020-10-05 23:52:58,850 INFO L427 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]=== [2020-10-05 23:52:58,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:52:58,850 INFO L82 PathProgramCache]: Analyzing trace with hash -284866837, now seen corresponding path program 2 times [2020-10-05 23:52:58,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:52:58,850 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715012015] [2020-10-05 23:52:58,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:52:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:52:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:52:58,887 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715012015] [2020-10-05 23:52:58,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:52:58,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:52:58,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917084156] [2020-10-05 23:52:58,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:52:58,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:52:58,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:52:58,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:52:58,888 INFO L87 Difference]: Start difference. First operand 36306 states and 194552 transitions. Second operand 7 states. [2020-10-05 23:53:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:00,184 INFO L93 Difference]: Finished difference Result 83918 states and 404136 transitions. [2020-10-05 23:53:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:53:00,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:53:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:00,453 INFO L225 Difference]: With dead ends: 83918 [2020-10-05 23:53:00,454 INFO L226 Difference]: Without dead ends: 83863 [2020-10-05 23:53:00,454 INFO L675 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 [2020-10-05 23:53:01,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83863 states. [2020-10-05 23:53:02,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83863 to 37062. [2020-10-05 23:53:02,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37062 states. [2020-10-05 23:53:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37062 states to 37062 states and 198528 transitions. [2020-10-05 23:53:02,384 INFO L78 Accepts]: Start accepts. Automaton has 37062 states and 198528 transitions. Word has length 23 [2020-10-05 23:53:02,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:02,384 INFO L479 AbstractCegarLoop]: Abstraction has 37062 states and 198528 transitions. [2020-10-05 23:53:02,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:53:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 37062 states and 198528 transitions. [2020-10-05 23:53:02,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:53:02,387 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:02,387 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:02,387 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2020-10-05 23:53:02,387 INFO L427 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]=== [2020-10-05 23:53:02,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:02,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1146013160, now seen corresponding path program 1 times [2020-10-05 23:53:02,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:02,388 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792187438] [2020-10-05 23:53:02,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:53:02,448 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792187438] [2020-10-05 23:53:02,448 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166863801] [2020-10-05 23:53:02,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:02,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:53:02,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:53:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:53:02,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:53:02,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:53:02,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555034264] [2020-10-05 23:53:02,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:53:02,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:02,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:53:02,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:53:02,643 INFO L87 Difference]: Start difference. First operand 37062 states and 198528 transitions. Second operand 16 states. [2020-10-05 23:53:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:05,002 INFO L93 Difference]: Finished difference Result 122892 states and 561130 transitions. [2020-10-05 23:53:05,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:53:05,003 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:53:05,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:05,379 INFO L225 Difference]: With dead ends: 122892 [2020-10-05 23:53:05,379 INFO L226 Difference]: Without dead ends: 122862 [2020-10-05 23:53:05,380 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:53:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122862 states. [2020-10-05 23:53:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122862 to 36727. [2020-10-05 23:53:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36727 states. [2020-10-05 23:53:12,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36727 states to 36727 states and 196466 transitions. [2020-10-05 23:53:12,454 INFO L78 Accepts]: Start accepts. Automaton has 36727 states and 196466 transitions. Word has length 25 [2020-10-05 23:53:12,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:12,454 INFO L479 AbstractCegarLoop]: Abstraction has 36727 states and 196466 transitions. [2020-10-05 23:53:12,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:53:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand 36727 states and 196466 transitions. [2020-10-05 23:53:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:53:12,458 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:12,458 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:12,658 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2020-10-05 23:53:12,659 INFO L427 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]=== [2020-10-05 23:53:12,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:12,659 INFO L82 PathProgramCache]: Analyzing trace with hash -872185784, now seen corresponding path program 1 times [2020-10-05 23:53:12,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:12,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127621683] [2020-10-05 23:53:12,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:53:12,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127621683] [2020-10-05 23:53:12,727 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47213946] [2020-10-05 23:53:12,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:12,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:53:12,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:53:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:53:12,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:53:12,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:53:12,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038102533] [2020-10-05 23:53:12,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:53:12,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:12,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:53:12,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:53:12,925 INFO L87 Difference]: Start difference. First operand 36727 states and 196466 transitions. Second operand 16 states. [2020-10-05 23:53:14,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:14,779 INFO L93 Difference]: Finished difference Result 121590 states and 554657 transitions. [2020-10-05 23:53:14,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:53:14,780 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:53:14,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:15,142 INFO L225 Difference]: With dead ends: 121590 [2020-10-05 23:53:15,142 INFO L226 Difference]: Without dead ends: 121560 [2020-10-05 23:53:15,142 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:53:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121560 states. [2020-10-05 23:53:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121560 to 36513. [2020-10-05 23:53:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36513 states. [2020-10-05 23:53:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36513 states to 36513 states and 195090 transitions. [2020-10-05 23:53:18,273 INFO L78 Accepts]: Start accepts. Automaton has 36513 states and 195090 transitions. Word has length 25 [2020-10-05 23:53:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:18,273 INFO L479 AbstractCegarLoop]: Abstraction has 36513 states and 195090 transitions. [2020-10-05 23:53:18,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:53:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 36513 states and 195090 transitions. [2020-10-05 23:53:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:53:18,277 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:18,277 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:18,484 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:18,485 INFO L427 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]=== [2020-10-05 23:53:18,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:18,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2096074712, now seen corresponding path program 2 times [2020-10-05 23:53:18,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:18,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286530170] [2020-10-05 23:53:18,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:53:18,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286530170] [2020-10-05 23:53:18,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304655078] [2020-10-05 23:53:18,541 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:18,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:53:18,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:53:18,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:53:18,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:53:18,772 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:53:18,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:53:18,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:53:18,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601863365] [2020-10-05 23:53:18,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:53:18,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:18,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:53:18,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:53:18,774 INFO L87 Difference]: Start difference. First operand 36513 states and 195090 transitions. Second operand 16 states. [2020-10-05 23:53:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:20,429 INFO L93 Difference]: Finished difference Result 120395 states and 548664 transitions. [2020-10-05 23:53:20,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:53:20,429 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:53:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:20,805 INFO L225 Difference]: With dead ends: 120395 [2020-10-05 23:53:20,805 INFO L226 Difference]: Without dead ends: 120362 [2020-10-05 23:53:20,805 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:53:22,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120362 states. [2020-10-05 23:53:23,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120362 to 36444. [2020-10-05 23:53:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36444 states. [2020-10-05 23:53:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36444 states to 36444 states and 194571 transitions. [2020-10-05 23:53:24,028 INFO L78 Accepts]: Start accepts. Automaton has 36444 states and 194571 transitions. Word has length 25 [2020-10-05 23:53:24,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:24,028 INFO L479 AbstractCegarLoop]: Abstraction has 36444 states and 194571 transitions. [2020-10-05 23:53:24,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:53:24,028 INFO L276 IsEmpty]: Start isEmpty. Operand 36444 states and 194571 transitions. [2020-10-05 23:53:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:53:24,031 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:24,031 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:24,231 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2020-10-05 23:53:24,232 INFO L427 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]=== [2020-10-05 23:53:24,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:24,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2096063304, now seen corresponding path program 2 times [2020-10-05 23:53:24,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:24,233 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537822684] [2020-10-05 23:53:24,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:53:24,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537822684] [2020-10-05 23:53:24,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706824367] [2020-10-05 23:53:24,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:24,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:53:24,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:53:24,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:53:24,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:53:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:53:24,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:53:24,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:53:24,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470469348] [2020-10-05 23:53:24,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:53:24,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:24,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:53:24,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:53:24,493 INFO L87 Difference]: Start difference. First operand 36444 states and 194571 transitions. Second operand 16 states. [2020-10-05 23:53:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:26,771 INFO L93 Difference]: Finished difference Result 119346 states and 543724 transitions. [2020-10-05 23:53:26,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:53:26,771 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:53:26,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:27,114 INFO L225 Difference]: With dead ends: 119346 [2020-10-05 23:53:27,115 INFO L226 Difference]: Without dead ends: 119313 [2020-10-05 23:53:27,115 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:53:28,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119313 states. [2020-10-05 23:53:29,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119313 to 36040. [2020-10-05 23:53:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36040 states. [2020-10-05 23:53:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36040 states to 36040 states and 192287 transitions. [2020-10-05 23:53:29,603 INFO L78 Accepts]: Start accepts. Automaton has 36040 states and 192287 transitions. Word has length 25 [2020-10-05 23:53:29,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:29,603 INFO L479 AbstractCegarLoop]: Abstraction has 36040 states and 192287 transitions. [2020-10-05 23:53:29,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:53:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 36040 states and 192287 transitions. [2020-10-05 23:53:29,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:53:29,606 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:29,606 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:29,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2020-10-05 23:53:29,807 INFO L427 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]=== [2020-10-05 23:53:29,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:29,807 INFO L82 PathProgramCache]: Analyzing trace with hash 582269272, now seen corresponding path program 3 times [2020-10-05 23:53:29,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:29,808 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334507756] [2020-10-05 23:53:29,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:53:29,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334507756] [2020-10-05 23:53:29,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837146946] [2020-10-05 23:53:29,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:29,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-05 23:53:29,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:53:29,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:53:29,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:53:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:53:30,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:53:30,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:53:30,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59886367] [2020-10-05 23:53:30,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:53:30,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:30,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:53:30,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:53:30,066 INFO L87 Difference]: Start difference. First operand 36040 states and 192287 transitions. Second operand 16 states. [2020-10-05 23:53:32,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:32,104 INFO L93 Difference]: Finished difference Result 119770 states and 545635 transitions. [2020-10-05 23:53:32,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:53:32,104 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:53:32,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:32,462 INFO L225 Difference]: With dead ends: 119770 [2020-10-05 23:53:32,462 INFO L226 Difference]: Without dead ends: 119740 [2020-10-05 23:53:32,462 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:53:33,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119740 states. [2020-10-05 23:53:37,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119740 to 35471. [2020-10-05 23:53:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35471 states. [2020-10-05 23:53:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35471 states to 35471 states and 189238 transitions. [2020-10-05 23:53:38,024 INFO L78 Accepts]: Start accepts. Automaton has 35471 states and 189238 transitions. Word has length 25 [2020-10-05 23:53:38,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:38,024 INFO L479 AbstractCegarLoop]: Abstraction has 35471 states and 189238 transitions. [2020-10-05 23:53:38,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:53:38,024 INFO L276 IsEmpty]: Start isEmpty. Operand 35471 states and 189238 transitions. [2020-10-05 23:53:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:53:38,026 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:38,027 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:38,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2020-10-05 23:53:38,227 INFO L427 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]=== [2020-10-05 23:53:38,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:38,228 INFO L82 PathProgramCache]: Analyzing trace with hash 679178599, now seen corresponding path program 1 times [2020-10-05 23:53:38,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:38,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940293192] [2020-10-05 23:53:38,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:53:38,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940293192] [2020-10-05 23:53:38,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779790343] [2020-10-05 23:53:38,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:38,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:53:38,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:53:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:53:38,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:53:38,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:53:38,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765146980] [2020-10-05 23:53:38,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:53:38,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:38,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:53:38,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:53:38,485 INFO L87 Difference]: Start difference. First operand 35471 states and 189238 transitions. Second operand 16 states. [2020-10-05 23:53:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:40,173 INFO L93 Difference]: Finished difference Result 121131 states and 553230 transitions. [2020-10-05 23:53:40,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:53:40,174 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:53:40,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:40,531 INFO L225 Difference]: With dead ends: 121131 [2020-10-05 23:53:40,531 INFO L226 Difference]: Without dead ends: 121101 [2020-10-05 23:53:40,531 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:53:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121101 states. [2020-10-05 23:53:43,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121101 to 35374. [2020-10-05 23:53:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35374 states. [2020-10-05 23:53:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35374 states to 35374 states and 188534 transitions. [2020-10-05 23:53:43,814 INFO L78 Accepts]: Start accepts. Automaton has 35374 states and 188534 transitions. Word has length 25 [2020-10-05 23:53:43,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:43,814 INFO L479 AbstractCegarLoop]: Abstraction has 35374 states and 188534 transitions. [2020-10-05 23:53:43,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:53:43,814 INFO L276 IsEmpty]: Start isEmpty. Operand 35374 states and 188534 transitions. [2020-10-05 23:53:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:53:43,817 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:43,817 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:44,018 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2020-10-05 23:53:44,018 INFO L427 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]=== [2020-10-05 23:53:44,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:44,019 INFO L82 PathProgramCache]: Analyzing trace with hash -647539609, now seen corresponding path program 2 times [2020-10-05 23:53:44,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:44,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855875323] [2020-10-05 23:53:44,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:53:44,086 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855875323] [2020-10-05 23:53:44,086 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144195362] [2020-10-05 23:53:44,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:44,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:53:44,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:53:44,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:53:44,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:53:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:53:44,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:53:44,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:53:44,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357677944] [2020-10-05 23:53:44,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:53:44,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:44,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:53:44,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:53:44,281 INFO L87 Difference]: Start difference. First operand 35374 states and 188534 transitions. Second operand 16 states. [2020-10-05 23:53:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:48,413 INFO L93 Difference]: Finished difference Result 120194 states and 548412 transitions. [2020-10-05 23:53:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:53:48,414 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:53:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:48,761 INFO L225 Difference]: With dead ends: 120194 [2020-10-05 23:53:48,761 INFO L226 Difference]: Without dead ends: 120154 [2020-10-05 23:53:48,761 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:53:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120154 states. [2020-10-05 23:53:51,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120154 to 35219. [2020-10-05 23:53:51,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35219 states. [2020-10-05 23:53:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35219 states to 35219 states and 187630 transitions. [2020-10-05 23:53:51,769 INFO L78 Accepts]: Start accepts. Automaton has 35219 states and 187630 transitions. Word has length 25 [2020-10-05 23:53:51,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:53:51,769 INFO L479 AbstractCegarLoop]: Abstraction has 35219 states and 187630 transitions. [2020-10-05 23:53:51,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:53:51,769 INFO L276 IsEmpty]: Start isEmpty. Operand 35219 states and 187630 transitions. [2020-10-05 23:53:51,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:53:51,772 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:53:51,772 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:53:51,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:51,972 INFO L427 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]=== [2020-10-05 23:53:51,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:53:51,973 INFO L82 PathProgramCache]: Analyzing trace with hash -647556008, now seen corresponding path program 4 times [2020-10-05 23:53:51,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:53:51,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621454432] [2020-10-05 23:53:51,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:53:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:53:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:53:52,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621454432] [2020-10-05 23:53:52,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320508058] [2020-10-05 23:53:52,034 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:53:52,121 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:53:52,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:53:52,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:53:52,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:53:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:53:52,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:53:52,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:53:52,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666598287] [2020-10-05 23:53:52,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:53:52,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:53:52,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:53:52,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:53:52,247 INFO L87 Difference]: Start difference. First operand 35219 states and 187630 transitions. Second operand 16 states. [2020-10-05 23:53:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:53:53,829 INFO L93 Difference]: Finished difference Result 118559 states and 539905 transitions. [2020-10-05 23:53:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:53:53,830 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:53:53,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:53:54,172 INFO L225 Difference]: With dead ends: 118559 [2020-10-05 23:53:54,173 INFO L226 Difference]: Without dead ends: 118526 [2020-10-05 23:53:54,173 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:53:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118526 states. Received shutdown request... [2020-10-05 23:53:59,000 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2020-10-05 23:53:59,000 WARN L544 AbstractCegarLoop]: Verification canceled [2020-10-05 23:53:59,004 WARN L228 ceAbstractionStarter]: Timeout [2020-10-05 23:53:59,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:53:59 BasicIcfg [2020-10-05 23:53:59,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:53:59,006 INFO L168 Benchmark]: Toolchain (without parser) took 235207.23 ms. Allocated memory was 139.5 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 101.1 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2020-10-05 23:53:59,006 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-10-05 23:53:59,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.90 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 100.9 MB in the beginning and 162.9 MB in the end (delta: -62.0 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:53:59,007 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.70 ms. Allocated memory is still 202.9 MB. Free memory was 162.9 MB in the beginning and 160.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:53:59,007 INFO L168 Benchmark]: Boogie Preprocessor took 27.80 ms. Allocated memory is still 202.9 MB. Free memory was 160.8 MB in the beginning and 159.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:53:59,008 INFO L168 Benchmark]: RCFGBuilder took 428.40 ms. Allocated memory is still 202.9 MB. Free memory was 159.5 MB in the beginning and 139.0 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:53:59,008 INFO L168 Benchmark]: TraceAbstraction took 233988.28 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 138.4 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2020-10-05 23:53:59,010 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 708.90 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 100.9 MB in the beginning and 162.9 MB in the end (delta: -62.0 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.70 ms. Allocated memory is still 202.9 MB. Free memory was 162.9 MB in the beginning and 160.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.80 ms. Allocated memory is still 202.9 MB. Free memory was 160.8 MB in the beginning and 159.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 428.40 ms. Allocated memory is still 202.9 MB. Free memory was 159.5 MB in the beginning and 139.0 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 233988.28 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 138.4 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 61 ProgramPointsBefore, 18 ProgramPointsAfterwards, 58 TransitionsBefore, 12 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 7 FixpointIterations, 21 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 3 ChoiceCompositions, 304 VarBasedMoverChecksPositive, 3 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 486 CheckedPairsTotal, 51 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 80 ProgramPointsBefore, 31 ProgramPointsAfterwards, 74 TransitionsBefore, 21 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 4 ChoiceCompositions, 472 VarBasedMoverChecksPositive, 9 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 942 CheckedPairsTotal, 62 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.7s, 99 ProgramPointsBefore, 41 ProgramPointsAfterwards, 90 TransitionsBefore, 27 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 3 ConcurrentYvCompositions, 5 ChoiceCompositions, 673 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1426 CheckedPairsTotal, 74 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 118 ProgramPointsBefore, 51 ProgramPointsAfterwards, 106 TransitionsBefore, 33 TransitionsAfterwards, 1756 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 840 VarBasedMoverChecksPositive, 18 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2033 CheckedPairsTotal, 86 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.1s, 137 ProgramPointsBefore, 61 ProgramPointsAfterwards, 122 TransitionsBefore, 39 TransitionsAfterwards, 2264 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 3 ConcurrentYvCompositions, 7 ChoiceCompositions, 1058 VarBasedMoverChecksPositive, 27 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2999 CheckedPairsTotal, 104 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.4s, 156 ProgramPointsBefore, 71 ProgramPointsAfterwards, 138 TransitionsBefore, 45 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 66 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 8 ChoiceCompositions, 1407 VarBasedMoverChecksPositive, 30 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3678 CheckedPairsTotal, 113 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 678]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 678). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 55 locations, 1 error locations. Started 6 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 233.6s, OverallIterations: 106, TraceHistogramMax: 6, AutomataDifference: 92.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.1s, HoareTripleCheckerStatistics: 4776 SDtfs, 25152 SDslu, 17597 SDs, 0 SdLazy, 32955 SolverSat, 2233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2850 GetRequests, 712 SyntacticMatches, 0 SemanticMatches, 2138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14869 ImplicationChecksByTransitivity, 25.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37062occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 99.6s AutomataMinimizationTime, 101 MinimizatonAttempts, 2256009 StatesRemovedByMinimization, 93 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 3095 NumberOfCodeBlocks, 3067 NumberOfCodeBlocksAsserted, 181 NumberOfCheckSat, 2858 ConstructedInterpolants, 0 QuantifiedInterpolants, 372692 SizeOfPredicates, 256 NumberOfNonLiveVariables, 5413 ConjunctsInSsa, 400 ConjunctsInUnsatCore, 149 InterpolantComputations, 53 PerfectInterpolantSequences, 912/1688 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown