/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-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:52:49,253 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:52:49,255 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:52:49,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:52:49,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:52:49,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:52:49,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:52:49,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:52:49,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:52:49,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:52:49,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:52:49,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:52:49,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:52:49,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:52:49,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:52:49,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:52:49,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:52:49,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:52:49,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:52:49,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:52:49,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:52:49,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:52:49,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:52:49,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:52:49,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:52:49,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:52:49,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:52:49,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:52:49,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:52:49,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:52:49,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:52:49,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:52:49,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:52:49,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:52:49,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:52:49,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:52:49,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:52:49,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:52:49,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:52:49,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:52:49,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:52:49,314 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-McrAutomaton-WP.epf [2020-10-22 00:52:49,354 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:52:49,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:52:49,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:52:49,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:52:49,359 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:52:49,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:52:49,359 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:52:49,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:52:49,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:52:49,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:52:49,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:52:49,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:52:49,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:52:49,361 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:52:49,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:52:49,361 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:52:49,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:52:49,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:52:49,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:52:49,362 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:52:49,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:52:49,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:52:49,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:52:49,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:52:49,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:52:49,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:52:49,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:52:49,366 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:52:49,366 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:52:49,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:52:49,367 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:52:49,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:52:49,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:52:49,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:52:49,685 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:52:49,686 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:52:49,687 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i [2020-10-22 00:52:49,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e33d80ba/3095ec35d5324b7da87ab4b10db727fb/FLAG6ce51ca40 [2020-10-22 00:52:50,286 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:52:50,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i [2020-10-22 00:52:50,301 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e33d80ba/3095ec35d5324b7da87ab4b10db727fb/FLAG6ce51ca40 [2020-10-22 00:52:50,599 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e33d80ba/3095ec35d5324b7da87ab4b10db727fb [2020-10-22 00:52:50,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:52:50,614 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:52:50,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:52:50,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:52:50,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:52:50,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:52:50" (1/1) ... [2020-10-22 00:52:50,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31184fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:52:50, skipping insertion in model container [2020-10-22 00:52:50,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:52:50" (1/1) ... [2020-10-22 00:52:50,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:52:50,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:52:51,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:52:51,258 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:52:51,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:52:51,403 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:52:51,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:52:51 WrapperNode [2020-10-22 00:52:51,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:52:51,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:52:51,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:52:51,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:52:51,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:52:51" (1/1) ... [2020-10-22 00:52:51,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:52:51" (1/1) ... [2020-10-22 00:52:51,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:52:51,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:52:51,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:52:51,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:52:51,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:52:51" (1/1) ... [2020-10-22 00:52:51,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:52:51" (1/1) ... [2020-10-22 00:52:51,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:52:51" (1/1) ... [2020-10-22 00:52:51,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:52:51" (1/1) ... [2020-10-22 00:52:51,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:52:51" (1/1) ... [2020-10-22 00:52:51,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:52:51" (1/1) ... [2020-10-22 00:52:51,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:52:51" (1/1) ... [2020-10-22 00:52:51,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:52:51,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:52:51,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:52:51,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:52:51,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:52:51" (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-22 00:52:51,550 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2020-10-22 00:52:51,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2020-10-22 00:52:51,551 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-10-22 00:52:51,551 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-10-22 00:52:51,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:52:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:52:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:52:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:52:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:52:51,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:52:51,556 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:52:51,954 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:52:51,955 INFO L298 CfgBuilder]: Removed 11 assume(true) statements. [2020-10-22 00:52:51,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:52:51 BoogieIcfgContainer [2020-10-22 00:52:51,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:52:51,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:52:51,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:52:51,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:52:51,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:52:50" (1/3) ... [2020-10-22 00:52:51,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4400eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:52:51, skipping insertion in model container [2020-10-22 00:52:51,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:52:51" (2/3) ... [2020-10-22 00:52:51,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4400eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:52:51, skipping insertion in model container [2020-10-22 00:52:51,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:52:51" (3/3) ... [2020-10-22 00:52:51,967 INFO L111 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-2.i [2020-10-22 00:52:51,980 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:52:51,980 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:52:51,987 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-22 00:52:51,989 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:52:52,017 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,018 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,018 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,018 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,019 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,019 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,020 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,029 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,029 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,030 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,030 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,030 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,038 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,040 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:52,043 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:52:52,058 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-22 00:52:52,081 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:52:52,082 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:52:52,082 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:52:52,082 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:52:52,082 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:52:52,082 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:52:52,082 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:52:52,083 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:52:52,096 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:52:52,097 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 67 transitions, 144 flow [2020-10-22 00:52:52,100 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 67 transitions, 144 flow [2020-10-22 00:52:52,102 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 69 places, 67 transitions, 144 flow [2020-10-22 00:52:52,151 INFO L129 PetriNetUnfolder]: 5/77 cut-off events. [2020-10-22 00:52:52,151 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 00:52:52,158 INFO L80 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 77 events. 5/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 109 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2020-10-22 00:52:52,161 INFO L116 LiptonReduction]: Number of co-enabled transitions 832 [2020-10-22 00:52:53,518 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-22 00:52:53,727 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2020-10-22 00:52:54,249 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2020-10-22 00:52:54,505 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2020-10-22 00:52:54,650 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-22 00:52:54,798 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-22 00:52:54,804 INFO L131 LiptonReduction]: Checked pairs total: 793 [2020-10-22 00:52:54,805 INFO L133 LiptonReduction]: Total number of compositions: 69 [2020-10-22 00:52:54,811 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 12 transitions, 34 flow [2020-10-22 00:52:54,821 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-10-22 00:52:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-10-22 00:52:54,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-22 00:52:54,829 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:52:54,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-22 00:52:54,830 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-22 00:52:54,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:52:54,835 INFO L82 PathProgramCache]: Analyzing trace with hash 270931, now seen corresponding path program 1 times [2020-10-22 00:52:54,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:52:54,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495288206] [2020-10-22 00:52:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:52:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:52:55,058 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-22 00:52:55,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495288206] [2020-10-22 00:52:55,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:52:55,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:52:55,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [740085724] [2020-10-22 00:52:55,062 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:52:55,064 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:52:55,077 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-22 00:52:55,078 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:52:55,083 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:52:55,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:52:55,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:52:55,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:52:55,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:52:55,103 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-10-22 00:52:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:52:55,132 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2020-10-22 00:52:55,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:52:55,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-22 00:52:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:52:55,144 INFO L225 Difference]: With dead ends: 35 [2020-10-22 00:52:55,145 INFO L226 Difference]: Without dead ends: 31 [2020-10-22 00:52:55,146 INFO L677 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-22 00:52:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-22 00:52:55,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-22 00:52:55,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-22 00:52:55,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-10-22 00:52:55,187 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2020-10-22 00:52:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:52:55,188 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-10-22 00:52:55,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:52:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-10-22 00:52:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-22 00:52:55,189 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:52:55,189 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:52:55,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:52:55,190 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-22 00:52:55,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:52:55,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1075906219, now seen corresponding path program 1 times [2020-10-22 00:52:55,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:52:55,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991881182] [2020-10-22 00:52:55,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:52:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:52:55,289 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-22 00:52:55,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991881182] [2020-10-22 00:52:55,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:52:55,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:52:55,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2128889255] [2020-10-22 00:52:55,290 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:52:55,292 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:52:55,295 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-22 00:52:55,296 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:52:55,296 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:52:55,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:52:55,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:52:55,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:52:55,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:52:55,299 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2020-10-22 00:52:55,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:52:55,323 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-10-22 00:52:55,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:52:55,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-10-22 00:52:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:52:55,324 INFO L225 Difference]: With dead ends: 26 [2020-10-22 00:52:55,324 INFO L226 Difference]: Without dead ends: 24 [2020-10-22 00:52:55,325 INFO L677 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-22 00:52:55,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-22 00:52:55,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-22 00:52:55,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-22 00:52:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-10-22 00:52:55,330 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2020-10-22 00:52:55,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:52:55,331 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-10-22 00:52:55,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:52:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-10-22 00:52:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-22 00:52:55,332 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:52:55,332 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-22 00:52:55,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:52:55,332 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-22 00:52:55,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:52:55,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1006649777, now seen corresponding path program 1 times [2020-10-22 00:52:55,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:52:55,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313073195] [2020-10-22 00:52:55,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:52:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:52:55,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:52:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:52:55,385 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:52:55,411 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:52:55,412 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:52:55,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:52:55,412 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 00:52:55,414 WARN L371 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-22 00:52:55,414 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-10-22 00:52:55,424 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,424 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,424 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,424 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,425 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,425 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,425 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,425 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,425 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,426 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,426 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,426 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,426 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,426 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,427 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,428 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,428 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,428 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,429 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,429 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,431 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,431 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,431 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,432 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,432 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,433 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,433 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,433 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,433 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,434 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,434 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,434 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,437 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,437 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,437 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,437 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,438 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,441 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,441 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,442 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,443 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,443 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,444 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,444 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:55,446 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:52:55,446 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-22 00:52:55,446 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:52:55,447 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:52:55,447 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:52:55,447 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:52:55,447 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:52:55,447 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:52:55,447 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:52:55,448 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:52:55,450 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:52:55,451 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 88 transitions, 200 flow [2020-10-22 00:52:55,451 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 88 transitions, 200 flow [2020-10-22 00:52:55,451 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 92 places, 88 transitions, 200 flow [2020-10-22 00:52:55,476 INFO L129 PetriNetUnfolder]: 6/98 cut-off events. [2020-10-22 00:52:55,476 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-22 00:52:55,478 INFO L80 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 98 events. 6/98 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 145 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 107. Up to 6 conditions per place. [2020-10-22 00:52:55,481 INFO L116 LiptonReduction]: Number of co-enabled transitions 1220 [2020-10-22 00:52:57,025 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2020-10-22 00:52:57,133 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-10-22 00:52:57,642 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-10-22 00:52:57,909 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2020-10-22 00:52:57,915 INFO L131 LiptonReduction]: Checked pairs total: 1551 [2020-10-22 00:52:57,916 INFO L133 LiptonReduction]: Total number of compositions: 86 [2020-10-22 00:52:57,916 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 21 transitions, 66 flow [2020-10-22 00:52:57,928 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2020-10-22 00:52:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2020-10-22 00:52:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-22 00:52:57,929 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:52:57,929 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-22 00:52:57,930 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:52:57,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:52:57,933 INFO L82 PathProgramCache]: Analyzing trace with hash 464008, now seen corresponding path program 1 times [2020-10-22 00:52:57,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:52:57,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829852355] [2020-10-22 00:52:57,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:52:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:52:57,976 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-22 00:52:57,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829852355] [2020-10-22 00:52:57,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:52:57,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:52:57,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [635600316] [2020-10-22 00:52:57,978 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:52:57,978 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:52:57,979 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-22 00:52:57,979 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:52:57,980 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:52:57,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:52:57,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:52:57,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:52:57,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:52:57,981 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2020-10-22 00:52:58,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:52:58,027 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2020-10-22 00:52:58,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:52:58,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-22 00:52:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:52:58,033 INFO L225 Difference]: With dead ends: 185 [2020-10-22 00:52:58,034 INFO L226 Difference]: Without dead ends: 171 [2020-10-22 00:52:58,034 INFO L677 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-22 00:52:58,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-22 00:52:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-10-22 00:52:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-10-22 00:52:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 418 transitions. [2020-10-22 00:52:58,063 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 418 transitions. Word has length 3 [2020-10-22 00:52:58,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:52:58,064 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 418 transitions. [2020-10-22 00:52:58,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:52:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 418 transitions. [2020-10-22 00:52:58,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 00:52:58,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:52:58,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:52:58,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:52:58,065 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:52:58,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:52:58,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2038027130, now seen corresponding path program 1 times [2020-10-22 00:52:58,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:52:58,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039029311] [2020-10-22 00:52:58,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:52:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:52:58,128 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-22 00:52:58,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039029311] [2020-10-22 00:52:58,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:52:58,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:52:58,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [42038874] [2020-10-22 00:52:58,129 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:52:58,130 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:52:58,133 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 00:52:58,133 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:52:58,133 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:52:58,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:52:58,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:52:58,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:52:58,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:52:58,135 INFO L87 Difference]: Start difference. First operand 171 states and 418 transitions. Second operand 5 states. [2020-10-22 00:52:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:52:58,245 INFO L93 Difference]: Finished difference Result 205 states and 460 transitions. [2020-10-22 00:52:58,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:52:58,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-22 00:52:58,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:52:58,249 INFO L225 Difference]: With dead ends: 205 [2020-10-22 00:52:58,249 INFO L226 Difference]: Without dead ends: 201 [2020-10-22 00:52:58,250 INFO L677 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-22 00:52:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-22 00:52:58,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2020-10-22 00:52:58,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-22 00:52:58,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2020-10-22 00:52:58,269 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2020-10-22 00:52:58,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:52:58,270 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2020-10-22 00:52:58,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:52:58,270 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2020-10-22 00:52:58,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:52:58,271 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:52:58,271 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:52:58,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:52:58,272 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:52:58,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:52:58,272 INFO L82 PathProgramCache]: Analyzing trace with hash -460391635, now seen corresponding path program 1 times [2020-10-22 00:52:58,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:52:58,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294765520] [2020-10-22 00:52:58,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:52:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:52:58,336 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-22 00:52:58,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294765520] [2020-10-22 00:52:58,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:52:58,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:52:58,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [81191064] [2020-10-22 00:52:58,337 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:52:58,339 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:52:58,341 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-10-22 00:52:58,341 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:52:58,342 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:52:58,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:52:58,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:52:58,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:52:58,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:52:58,343 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2020-10-22 00:52:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:52:58,420 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2020-10-22 00:52:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:52:58,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-22 00:52:58,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:52:58,423 INFO L225 Difference]: With dead ends: 189 [2020-10-22 00:52:58,423 INFO L226 Difference]: Without dead ends: 185 [2020-10-22 00:52:58,423 INFO L677 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-22 00:52:58,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-22 00:52:58,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2020-10-22 00:52:58,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-22 00:52:58,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2020-10-22 00:52:58,437 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2020-10-22 00:52:58,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:52:58,438 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2020-10-22 00:52:58,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:52:58,438 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2020-10-22 00:52:58,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:52:58,439 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:52:58,440 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:52:58,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:52:58,440 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:52:58,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:52:58,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1390371680, now seen corresponding path program 1 times [2020-10-22 00:52:58,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:52:58,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436849514] [2020-10-22 00:52:58,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:52:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:52:58,461 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:52:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:52:58,476 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:52:58,484 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:52:58,484 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:52:58,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:52:58,485 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 00:52:58,486 WARN L371 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-22 00:52:58,487 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-10-22 00:52:58,498 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,498 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,498 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,499 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,499 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,499 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,499 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,499 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,500 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,500 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,500 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,500 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,500 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,500 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,501 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,501 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,501 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,501 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,501 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,502 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,502 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,502 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,502 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,503 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,504 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,504 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,505 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,505 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,506 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,506 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,510 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,511 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,511 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,511 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,511 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,515 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,516 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,516 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,516 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,516 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,517 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,518 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,518 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,518 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,518 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,519 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,520 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,520 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,521 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,521 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,522 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,523 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,523 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,524 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,524 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,525 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,525 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,526 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,526 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:52:58,528 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:52:58,528 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 00:52:58,529 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:52:58,529 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:52:58,529 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:52:58,529 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:52:58,529 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:52:58,529 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:52:58,529 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:52:58,529 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:52:58,532 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:52:58,532 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 109 transitions, 260 flow [2020-10-22 00:52:58,533 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 109 transitions, 260 flow [2020-10-22 00:52:58,533 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 115 places, 109 transitions, 260 flow [2020-10-22 00:52:58,557 INFO L129 PetriNetUnfolder]: 7/119 cut-off events. [2020-10-22 00:52:58,557 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-22 00:52:58,558 INFO L80 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 119 events. 7/119 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 186 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 133. Up to 8 conditions per place. [2020-10-22 00:52:58,562 INFO L116 LiptonReduction]: Number of co-enabled transitions 1668 [2020-10-22 00:53:00,156 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-10-22 00:53:00,692 WARN L193 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2020-10-22 00:53:00,847 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-22 00:53:01,138 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2020-10-22 00:53:01,266 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-22 00:53:01,273 INFO L131 LiptonReduction]: Checked pairs total: 2216 [2020-10-22 00:53:01,273 INFO L133 LiptonReduction]: Total number of compositions: 107 [2020-10-22 00:53:01,273 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 27 transitions, 96 flow [2020-10-22 00:53:01,303 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2020-10-22 00:53:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2020-10-22 00:53:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-22 00:53:01,304 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:01,304 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-22 00:53:01,305 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:53:01,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:01,305 INFO L82 PathProgramCache]: Analyzing trace with hash 698655, now seen corresponding path program 1 times [2020-10-22 00:53:01,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:01,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451473221] [2020-10-22 00:53:01,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:01,342 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-22 00:53:01,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451473221] [2020-10-22 00:53:01,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:01,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:53:01,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1637000986] [2020-10-22 00:53:01,344 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:01,344 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:01,345 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-22 00:53:01,345 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:01,345 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:01,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:53:01,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:01,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:53:01,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:53:01,346 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2020-10-22 00:53:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:01,407 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2020-10-22 00:53:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:53:01,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-22 00:53:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:01,417 INFO L225 Difference]: With dead ends: 600 [2020-10-22 00:53:01,417 INFO L226 Difference]: Without dead ends: 559 [2020-10-22 00:53:01,417 INFO L677 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-22 00:53:01,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-10-22 00:53:01,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2020-10-22 00:53:01,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2020-10-22 00:53:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1737 transitions. [2020-10-22 00:53:01,476 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1737 transitions. Word has length 3 [2020-10-22 00:53:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:01,476 INFO L481 AbstractCegarLoop]: Abstraction has 559 states and 1737 transitions. [2020-10-22 00:53:01,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:53:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1737 transitions. [2020-10-22 00:53:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 00:53:01,477 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:01,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:01,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:53:01,478 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:53:01,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:01,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1614105147, now seen corresponding path program 1 times [2020-10-22 00:53:01,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:01,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103127524] [2020-10-22 00:53:01,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:01,573 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-22 00:53:01,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103127524] [2020-10-22 00:53:01,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:01,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:53:01,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [933903997] [2020-10-22 00:53:01,574 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:01,575 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:01,576 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 00:53:01,577 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:01,577 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:01,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:53:01,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:01,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:53:01,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:53:01,582 INFO L87 Difference]: Start difference. First operand 559 states and 1737 transitions. Second operand 5 states. [2020-10-22 00:53:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:01,697 INFO L93 Difference]: Finished difference Result 817 states and 2317 transitions. [2020-10-22 00:53:01,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:53:01,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-22 00:53:01,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:01,705 INFO L225 Difference]: With dead ends: 817 [2020-10-22 00:53:01,706 INFO L226 Difference]: Without dead ends: 812 [2020-10-22 00:53:01,707 INFO L677 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-22 00:53:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-10-22 00:53:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 585. [2020-10-22 00:53:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2020-10-22 00:53:01,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1832 transitions. [2020-10-22 00:53:01,742 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1832 transitions. Word has length 9 [2020-10-22 00:53:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:01,743 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 1832 transitions. [2020-10-22 00:53:01,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:53:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1832 transitions. [2020-10-22 00:53:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:53:01,749 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:01,749 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:01,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 00:53:01,749 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:53:01,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:01,750 INFO L82 PathProgramCache]: Analyzing trace with hash 222037333, now seen corresponding path program 1 times [2020-10-22 00:53:01,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:01,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137764525] [2020-10-22 00:53:01,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:01,841 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-22 00:53:01,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137764525] [2020-10-22 00:53:01,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:01,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:53:01,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1716012421] [2020-10-22 00:53:01,844 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:01,846 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:01,848 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-10-22 00:53:01,849 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:01,849 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:01,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:53:01,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:01,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:53:01,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:53:01,852 INFO L87 Difference]: Start difference. First operand 585 states and 1832 transitions. Second operand 5 states. [2020-10-22 00:53:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:01,950 INFO L93 Difference]: Finished difference Result 843 states and 2406 transitions. [2020-10-22 00:53:01,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:53:01,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-22 00:53:01,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:01,957 INFO L225 Difference]: With dead ends: 843 [2020-10-22 00:53:01,957 INFO L226 Difference]: Without dead ends: 836 [2020-10-22 00:53:01,957 INFO L677 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-22 00:53:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2020-10-22 00:53:01,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 611. [2020-10-22 00:53:01,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2020-10-22 00:53:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1906 transitions. [2020-10-22 00:53:01,989 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1906 transitions. Word has length 13 [2020-10-22 00:53:01,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:01,991 INFO L481 AbstractCegarLoop]: Abstraction has 611 states and 1906 transitions. [2020-10-22 00:53:01,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:53:01,991 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1906 transitions. [2020-10-22 00:53:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:53:01,994 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:01,994 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:01,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 00:53:01,994 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:53:01,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:01,995 INFO L82 PathProgramCache]: Analyzing trace with hash -24425909, now seen corresponding path program 1 times [2020-10-22 00:53:01,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:01,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073671624] [2020-10-22 00:53:01,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:02,108 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-22 00:53:02,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073671624] [2020-10-22 00:53:02,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715198127] [2020-10-22 00:53:02,112 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-22 00:53:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:02,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-22 00:53:02,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:53:02,302 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-22 00:53:02,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:53:02,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-22 00:53:02,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [795960218] [2020-10-22 00:53:02,303 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:02,304 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:02,309 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-10-22 00:53:02,309 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:02,409 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:02,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:53:02,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:02,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:53:02,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-22 00:53:02,410 INFO L87 Difference]: Start difference. First operand 611 states and 1906 transitions. Second operand 7 states. [2020-10-22 00:53:02,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:02,729 INFO L93 Difference]: Finished difference Result 1059 states and 2818 transitions. [2020-10-22 00:53:02,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:02,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-22 00:53:02,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:02,737 INFO L225 Difference]: With dead ends: 1059 [2020-10-22 00:53:02,737 INFO L226 Difference]: Without dead ends: 1052 [2020-10-22 00:53:02,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2020-10-22 00:53:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-10-22 00:53:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 591. [2020-10-22 00:53:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-22 00:53:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1840 transitions. [2020-10-22 00:53:02,768 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1840 transitions. Word has length 15 [2020-10-22 00:53:02,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:02,769 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 1840 transitions. [2020-10-22 00:53:02,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:53:02,769 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1840 transitions. [2020-10-22 00:53:02,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:53:02,770 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:02,770 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:02,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-10-22 00:53:02,986 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:53:02,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:02,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1370486663, now seen corresponding path program 2 times [2020-10-22 00:53:02,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:02,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952480871] [2020-10-22 00:53:02,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:03,047 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-22 00:53:03,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952480871] [2020-10-22 00:53:03,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:03,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:53:03,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [241692424] [2020-10-22 00:53:03,048 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:03,050 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:03,052 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2020-10-22 00:53:03,052 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:03,053 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:03,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:53:03,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:03,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:53:03,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:53:03,054 INFO L87 Difference]: Start difference. First operand 591 states and 1840 transitions. Second operand 7 states. [2020-10-22 00:53:03,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:03,316 INFO L93 Difference]: Finished difference Result 1053 states and 2807 transitions. [2020-10-22 00:53:03,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:03,317 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-22 00:53:03,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:03,324 INFO L225 Difference]: With dead ends: 1053 [2020-10-22 00:53:03,324 INFO L226 Difference]: Without dead ends: 1045 [2020-10-22 00:53:03,325 INFO L677 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-22 00:53:03,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2020-10-22 00:53:03,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2020-10-22 00:53:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2020-10-22 00:53:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2020-10-22 00:53:03,351 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2020-10-22 00:53:03,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:03,351 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2020-10-22 00:53:03,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:53:03,352 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2020-10-22 00:53:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 00:53:03,353 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:03,353 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:03,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 00:53:03,353 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:53:03,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:03,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1795391144, now seen corresponding path program 1 times [2020-10-22 00:53:03,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:03,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948522989] [2020-10-22 00:53:03,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:03,401 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-22 00:53:03,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948522989] [2020-10-22 00:53:03,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:03,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:53:03,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [551760571] [2020-10-22 00:53:03,403 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:03,404 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:03,407 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-10-22 00:53:03,407 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:03,408 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:03,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:53:03,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:03,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:53:03,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:53:03,409 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2020-10-22 00:53:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:03,508 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2020-10-22 00:53:03,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:53:03,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-22 00:53:03,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:03,514 INFO L225 Difference]: With dead ends: 736 [2020-10-22 00:53:03,514 INFO L226 Difference]: Without dead ends: 728 [2020-10-22 00:53:03,514 INFO L677 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-22 00:53:03,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-10-22 00:53:03,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2020-10-22 00:53:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2020-10-22 00:53:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2020-10-22 00:53:03,536 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2020-10-22 00:53:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:03,537 INFO L481 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2020-10-22 00:53:03,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:53:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2020-10-22 00:53:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 00:53:03,538 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:03,538 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:03,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 00:53:03,538 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:53:03,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:03,539 INFO L82 PathProgramCache]: Analyzing trace with hash -181443140, now seen corresponding path program 1 times [2020-10-22 00:53:03,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:03,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448834998] [2020-10-22 00:53:03,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:53:03,553 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:53:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:53:03,564 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:53:03,572 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:53:03,572 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:53:03,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-22 00:53:03,573 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 00:53:03,574 WARN L371 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-22 00:53:03,574 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-10-22 00:53:03,587 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,587 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,587 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,587 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,588 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,588 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,588 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,588 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,588 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,588 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,588 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,589 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,589 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,589 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,589 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,589 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,589 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,589 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,590 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,590 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,590 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,590 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,590 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,590 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,591 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,591 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,591 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,591 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,591 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,592 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,592 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,599 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,600 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,600 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,600 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,601 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,601 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,601 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,603 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,603 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,603 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,603 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,603 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,605 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,605 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,605 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,605 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,605 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,607 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,607 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,607 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,607 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,607 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,609 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,609 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,610 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,610 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,611 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,612 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,612 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,613 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,618 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,619 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:03,620 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:53:03,621 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-22 00:53:03,621 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:53:03,621 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:53:03,621 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:53:03,621 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:53:03,622 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:53:03,622 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:53:03,622 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:53:03,622 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:53:03,624 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:53:03,624 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 130 transitions, 324 flow [2020-10-22 00:53:03,624 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 130 transitions, 324 flow [2020-10-22 00:53:03,624 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 138 places, 130 transitions, 324 flow [2020-10-22 00:53:03,647 INFO L129 PetriNetUnfolder]: 8/140 cut-off events. [2020-10-22 00:53:03,647 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-22 00:53:03,649 INFO L80 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 140 events. 8/140 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 235 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 160. Up to 10 conditions per place. [2020-10-22 00:53:03,653 INFO L116 LiptonReduction]: Number of co-enabled transitions 2176 [2020-10-22 00:53:05,834 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2020-10-22 00:53:06,154 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2020-10-22 00:53:06,270 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-22 00:53:06,281 INFO L131 LiptonReduction]: Checked pairs total: 3275 [2020-10-22 00:53:06,281 INFO L133 LiptonReduction]: Total number of compositions: 134 [2020-10-22 00:53:06,281 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 33 transitions, 130 flow [2020-10-22 00:53:06,402 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2020-10-22 00:53:06,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2020-10-22 00:53:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-22 00:53:06,403 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:06,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-22 00:53:06,404 INFO L429 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-22 00:53:06,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:06,404 INFO L82 PathProgramCache]: Analyzing trace with hash 980800, now seen corresponding path program 1 times [2020-10-22 00:53:06,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:06,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372721863] [2020-10-22 00:53:06,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:06,436 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-22 00:53:06,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372721863] [2020-10-22 00:53:06,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:06,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:53:06,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [707963938] [2020-10-22 00:53:06,437 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:06,437 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:06,438 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-22 00:53:06,438 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:06,438 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:06,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:53:06,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:06,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:53:06,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:53:06,439 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2020-10-22 00:53:06,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:06,481 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2020-10-22 00:53:06,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:53:06,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-22 00:53:06,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:06,498 INFO L225 Difference]: With dead ends: 1889 [2020-10-22 00:53:06,498 INFO L226 Difference]: Without dead ends: 1767 [2020-10-22 00:53:06,499 INFO L677 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-22 00:53:06,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2020-10-22 00:53:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2020-10-22 00:53:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2020-10-22 00:53:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 6690 transitions. [2020-10-22 00:53:06,581 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 6690 transitions. Word has length 3 [2020-10-22 00:53:06,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:06,581 INFO L481 AbstractCegarLoop]: Abstraction has 1767 states and 6690 transitions. [2020-10-22 00:53:06,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:53:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 6690 transitions. [2020-10-22 00:53:06,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 00:53:06,582 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:06,582 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:06,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-22 00:53:06,583 INFO L429 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-22 00:53:06,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:06,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1761952613, now seen corresponding path program 1 times [2020-10-22 00:53:06,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:06,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255313548] [2020-10-22 00:53:06,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:06,630 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-22 00:53:06,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255313548] [2020-10-22 00:53:06,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:06,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:53:06,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [574166996] [2020-10-22 00:53:06,631 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:06,632 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:06,633 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 00:53:06,633 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:06,633 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:06,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:53:06,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:06,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:53:06,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:53:06,634 INFO L87 Difference]: Start difference. First operand 1767 states and 6690 transitions. Second operand 5 states. [2020-10-22 00:53:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:06,751 INFO L93 Difference]: Finished difference Result 2905 states and 10138 transitions. [2020-10-22 00:53:06,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:53:06,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-22 00:53:06,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:06,776 INFO L225 Difference]: With dead ends: 2905 [2020-10-22 00:53:06,776 INFO L226 Difference]: Without dead ends: 2899 [2020-10-22 00:53:06,777 INFO L677 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-22 00:53:06,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-10-22 00:53:06,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1966. [2020-10-22 00:53:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2020-10-22 00:53:06,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 7503 transitions. [2020-10-22 00:53:06,877 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 7503 transitions. Word has length 9 [2020-10-22 00:53:06,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:06,877 INFO L481 AbstractCegarLoop]: Abstraction has 1966 states and 7503 transitions. [2020-10-22 00:53:06,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:53:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 7503 transitions. [2020-10-22 00:53:06,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:53:06,878 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:06,878 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:06,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-22 00:53:06,878 INFO L429 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-22 00:53:06,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:06,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1954545134, now seen corresponding path program 1 times [2020-10-22 00:53:06,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:06,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582618294] [2020-10-22 00:53:06,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:06,930 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-22 00:53:06,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582618294] [2020-10-22 00:53:06,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:06,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:53:06,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [507803453] [2020-10-22 00:53:06,932 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:06,933 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:06,934 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-10-22 00:53:06,935 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:06,936 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:06,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:53:06,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:06,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:53:06,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:53:06,938 INFO L87 Difference]: Start difference. First operand 1966 states and 7503 transitions. Second operand 5 states. [2020-10-22 00:53:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:07,059 INFO L93 Difference]: Finished difference Result 3204 states and 11312 transitions. [2020-10-22 00:53:07,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:53:07,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-22 00:53:07,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:07,095 INFO L225 Difference]: With dead ends: 3204 [2020-10-22 00:53:07,095 INFO L226 Difference]: Without dead ends: 3194 [2020-10-22 00:53:07,096 INFO L677 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-22 00:53:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2020-10-22 00:53:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2200. [2020-10-22 00:53:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2020-10-22 00:53:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 8453 transitions. [2020-10-22 00:53:07,241 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 8453 transitions. Word has length 13 [2020-10-22 00:53:07,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:07,244 INFO L481 AbstractCegarLoop]: Abstraction has 2200 states and 8453 transitions. [2020-10-22 00:53:07,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:53:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 8453 transitions. [2020-10-22 00:53:07,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:53:07,245 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:07,245 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:07,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-22 00:53:07,245 INFO L429 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-22 00:53:07,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:07,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1417153478, now seen corresponding path program 1 times [2020-10-22 00:53:07,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:07,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368560217] [2020-10-22 00:53:07,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:07,307 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-22 00:53:07,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368560217] [2020-10-22 00:53:07,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:07,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:53:07,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [108827585] [2020-10-22 00:53:07,308 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:07,309 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:07,311 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2020-10-22 00:53:07,311 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:07,312 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:07,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:53:07,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:07,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:53:07,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:53:07,313 INFO L87 Difference]: Start difference. First operand 2200 states and 8453 transitions. Second operand 7 states. [2020-10-22 00:53:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:07,645 INFO L93 Difference]: Finished difference Result 4556 states and 14911 transitions. [2020-10-22 00:53:07,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:07,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-22 00:53:07,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:07,666 INFO L225 Difference]: With dead ends: 4556 [2020-10-22 00:53:07,666 INFO L226 Difference]: Without dead ends: 4546 [2020-10-22 00:53:07,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-22 00:53:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2020-10-22 00:53:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 2157. [2020-10-22 00:53:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2020-10-22 00:53:07,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 8278 transitions. [2020-10-22 00:53:07,778 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 8278 transitions. Word has length 15 [2020-10-22 00:53:07,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:07,778 INFO L481 AbstractCegarLoop]: Abstraction has 2157 states and 8278 transitions. [2020-10-22 00:53:07,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:53:07,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 8278 transitions. [2020-10-22 00:53:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:53:07,779 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:07,779 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:07,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-22 00:53:07,780 INFO L429 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-22 00:53:07,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:07,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1419653318, now seen corresponding path program 2 times [2020-10-22 00:53:07,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:07,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008234849] [2020-10-22 00:53:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:07,843 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-22 00:53:07,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008234849] [2020-10-22 00:53:07,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:07,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:53:07,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1503959786] [2020-10-22 00:53:07,844 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:07,845 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:07,848 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-10-22 00:53:07,848 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:07,967 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:07,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:53:07,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:07,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:53:07,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:53:07,968 INFO L87 Difference]: Start difference. First operand 2157 states and 8278 transitions. Second operand 7 states. [2020-10-22 00:53:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:08,332 INFO L93 Difference]: Finished difference Result 4612 states and 15111 transitions. [2020-10-22 00:53:08,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:08,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-22 00:53:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:08,351 INFO L225 Difference]: With dead ends: 4612 [2020-10-22 00:53:08,351 INFO L226 Difference]: Without dead ends: 4601 [2020-10-22 00:53:08,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-22 00:53:08,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2020-10-22 00:53:08,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 2035. [2020-10-22 00:53:08,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2020-10-22 00:53:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 7845 transitions. [2020-10-22 00:53:08,457 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 7845 transitions. Word has length 15 [2020-10-22 00:53:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:08,457 INFO L481 AbstractCegarLoop]: Abstraction has 2035 states and 7845 transitions. [2020-10-22 00:53:08,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:53:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 7845 transitions. [2020-10-22 00:53:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 00:53:08,458 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:08,458 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:08,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-22 00:53:08,459 INFO L429 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-22 00:53:08,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:08,459 INFO L82 PathProgramCache]: Analyzing trace with hash 795193170, now seen corresponding path program 1 times [2020-10-22 00:53:08,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:08,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019895030] [2020-10-22 00:53:08,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:08,507 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-22 00:53:08,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019895030] [2020-10-22 00:53:08,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:08,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:53:08,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1573612062] [2020-10-22 00:53:08,508 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:08,510 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:08,513 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-10-22 00:53:08,513 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:08,513 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:08,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:53:08,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:08,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:53:08,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:53:08,514 INFO L87 Difference]: Start difference. First operand 2035 states and 7845 transitions. Second operand 5 states. [2020-10-22 00:53:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:08,670 INFO L93 Difference]: Finished difference Result 3265 states and 11681 transitions. [2020-10-22 00:53:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:53:08,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-22 00:53:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:08,685 INFO L225 Difference]: With dead ends: 3265 [2020-10-22 00:53:08,686 INFO L226 Difference]: Without dead ends: 3250 [2020-10-22 00:53:08,686 INFO L677 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-22 00:53:08,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2020-10-22 00:53:08,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2281. [2020-10-22 00:53:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2020-10-22 00:53:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 8755 transitions. [2020-10-22 00:53:08,782 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 8755 transitions. Word has length 17 [2020-10-22 00:53:08,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:08,782 INFO L481 AbstractCegarLoop]: Abstraction has 2281 states and 8755 transitions. [2020-10-22 00:53:08,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:53:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 8755 transitions. [2020-10-22 00:53:08,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 00:53:08,783 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:08,784 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:08,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-22 00:53:08,784 INFO L429 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-22 00:53:08,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:08,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1006706982, now seen corresponding path program 1 times [2020-10-22 00:53:08,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:08,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855680053] [2020-10-22 00:53:08,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:08,855 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-22 00:53:08,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855680053] [2020-10-22 00:53:08,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976311707] [2020-10-22 00:53:08,856 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-22 00:53:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:08,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-22 00:53:08,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:53:09,041 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-22 00:53:09,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:53:09,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-22 00:53:09,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1227646520] [2020-10-22 00:53:09,042 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:09,044 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:09,049 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 35 transitions. [2020-10-22 00:53:09,049 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:09,147 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [49646#(<= (+ thr2Thread2of4ForFork0_~t~0 20) ~n~0), 49647#(<= (+ ~x~0 20) ~n~0)] [2020-10-22 00:53:09,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:53:09,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:09,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:53:09,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:53:09,148 INFO L87 Difference]: Start difference. First operand 2281 states and 8755 transitions. Second operand 9 states. [2020-10-22 00:53:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:09,498 INFO L93 Difference]: Finished difference Result 4825 states and 15986 transitions. [2020-10-22 00:53:09,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:09,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-22 00:53:09,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:09,518 INFO L225 Difference]: With dead ends: 4825 [2020-10-22 00:53:09,519 INFO L226 Difference]: Without dead ends: 4813 [2020-10-22 00:53:09,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-22 00:53:09,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2020-10-22 00:53:09,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 2305. [2020-10-22 00:53:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2020-10-22 00:53:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 8815 transitions. [2020-10-22 00:53:09,626 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 8815 transitions. Word has length 19 [2020-10-22 00:53:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:09,627 INFO L481 AbstractCegarLoop]: Abstraction has 2305 states and 8815 transitions. [2020-10-22 00:53:09,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:53:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 8815 transitions. [2020-10-22 00:53:09,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 00:53:09,629 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:09,629 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:09,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:53:09,844 INFO L429 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-22 00:53:09,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:09,844 INFO L82 PathProgramCache]: Analyzing trace with hash -323556866, now seen corresponding path program 2 times [2020-10-22 00:53:09,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:09,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764057871] [2020-10-22 00:53:09,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:09,903 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-22 00:53:09,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764057871] [2020-10-22 00:53:09,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:09,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:53:09,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [102010143] [2020-10-22 00:53:09,905 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:09,907 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:09,909 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 19 transitions. [2020-10-22 00:53:09,910 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:09,910 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:09,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:53:09,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:09,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:53:09,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:53:09,911 INFO L87 Difference]: Start difference. First operand 2305 states and 8815 transitions. Second operand 7 states. [2020-10-22 00:53:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:10,256 INFO L93 Difference]: Finished difference Result 4886 states and 16183 transitions. [2020-10-22 00:53:10,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:10,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-22 00:53:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:10,273 INFO L225 Difference]: With dead ends: 4886 [2020-10-22 00:53:10,273 INFO L226 Difference]: Without dead ends: 4869 [2020-10-22 00:53:10,274 INFO L677 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-22 00:53:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2020-10-22 00:53:10,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 2153. [2020-10-22 00:53:10,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2153 states. [2020-10-22 00:53:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 2153 states and 8255 transitions. [2020-10-22 00:53:10,381 INFO L78 Accepts]: Start accepts. Automaton has 2153 states and 8255 transitions. Word has length 19 [2020-10-22 00:53:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:10,381 INFO L481 AbstractCegarLoop]: Abstraction has 2153 states and 8255 transitions. [2020-10-22 00:53:10,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:53:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 8255 transitions. [2020-10-22 00:53:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 00:53:10,383 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:10,383 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:10,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-22 00:53:10,383 INFO L429 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-22 00:53:10,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:10,384 INFO L82 PathProgramCache]: Analyzing trace with hash -323554262, now seen corresponding path program 1 times [2020-10-22 00:53:10,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:10,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327994181] [2020-10-22 00:53:10,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:10,440 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-22 00:53:10,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327994181] [2020-10-22 00:53:10,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:10,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:53:10,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [764080098] [2020-10-22 00:53:10,441 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:10,443 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:10,447 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 19 transitions. [2020-10-22 00:53:10,447 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:10,447 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:10,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:53:10,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:10,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:53:10,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:53:10,449 INFO L87 Difference]: Start difference. First operand 2153 states and 8255 transitions. Second operand 7 states. [2020-10-22 00:53:10,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:10,745 INFO L93 Difference]: Finished difference Result 4782 states and 15862 transitions. [2020-10-22 00:53:10,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:10,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-22 00:53:10,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:10,760 INFO L225 Difference]: With dead ends: 4782 [2020-10-22 00:53:10,760 INFO L226 Difference]: Without dead ends: 4765 [2020-10-22 00:53:10,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-22 00:53:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4765 states. [2020-10-22 00:53:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4765 to 2212. [2020-10-22 00:53:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2212 states. [2020-10-22 00:53:10,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 8465 transitions. [2020-10-22 00:53:10,862 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 8465 transitions. Word has length 19 [2020-10-22 00:53:10,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:10,863 INFO L481 AbstractCegarLoop]: Abstraction has 2212 states and 8465 transitions. [2020-10-22 00:53:10,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:53:10,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 8465 transitions. [2020-10-22 00:53:10,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 00:53:10,864 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:10,865 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:10,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-22 00:53:10,865 INFO L429 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-22 00:53:10,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:10,866 INFO L82 PathProgramCache]: Analyzing trace with hash -307543382, now seen corresponding path program 2 times [2020-10-22 00:53:10,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:10,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446828065] [2020-10-22 00:53:10,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:10,929 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-22 00:53:10,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446828065] [2020-10-22 00:53:10,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:10,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:53:10,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [844078998] [2020-10-22 00:53:10,931 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:10,932 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:10,937 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 51 transitions. [2020-10-22 00:53:10,938 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:11,120 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:11,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:53:11,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:11,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:53:11,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:53:11,121 INFO L87 Difference]: Start difference. First operand 2212 states and 8465 transitions. Second operand 7 states. [2020-10-22 00:53:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:11,424 INFO L93 Difference]: Finished difference Result 4774 states and 15828 transitions. [2020-10-22 00:53:11,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:11,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-22 00:53:11,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:11,434 INFO L225 Difference]: With dead ends: 4774 [2020-10-22 00:53:11,434 INFO L226 Difference]: Without dead ends: 4757 [2020-10-22 00:53:11,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-22 00:53:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2020-10-22 00:53:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 2150. [2020-10-22 00:53:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2020-10-22 00:53:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 8243 transitions. [2020-10-22 00:53:11,527 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 8243 transitions. Word has length 19 [2020-10-22 00:53:11,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:11,527 INFO L481 AbstractCegarLoop]: Abstraction has 2150 states and 8243 transitions. [2020-10-22 00:53:11,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:53:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 8243 transitions. [2020-10-22 00:53:11,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:53:11,529 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:11,529 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:11,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-22 00:53:11,529 INFO L429 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-22 00:53:11,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:11,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1077756158, now seen corresponding path program 1 times [2020-10-22 00:53:11,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:11,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702207112] [2020-10-22 00:53:11,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:11,652 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-22 00:53:11,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702207112] [2020-10-22 00:53:11,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107942408] [2020-10-22 00:53:11,653 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-22 00:53:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:11,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:53:11,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:53:11,846 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-22 00:53:11,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:53:11,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:53:11,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [511835877] [2020-10-22 00:53:11,847 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:11,849 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:11,855 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 37 transitions. [2020-10-22 00:53:11,856 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:11,955 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [86717#(<= (+ ~x~0 20) ~n~0), 86716#(<= (+ thr2Thread2of4ForFork0_~t~0 20) ~n~0)] [2020-10-22 00:53:11,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:53:11,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:11,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:53:11,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:53:11,956 INFO L87 Difference]: Start difference. First operand 2150 states and 8243 transitions. Second operand 11 states. [2020-10-22 00:53:12,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:12,902 INFO L93 Difference]: Finished difference Result 6025 states and 18746 transitions. [2020-10-22 00:53:12,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:53:12,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-22 00:53:12,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:12,914 INFO L225 Difference]: With dead ends: 6025 [2020-10-22 00:53:12,914 INFO L226 Difference]: Without dead ends: 6017 [2020-10-22 00:53:12,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:53:12,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-10-22 00:53:12,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 2121. [2020-10-22 00:53:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2121 states. [2020-10-22 00:53:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 8118 transitions. [2020-10-22 00:53:12,991 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 8118 transitions. Word has length 21 [2020-10-22 00:53:12,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:12,991 INFO L481 AbstractCegarLoop]: Abstraction has 2121 states and 8118 transitions. [2020-10-22 00:53:12,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:53:12,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 8118 transitions. [2020-10-22 00:53:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:53:12,993 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:12,993 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:13,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-10-22 00:53:13,200 INFO L429 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-22 00:53:13,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:13,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1093767038, now seen corresponding path program 2 times [2020-10-22 00:53:13,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:13,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846017937] [2020-10-22 00:53:13,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:13,275 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-22 00:53:13,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846017937] [2020-10-22 00:53:13,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662880285] [2020-10-22 00:53:13,276 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 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-22 00:53:13,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-22 00:53:13,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-22 00:53:13,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:53:13,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:53:13,543 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-22 00:53:13,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:53:13,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:53:13,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1489077221] [2020-10-22 00:53:13,544 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:13,546 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:13,554 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 53 transitions. [2020-10-22 00:53:13,554 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:13,721 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [97107#(<= (+ thr2Thread2of4ForFork0_~t~0 20) ~n~0), 97108#(<= (+ ~x~0 20) ~n~0)] [2020-10-22 00:53:13,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:53:13,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:13,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:53:13,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:53:13,722 INFO L87 Difference]: Start difference. First operand 2121 states and 8118 transitions. Second operand 11 states. [2020-10-22 00:53:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:14,621 INFO L93 Difference]: Finished difference Result 5922 states and 18404 transitions. [2020-10-22 00:53:14,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:53:14,621 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-22 00:53:14,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:14,632 INFO L225 Difference]: With dead ends: 5922 [2020-10-22 00:53:14,632 INFO L226 Difference]: Without dead ends: 5911 [2020-10-22 00:53:14,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:53:14,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5911 states. [2020-10-22 00:53:14,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5911 to 2085. [2020-10-22 00:53:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2020-10-22 00:53:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 7975 transitions. [2020-10-22 00:53:14,736 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 7975 transitions. Word has length 21 [2020-10-22 00:53:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:14,736 INFO L481 AbstractCegarLoop]: Abstraction has 2085 states and 7975 transitions. [2020-10-22 00:53:14,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:53:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 7975 transitions. [2020-10-22 00:53:14,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:53:14,739 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:14,739 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:14,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:53:14,952 INFO L429 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-22 00:53:14,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:14,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1169886916, now seen corresponding path program 1 times [2020-10-22 00:53:14,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:14,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480221605] [2020-10-22 00:53:14,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:14,994 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-22 00:53:14,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480221605] [2020-10-22 00:53:14,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:14,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:53:14,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1414101936] [2020-10-22 00:53:14,996 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:14,998 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:15,001 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-22 00:53:15,001 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:15,002 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:15,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:53:15,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:15,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:53:15,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:53:15,003 INFO L87 Difference]: Start difference. First operand 2085 states and 7975 transitions. Second operand 5 states. [2020-10-22 00:53:15,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:15,142 INFO L93 Difference]: Finished difference Result 3167 states and 11408 transitions. [2020-10-22 00:53:15,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:53:15,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-22 00:53:15,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:15,151 INFO L225 Difference]: With dead ends: 3167 [2020-10-22 00:53:15,151 INFO L226 Difference]: Without dead ends: 3151 [2020-10-22 00:53:15,153 INFO L677 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-22 00:53:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2020-10-22 00:53:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 2322. [2020-10-22 00:53:15,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2020-10-22 00:53:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 8744 transitions. [2020-10-22 00:53:15,228 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 8744 transitions. Word has length 21 [2020-10-22 00:53:15,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:15,228 INFO L481 AbstractCegarLoop]: Abstraction has 2322 states and 8744 transitions. [2020-10-22 00:53:15,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:53:15,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 8744 transitions. [2020-10-22 00:53:15,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:53:15,230 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:15,231 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:15,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-22 00:53:15,231 INFO L429 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-22 00:53:15,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:15,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1700514858, now seen corresponding path program 3 times [2020-10-22 00:53:15,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:15,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117203230] [2020-10-22 00:53:15,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:15,313 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-22 00:53:15,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117203230] [2020-10-22 00:53:15,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:15,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:53:15,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [772755709] [2020-10-22 00:53:15,314 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:15,316 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:15,320 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-22 00:53:15,320 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:15,321 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:15,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:53:15,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:15,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:53:15,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:53:15,322 INFO L87 Difference]: Start difference. First operand 2322 states and 8744 transitions. Second operand 9 states. [2020-10-22 00:53:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:16,177 INFO L93 Difference]: Finished difference Result 6235 states and 19513 transitions. [2020-10-22 00:53:16,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:53:16,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-22 00:53:16,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:16,189 INFO L225 Difference]: With dead ends: 6235 [2020-10-22 00:53:16,190 INFO L226 Difference]: Without dead ends: 6224 [2020-10-22 00:53:16,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-22 00:53:16,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6224 states. [2020-10-22 00:53:16,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6224 to 2235. [2020-10-22 00:53:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2020-10-22 00:53:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 8410 transitions. [2020-10-22 00:53:16,268 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 8410 transitions. Word has length 21 [2020-10-22 00:53:16,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:16,268 INFO L481 AbstractCegarLoop]: Abstraction has 2235 states and 8410 transitions. [2020-10-22 00:53:16,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:53:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 8410 transitions. [2020-10-22 00:53:16,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:53:16,270 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:16,270 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:16,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-22 00:53:16,271 INFO L429 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-22 00:53:16,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:16,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1698015018, now seen corresponding path program 4 times [2020-10-22 00:53:16,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:16,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530871679] [2020-10-22 00:53:16,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:16,354 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-22 00:53:16,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530871679] [2020-10-22 00:53:16,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:16,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:53:16,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [854892633] [2020-10-22 00:53:16,355 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:16,357 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:16,361 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-22 00:53:16,362 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:16,362 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:16,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:53:16,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:16,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:53:16,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:53:16,363 INFO L87 Difference]: Start difference. First operand 2235 states and 8410 transitions. Second operand 9 states. [2020-10-22 00:53:17,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:17,201 INFO L93 Difference]: Finished difference Result 6169 states and 19292 transitions. [2020-10-22 00:53:17,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:53:17,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-22 00:53:17,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:17,212 INFO L225 Difference]: With dead ends: 6169 [2020-10-22 00:53:17,212 INFO L226 Difference]: Without dead ends: 6155 [2020-10-22 00:53:17,212 INFO L677 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-22 00:53:17,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6155 states. [2020-10-22 00:53:17,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6155 to 2191. [2020-10-22 00:53:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2191 states. [2020-10-22 00:53:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 8230 transitions. [2020-10-22 00:53:17,291 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 8230 transitions. Word has length 21 [2020-10-22 00:53:17,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:17,291 INFO L481 AbstractCegarLoop]: Abstraction has 2191 states and 8230 transitions. [2020-10-22 00:53:17,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:53:17,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 8230 transitions. [2020-10-22 00:53:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:53:17,293 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:17,293 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:17,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-22 00:53:17,294 INFO L429 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-22 00:53:17,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:17,294 INFO L82 PathProgramCache]: Analyzing trace with hash 817049814, now seen corresponding path program 5 times [2020-10-22 00:53:17,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:17,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97155380] [2020-10-22 00:53:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:17,397 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-22 00:53:17,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97155380] [2020-10-22 00:53:17,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:17,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:53:17,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [751283051] [2020-10-22 00:53:17,398 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:17,401 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:17,410 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 69 transitions. [2020-10-22 00:53:17,410 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:17,716 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:17,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:53:17,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:17,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:53:17,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:53:17,718 INFO L87 Difference]: Start difference. First operand 2191 states and 8230 transitions. Second operand 9 states. [2020-10-22 00:53:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:18,533 INFO L93 Difference]: Finished difference Result 6158 states and 19267 transitions. [2020-10-22 00:53:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:53:18,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-22 00:53:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:18,545 INFO L225 Difference]: With dead ends: 6158 [2020-10-22 00:53:18,545 INFO L226 Difference]: Without dead ends: 6147 [2020-10-22 00:53:18,546 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-22 00:53:18,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2020-10-22 00:53:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 2096. [2020-10-22 00:53:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2020-10-22 00:53:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 7876 transitions. [2020-10-22 00:53:18,644 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 7876 transitions. Word has length 21 [2020-10-22 00:53:18,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:18,644 INFO L481 AbstractCegarLoop]: Abstraction has 2096 states and 7876 transitions. [2020-10-22 00:53:18,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:53:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 7876 transitions. [2020-10-22 00:53:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:53:18,646 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:18,646 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:18,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-22 00:53:18,646 INFO L429 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-22 00:53:18,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:18,647 INFO L82 PathProgramCache]: Analyzing trace with hash 803538774, now seen corresponding path program 6 times [2020-10-22 00:53:18,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:18,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591160943] [2020-10-22 00:53:18,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:18,725 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-22 00:53:18,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591160943] [2020-10-22 00:53:18,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:18,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:53:18,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1445223529] [2020-10-22 00:53:18,726 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:18,728 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:18,735 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 53 transitions. [2020-10-22 00:53:18,735 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:18,905 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:18,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:53:18,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:18,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:53:18,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:53:18,906 INFO L87 Difference]: Start difference. First operand 2096 states and 7876 transitions. Second operand 9 states. [2020-10-22 00:53:19,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:19,714 INFO L93 Difference]: Finished difference Result 6017 states and 18791 transitions. [2020-10-22 00:53:19,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:53:19,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-22 00:53:19,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:19,726 INFO L225 Difference]: With dead ends: 6017 [2020-10-22 00:53:19,727 INFO L226 Difference]: Without dead ends: 6002 [2020-10-22 00:53:19,727 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-22 00:53:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-10-22 00:53:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2020-10-22 00:53:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2020-10-22 00:53:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2020-10-22 00:53:19,831 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2020-10-22 00:53:19,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:19,832 INFO L481 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2020-10-22 00:53:19,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:53:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2020-10-22 00:53:19,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:53:19,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:19,835 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:19,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-22 00:53:19,835 INFO L429 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-22 00:53:19,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:19,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1912181542, now seen corresponding path program 1 times [2020-10-22 00:53:19,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:19,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803630055] [2020-10-22 00:53:19,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:53:19,848 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:53:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:53:19,858 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:53:19,866 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:53:19,866 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:53:19,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-22 00:53:19,867 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 00:53:19,867 WARN L371 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-22 00:53:19,868 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-10-22 00:53:19,883 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,883 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,883 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,883 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,884 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,884 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,884 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,884 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,884 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,884 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,885 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,885 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,885 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,885 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,886 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,886 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,886 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,886 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,886 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,886 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,887 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,887 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,887 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,887 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,887 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,887 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,888 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,888 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,888 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,888 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,888 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,889 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,889 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,889 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,889 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,889 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,890 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,890 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,892 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,892 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,903 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,903 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,903 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,904 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,904 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,905 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,906 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,906 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,906 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,906 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,925 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,925 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,925 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,926 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,926 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,927 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,928 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,928 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,928 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,928 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,930 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,930 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,930 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,930 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,930 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,931 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,932 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,932 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,932 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,932 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,932 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,932 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,932 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,934 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,934 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,934 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,934 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,934 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,934 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,935 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,935 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,936 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,937 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,937 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,937 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,937 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,938 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,939 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,941 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,941 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,942 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,942 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,942 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:53:19,944 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:53:19,945 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-22 00:53:19,945 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:53:19,945 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:53:19,945 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:53:19,945 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:53:19,945 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:53:19,945 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:53:19,945 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:53:19,946 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:53:19,948 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:53:19,948 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 151 transitions, 392 flow [2020-10-22 00:53:19,948 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 151 transitions, 392 flow [2020-10-22 00:53:19,948 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 161 places, 151 transitions, 392 flow [2020-10-22 00:53:19,971 INFO L129 PetriNetUnfolder]: 9/161 cut-off events. [2020-10-22 00:53:19,971 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-22 00:53:19,974 INFO L80 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 161 events. 9/161 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 266 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 188. Up to 12 conditions per place. [2020-10-22 00:53:19,979 INFO L116 LiptonReduction]: Number of co-enabled transitions 2744 [2020-10-22 00:53:21,941 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-22 00:53:22,049 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-22 00:53:22,559 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2020-10-22 00:53:22,755 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2020-10-22 00:53:23,105 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2020-10-22 00:53:23,262 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-22 00:53:23,268 INFO L131 LiptonReduction]: Checked pairs total: 4200 [2020-10-22 00:53:23,268 INFO L133 LiptonReduction]: Total number of compositions: 162 [2020-10-22 00:53:23,268 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 39 transitions, 168 flow [2020-10-22 00:53:23,594 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2020-10-22 00:53:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2020-10-22 00:53:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-22 00:53:23,595 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:23,595 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-22 00:53:23,595 INFO L429 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-22 00:53:23,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:23,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1311531, now seen corresponding path program 1 times [2020-10-22 00:53:23,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:23,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092206893] [2020-10-22 00:53:23,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:23,618 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-22 00:53:23,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092206893] [2020-10-22 00:53:23,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:23,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:53:23,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1141947143] [2020-10-22 00:53:23,619 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:23,619 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:23,620 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-22 00:53:23,620 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:23,620 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:23,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:53:23,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:23,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:53:23,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:53:23,623 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2020-10-22 00:53:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:23,715 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2020-10-22 00:53:23,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:53:23,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-22 00:53:23,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:23,737 INFO L225 Difference]: With dead ends: 5844 [2020-10-22 00:53:23,738 INFO L226 Difference]: Without dead ends: 5479 [2020-10-22 00:53:23,739 INFO L677 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-22 00:53:23,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-10-22 00:53:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-10-22 00:53:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-10-22 00:53:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 24493 transitions. [2020-10-22 00:53:23,912 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 24493 transitions. Word has length 3 [2020-10-22 00:53:23,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:23,912 INFO L481 AbstractCegarLoop]: Abstraction has 5479 states and 24493 transitions. [2020-10-22 00:53:23,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:53:23,912 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 24493 transitions. [2020-10-22 00:53:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 00:53:23,912 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:23,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:23,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-22 00:53:23,913 INFO L429 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-22 00:53:23,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:23,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1486087653, now seen corresponding path program 1 times [2020-10-22 00:53:23,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:23,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191668903] [2020-10-22 00:53:23,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:23,951 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-22 00:53:23,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191668903] [2020-10-22 00:53:23,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:23,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:53:23,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [119994911] [2020-10-22 00:53:23,952 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:23,953 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:23,954 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 00:53:23,954 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:23,955 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:23,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:53:23,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:23,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:53:23,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:53:23,956 INFO L87 Difference]: Start difference. First operand 5479 states and 24493 transitions. Second operand 5 states. [2020-10-22 00:53:24,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:24,171 INFO L93 Difference]: Finished difference Result 9673 states and 40333 transitions. [2020-10-22 00:53:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:53:24,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-22 00:53:24,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:24,218 INFO L225 Difference]: With dead ends: 9673 [2020-10-22 00:53:24,218 INFO L226 Difference]: Without dead ends: 9666 [2020-10-22 00:53:24,219 INFO L677 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-22 00:53:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9666 states. [2020-10-22 00:53:25,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 6331. [2020-10-22 00:53:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6331 states. [2020-10-22 00:53:25,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6331 states to 6331 states and 28544 transitions. [2020-10-22 00:53:25,288 INFO L78 Accepts]: Start accepts. Automaton has 6331 states and 28544 transitions. Word has length 9 [2020-10-22 00:53:25,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:25,289 INFO L481 AbstractCegarLoop]: Abstraction has 6331 states and 28544 transitions. [2020-10-22 00:53:25,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:53:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 6331 states and 28544 transitions. [2020-10-22 00:53:25,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:53:25,290 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:25,290 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:25,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-22 00:53:25,290 INFO L429 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-22 00:53:25,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:25,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2078441721, now seen corresponding path program 1 times [2020-10-22 00:53:25,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:25,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096748238] [2020-10-22 00:53:25,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:25,330 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-22 00:53:25,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096748238] [2020-10-22 00:53:25,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:25,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:53:25,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [643168229] [2020-10-22 00:53:25,331 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:25,332 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:25,334 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-10-22 00:53:25,334 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:25,334 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:25,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:53:25,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:25,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:53:25,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:53:25,335 INFO L87 Difference]: Start difference. First operand 6331 states and 28544 transitions. Second operand 5 states. [2020-10-22 00:53:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:25,511 INFO L93 Difference]: Finished difference Result 11081 states and 46826 transitions. [2020-10-22 00:53:25,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:53:25,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-22 00:53:25,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:25,544 INFO L225 Difference]: With dead ends: 11081 [2020-10-22 00:53:25,544 INFO L226 Difference]: Without dead ends: 11068 [2020-10-22 00:53:25,545 INFO L677 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-22 00:53:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11068 states. [2020-10-22 00:53:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11068 to 7391. [2020-10-22 00:53:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7391 states. [2020-10-22 00:53:25,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 33694 transitions. [2020-10-22 00:53:25,798 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 33694 transitions. Word has length 13 [2020-10-22 00:53:25,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:25,798 INFO L481 AbstractCegarLoop]: Abstraction has 7391 states and 33694 transitions. [2020-10-22 00:53:25,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:53:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 33694 transitions. [2020-10-22 00:53:25,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:53:25,798 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:25,798 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:25,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-22 00:53:25,799 INFO L429 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-22 00:53:25,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:25,799 INFO L82 PathProgramCache]: Analyzing trace with hash -80896491, now seen corresponding path program 1 times [2020-10-22 00:53:25,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:25,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688946367] [2020-10-22 00:53:25,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:25,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-22 00:53:25,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688946367] [2020-10-22 00:53:25,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427374562] [2020-10-22 00:53:25,862 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-22 00:53:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:25,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-22 00:53:25,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:53:26,018 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-22 00:53:26,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:53:26,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-22 00:53:26,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [46049476] [2020-10-22 00:53:26,019 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:26,020 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:26,022 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-10-22 00:53:26,022 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:26,108 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [77621#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0), 77622#(<= (+ ~x~0 20) ~n~0)] [2020-10-22 00:53:26,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:53:26,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:26,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:53:26,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:53:26,109 INFO L87 Difference]: Start difference. First operand 7391 states and 33694 transitions. Second operand 9 states. [2020-10-22 00:53:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:26,731 INFO L93 Difference]: Finished difference Result 16749 states and 66010 transitions. [2020-10-22 00:53:26,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:26,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-22 00:53:26,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:26,778 INFO L225 Difference]: With dead ends: 16749 [2020-10-22 00:53:26,779 INFO L226 Difference]: Without dead ends: 16736 [2020-10-22 00:53:26,779 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-22 00:53:26,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16736 states. [2020-10-22 00:53:27,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16736 to 7303. [2020-10-22 00:53:27,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2020-10-22 00:53:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 33260 transitions. [2020-10-22 00:53:27,080 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 33260 transitions. Word has length 15 [2020-10-22 00:53:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:27,081 INFO L481 AbstractCegarLoop]: Abstraction has 7303 states and 33260 transitions. [2020-10-22 00:53:27,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:53:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 33260 transitions. [2020-10-22 00:53:27,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:53:27,081 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:27,081 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:27,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2020-10-22 00:53:27,288 INFO L429 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-22 00:53:27,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:27,289 INFO L82 PathProgramCache]: Analyzing trace with hash -222679403, now seen corresponding path program 2 times [2020-10-22 00:53:27,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:27,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880240476] [2020-10-22 00:53:27,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:27,352 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-22 00:53:27,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880240476] [2020-10-22 00:53:27,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:27,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:53:27,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1548644112] [2020-10-22 00:53:27,354 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:27,357 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:27,359 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2020-10-22 00:53:27,359 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:27,360 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:27,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:53:27,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:27,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:53:27,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:53:27,363 INFO L87 Difference]: Start difference. First operand 7303 states and 33260 transitions. Second operand 7 states. [2020-10-22 00:53:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:27,876 INFO L93 Difference]: Finished difference Result 17085 states and 67393 transitions. [2020-10-22 00:53:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:27,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-22 00:53:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:27,944 INFO L225 Difference]: With dead ends: 17085 [2020-10-22 00:53:27,944 INFO L226 Difference]: Without dead ends: 17071 [2020-10-22 00:53:27,945 INFO L677 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-22 00:53:28,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17071 states. [2020-10-22 00:53:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17071 to 7048. [2020-10-22 00:53:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7048 states. [2020-10-22 00:53:28,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 32136 transitions. [2020-10-22 00:53:28,489 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 32136 transitions. Word has length 15 [2020-10-22 00:53:28,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:28,489 INFO L481 AbstractCegarLoop]: Abstraction has 7048 states and 32136 transitions. [2020-10-22 00:53:28,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:53:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 32136 transitions. [2020-10-22 00:53:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 00:53:28,490 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:28,490 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:28,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-22 00:53:28,490 INFO L429 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-22 00:53:28,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:28,491 INFO L82 PathProgramCache]: Analyzing trace with hash -681474966, now seen corresponding path program 1 times [2020-10-22 00:53:28,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:28,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305395743] [2020-10-22 00:53:28,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:28,538 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-22 00:53:28,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305395743] [2020-10-22 00:53:28,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:28,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:53:28,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1783341856] [2020-10-22 00:53:28,539 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:28,541 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:28,543 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-10-22 00:53:28,544 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:28,544 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:28,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:53:28,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:28,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:53:28,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:53:28,545 INFO L87 Difference]: Start difference. First operand 7048 states and 32136 transitions. Second operand 5 states. [2020-10-22 00:53:28,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:28,719 INFO L93 Difference]: Finished difference Result 12234 states and 52488 transitions. [2020-10-22 00:53:28,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:53:28,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-22 00:53:28,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:28,752 INFO L225 Difference]: With dead ends: 12234 [2020-10-22 00:53:28,752 INFO L226 Difference]: Without dead ends: 12212 [2020-10-22 00:53:28,753 INFO L677 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-22 00:53:28,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2020-10-22 00:53:28,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 8342. [2020-10-22 00:53:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8342 states. [2020-10-22 00:53:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8342 states to 8342 states and 38278 transitions. [2020-10-22 00:53:29,013 INFO L78 Accepts]: Start accepts. Automaton has 8342 states and 38278 transitions. Word has length 17 [2020-10-22 00:53:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:29,013 INFO L481 AbstractCegarLoop]: Abstraction has 8342 states and 38278 transitions. [2020-10-22 00:53:29,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:53:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 8342 states and 38278 transitions. [2020-10-22 00:53:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 00:53:29,015 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:29,015 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:29,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-22 00:53:29,015 INFO L429 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-22 00:53:29,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:29,015 INFO L82 PathProgramCache]: Analyzing trace with hash -66098056, now seen corresponding path program 1 times [2020-10-22 00:53:29,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:29,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538859936] [2020-10-22 00:53:29,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:29,087 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-22 00:53:29,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538859936] [2020-10-22 00:53:29,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173318999] [2020-10-22 00:53:29,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-22 00:53:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:29,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-22 00:53:29,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:53:29,247 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-22 00:53:29,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:53:29,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-22 00:53:29,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [40886634] [2020-10-22 00:53:29,248 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:29,249 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:29,254 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 51 transitions. [2020-10-22 00:53:29,254 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:29,402 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [169191#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0), 169192#(<= (+ ~x~0 20) ~n~0)] [2020-10-22 00:53:29,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:53:29,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:29,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:53:29,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:53:29,404 INFO L87 Difference]: Start difference. First operand 8342 states and 38278 transitions. Second operand 9 states. [2020-10-22 00:53:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:29,881 INFO L93 Difference]: Finished difference Result 19016 states and 76191 transitions. [2020-10-22 00:53:29,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:29,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-22 00:53:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:29,933 INFO L225 Difference]: With dead ends: 19016 [2020-10-22 00:53:29,933 INFO L226 Difference]: Without dead ends: 18998 [2020-10-22 00:53:29,933 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-22 00:53:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18998 states. [2020-10-22 00:53:30,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18998 to 8452. [2020-10-22 00:53:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8452 states. [2020-10-22 00:53:30,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8452 states to 8452 states and 38704 transitions. [2020-10-22 00:53:30,998 INFO L78 Accepts]: Start accepts. Automaton has 8452 states and 38704 transitions. Word has length 19 [2020-10-22 00:53:30,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:30,998 INFO L481 AbstractCegarLoop]: Abstraction has 8452 states and 38704 transitions. [2020-10-22 00:53:30,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:53:30,998 INFO L276 IsEmpty]: Start isEmpty. Operand 8452 states and 38704 transitions. [2020-10-22 00:53:30,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 00:53:30,999 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:30,999 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:31,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-10-22 00:53:31,201 INFO L429 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-22 00:53:31,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:31,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2062391496, now seen corresponding path program 2 times [2020-10-22 00:53:31,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:31,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551885620] [2020-10-22 00:53:31,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:31,257 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-22 00:53:31,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551885620] [2020-10-22 00:53:31,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:31,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:53:31,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [238503033] [2020-10-22 00:53:31,258 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:31,261 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:31,265 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 19 transitions. [2020-10-22 00:53:31,265 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:31,265 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:31,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:53:31,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:31,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:53:31,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:53:31,266 INFO L87 Difference]: Start difference. First operand 8452 states and 38704 transitions. Second operand 7 states. [2020-10-22 00:53:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:31,807 INFO L93 Difference]: Finished difference Result 19420 states and 77854 transitions. [2020-10-22 00:53:31,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:31,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-22 00:53:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:31,894 INFO L225 Difference]: With dead ends: 19420 [2020-10-22 00:53:31,895 INFO L226 Difference]: Without dead ends: 19395 [2020-10-22 00:53:31,895 INFO L677 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-22 00:53:32,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19395 states. [2020-10-22 00:53:32,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19395 to 8129. [2020-10-22 00:53:32,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8129 states. [2020-10-22 00:53:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8129 states to 8129 states and 37298 transitions. [2020-10-22 00:53:32,451 INFO L78 Accepts]: Start accepts. Automaton has 8129 states and 37298 transitions. Word has length 19 [2020-10-22 00:53:32,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:32,451 INFO L481 AbstractCegarLoop]: Abstraction has 8129 states and 37298 transitions. [2020-10-22 00:53:32,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:53:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 8129 states and 37298 transitions. [2020-10-22 00:53:32,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 00:53:32,452 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:32,452 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:32,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-22 00:53:32,453 INFO L429 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-22 00:53:32,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:32,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2062399215, now seen corresponding path program 1 times [2020-10-22 00:53:32,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:32,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032231956] [2020-10-22 00:53:32,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:32,520 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-22 00:53:32,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032231956] [2020-10-22 00:53:32,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:32,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:53:32,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [840180777] [2020-10-22 00:53:32,522 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:32,523 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:32,526 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 19 transitions. [2020-10-22 00:53:32,527 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:32,527 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:32,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:53:32,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:32,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:53:32,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:53:32,528 INFO L87 Difference]: Start difference. First operand 8129 states and 37298 transitions. Second operand 7 states. [2020-10-22 00:53:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:33,118 INFO L93 Difference]: Finished difference Result 19373 states and 77785 transitions. [2020-10-22 00:53:33,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:33,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-22 00:53:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:33,169 INFO L225 Difference]: With dead ends: 19373 [2020-10-22 00:53:33,170 INFO L226 Difference]: Without dead ends: 19348 [2020-10-22 00:53:33,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-22 00:53:33,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19348 states. [2020-10-22 00:53:33,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19348 to 8375. [2020-10-22 00:53:33,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8375 states. [2020-10-22 00:53:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8375 states to 8375 states and 38394 transitions. [2020-10-22 00:53:33,515 INFO L78 Accepts]: Start accepts. Automaton has 8375 states and 38394 transitions. Word has length 19 [2020-10-22 00:53:33,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:33,515 INFO L481 AbstractCegarLoop]: Abstraction has 8375 states and 38394 transitions. [2020-10-22 00:53:33,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:53:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 8375 states and 38394 transitions. [2020-10-22 00:53:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 00:53:33,516 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:33,516 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:33,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-22 00:53:33,516 INFO L429 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-22 00:53:33,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:33,516 INFO L82 PathProgramCache]: Analyzing trace with hash -2050465455, now seen corresponding path program 2 times [2020-10-22 00:53:33,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:33,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647426452] [2020-10-22 00:53:33,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:33,572 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-22 00:53:33,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647426452] [2020-10-22 00:53:33,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:33,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:53:33,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [161895137] [2020-10-22 00:53:33,574 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:33,576 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:33,580 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 35 transitions. [2020-10-22 00:53:33,580 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:33,689 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:33,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:53:33,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:33,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:53:33,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:53:33,691 INFO L87 Difference]: Start difference. First operand 8375 states and 38394 transitions. Second operand 7 states. [2020-10-22 00:53:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:34,129 INFO L93 Difference]: Finished difference Result 19555 states and 78564 transitions. [2020-10-22 00:53:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:34,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-22 00:53:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:34,186 INFO L225 Difference]: With dead ends: 19555 [2020-10-22 00:53:34,186 INFO L226 Difference]: Without dead ends: 19530 [2020-10-22 00:53:34,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-22 00:53:34,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2020-10-22 00:53:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 8317. [2020-10-22 00:53:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8317 states. [2020-10-22 00:53:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8317 states to 8317 states and 38184 transitions. [2020-10-22 00:53:34,804 INFO L78 Accepts]: Start accepts. Automaton has 8317 states and 38184 transitions. Word has length 19 [2020-10-22 00:53:34,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:34,805 INFO L481 AbstractCegarLoop]: Abstraction has 8317 states and 38184 transitions. [2020-10-22 00:53:34,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:53:34,805 INFO L276 IsEmpty]: Start isEmpty. Operand 8317 states and 38184 transitions. [2020-10-22 00:53:34,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:53:34,806 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:34,806 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:34,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-22 00:53:34,806 INFO L429 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-22 00:53:34,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:34,807 INFO L82 PathProgramCache]: Analyzing trace with hash 904291743, now seen corresponding path program 1 times [2020-10-22 00:53:34,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:34,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986489191] [2020-10-22 00:53:34,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:34,885 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-22 00:53:34,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986489191] [2020-10-22 00:53:34,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991694599] [2020-10-22 00:53:34,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-22 00:53:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:34,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:53:34,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:53:35,085 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-22 00:53:35,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:53:35,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:53:35,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [922306988] [2020-10-22 00:53:35,087 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:35,088 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:35,093 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 53 transitions. [2020-10-22 00:53:35,094 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:35,255 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [313264#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0), 313265#(<= (+ ~x~0 20) ~n~0)] [2020-10-22 00:53:35,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:53:35,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:35,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:53:35,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:53:35,257 INFO L87 Difference]: Start difference. First operand 8317 states and 38184 transitions. Second operand 11 states. [2020-10-22 00:53:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:36,477 INFO L93 Difference]: Finished difference Result 26969 states and 101544 transitions. [2020-10-22 00:53:36,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:53:36,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-22 00:53:36,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:36,551 INFO L225 Difference]: With dead ends: 26969 [2020-10-22 00:53:36,551 INFO L226 Difference]: Without dead ends: 26957 [2020-10-22 00:53:36,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:53:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26957 states. [2020-10-22 00:53:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26957 to 8208. [2020-10-22 00:53:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8208 states. [2020-10-22 00:53:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8208 states to 8208 states and 37640 transitions. [2020-10-22 00:53:36,969 INFO L78 Accepts]: Start accepts. Automaton has 8208 states and 37640 transitions. Word has length 21 [2020-10-22 00:53:36,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:36,969 INFO L481 AbstractCegarLoop]: Abstraction has 8208 states and 37640 transitions. [2020-10-22 00:53:36,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:53:36,969 INFO L276 IsEmpty]: Start isEmpty. Operand 8208 states and 37640 transitions. [2020-10-22 00:53:36,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:53:36,970 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:36,970 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:37,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:53:37,172 INFO L429 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-22 00:53:37,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:37,173 INFO L82 PathProgramCache]: Analyzing trace with hash 916225503, now seen corresponding path program 2 times [2020-10-22 00:53:37,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:37,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693290569] [2020-10-22 00:53:37,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:37,249 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-22 00:53:37,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693290569] [2020-10-22 00:53:37,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231123547] [2020-10-22 00:53:37,250 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 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-22 00:53:37,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-22 00:53:37,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-22 00:53:37,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:53:37,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:53:37,818 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-22 00:53:37,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:53:37,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:53:37,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1540656078] [2020-10-22 00:53:37,819 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:37,823 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:37,836 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 69 transitions. [2020-10-22 00:53:37,836 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:38,117 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [356773#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0), 356774#(<= (+ ~x~0 20) ~n~0)] [2020-10-22 00:53:38,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:53:38,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:38,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:53:38,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:53:38,118 INFO L87 Difference]: Start difference. First operand 8208 states and 37640 transitions. Second operand 11 states. [2020-10-22 00:53:39,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:39,268 INFO L93 Difference]: Finished difference Result 26669 states and 100297 transitions. [2020-10-22 00:53:39,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:53:39,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-22 00:53:39,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:39,349 INFO L225 Difference]: With dead ends: 26669 [2020-10-22 00:53:39,349 INFO L226 Difference]: Without dead ends: 26653 [2020-10-22 00:53:39,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:53:39,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26653 states. [2020-10-22 00:53:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26653 to 8091. [2020-10-22 00:53:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8091 states. [2020-10-22 00:53:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8091 states to 8091 states and 37076 transitions. [2020-10-22 00:53:39,774 INFO L78 Accepts]: Start accepts. Automaton has 8091 states and 37076 transitions. Word has length 21 [2020-10-22 00:53:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:39,775 INFO L481 AbstractCegarLoop]: Abstraction has 8091 states and 37076 transitions. [2020-10-22 00:53:39,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:53:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 8091 states and 37076 transitions. [2020-10-22 00:53:39,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:53:39,776 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:39,776 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:39,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2020-10-22 00:53:39,981 INFO L429 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-22 00:53:39,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:39,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1978290081, now seen corresponding path program 3 times [2020-10-22 00:53:39,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:39,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116366787] [2020-10-22 00:53:39,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:40,052 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-22 00:53:40,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116366787] [2020-10-22 00:53:40,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:40,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:53:40,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2031955547] [2020-10-22 00:53:40,053 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:40,055 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:40,060 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-22 00:53:40,060 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:40,061 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:40,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:53:40,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:40,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:53:40,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:53:40,062 INFO L87 Difference]: Start difference. First operand 8091 states and 37076 transitions. Second operand 9 states. [2020-10-22 00:53:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:41,290 INFO L93 Difference]: Finished difference Result 26678 states and 100382 transitions. [2020-10-22 00:53:41,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:53:41,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-22 00:53:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:41,364 INFO L225 Difference]: With dead ends: 26678 [2020-10-22 00:53:41,364 INFO L226 Difference]: Without dead ends: 26666 [2020-10-22 00:53:41,365 INFO L677 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-22 00:53:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26666 states. [2020-10-22 00:53:41,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26666 to 7869. [2020-10-22 00:53:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7869 states. [2020-10-22 00:53:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7869 states to 7869 states and 36086 transitions. [2020-10-22 00:53:41,794 INFO L78 Accepts]: Start accepts. Automaton has 7869 states and 36086 transitions. Word has length 21 [2020-10-22 00:53:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:41,794 INFO L481 AbstractCegarLoop]: Abstraction has 7869 states and 36086 transitions. [2020-10-22 00:53:41,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:53:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 7869 states and 36086 transitions. [2020-10-22 00:53:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:53:41,796 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:41,796 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:41,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-10-22 00:53:41,796 INFO L429 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-22 00:53:41,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:41,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1985700321, now seen corresponding path program 4 times [2020-10-22 00:53:41,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:41,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273702573] [2020-10-22 00:53:41,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:41,882 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-22 00:53:41,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273702573] [2020-10-22 00:53:41,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:41,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:53:41,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [842240715] [2020-10-22 00:53:41,883 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:41,886 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:41,890 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-22 00:53:41,890 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:41,891 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:41,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:53:41,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:41,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:53:41,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:53:41,892 INFO L87 Difference]: Start difference. First operand 7869 states and 36086 transitions. Second operand 9 states. [2020-10-22 00:53:42,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:42,850 INFO L93 Difference]: Finished difference Result 26497 states and 99670 transitions. [2020-10-22 00:53:42,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:53:42,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-22 00:53:42,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:42,925 INFO L225 Difference]: With dead ends: 26497 [2020-10-22 00:53:42,926 INFO L226 Difference]: Without dead ends: 26481 [2020-10-22 00:53:42,926 INFO L677 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-22 00:53:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26481 states. [2020-10-22 00:53:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26481 to 7756. [2020-10-22 00:53:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7756 states. [2020-10-22 00:53:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7756 states to 7756 states and 35534 transitions. [2020-10-22 00:53:43,656 INFO L78 Accepts]: Start accepts. Automaton has 7756 states and 35534 transitions. Word has length 21 [2020-10-22 00:53:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:43,656 INFO L481 AbstractCegarLoop]: Abstraction has 7756 states and 35534 transitions. [2020-10-22 00:53:43,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:53:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 7756 states and 35534 transitions. [2020-10-22 00:53:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:53:43,658 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:43,658 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:43,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-10-22 00:53:43,658 INFO L429 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-22 00:53:43,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:43,659 INFO L82 PathProgramCache]: Analyzing trace with hash -522836100, now seen corresponding path program 1 times [2020-10-22 00:53:43,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:43,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742648149] [2020-10-22 00:53:43,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:43,702 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-22 00:53:43,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742648149] [2020-10-22 00:53:43,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:43,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:53:43,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1815135164] [2020-10-22 00:53:43,703 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:43,705 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:43,709 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-22 00:53:43,710 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:43,710 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:43,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:53:43,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:43,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:53:43,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:53:43,711 INFO L87 Difference]: Start difference. First operand 7756 states and 35534 transitions. Second operand 5 states. [2020-10-22 00:53:43,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:43,904 INFO L93 Difference]: Finished difference Result 13259 states and 57521 transitions. [2020-10-22 00:53:43,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:53:43,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-22 00:53:43,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:43,941 INFO L225 Difference]: With dead ends: 13259 [2020-10-22 00:53:43,941 INFO L226 Difference]: Without dead ends: 13228 [2020-10-22 00:53:43,941 INFO L677 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-22 00:53:44,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13228 states. [2020-10-22 00:53:44,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13228 to 9263. [2020-10-22 00:53:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9263 states. [2020-10-22 00:53:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9263 states to 9263 states and 42388 transitions. [2020-10-22 00:53:44,247 INFO L78 Accepts]: Start accepts. Automaton has 9263 states and 42388 transitions. Word has length 21 [2020-10-22 00:53:44,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:44,248 INFO L481 AbstractCegarLoop]: Abstraction has 9263 states and 42388 transitions. [2020-10-22 00:53:44,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:53:44,248 INFO L276 IsEmpty]: Start isEmpty. Operand 9263 states and 42388 transitions. [2020-10-22 00:53:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:53:44,250 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:44,250 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:44,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-10-22 00:53:44,250 INFO L429 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-22 00:53:44,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:44,251 INFO L82 PathProgramCache]: Analyzing trace with hash 892708447, now seen corresponding path program 5 times [2020-10-22 00:53:44,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:44,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672856397] [2020-10-22 00:53:44,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:44,345 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-22 00:53:44,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672856397] [2020-10-22 00:53:44,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:44,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:53:44,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1799015702] [2020-10-22 00:53:44,346 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:44,348 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:44,353 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 37 transitions. [2020-10-22 00:53:44,353 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:44,451 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:44,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:53:44,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:44,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:53:44,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:53:44,452 INFO L87 Difference]: Start difference. First operand 9263 states and 42388 transitions. Second operand 9 states. [2020-10-22 00:53:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:45,494 INFO L93 Difference]: Finished difference Result 29796 states and 113861 transitions. [2020-10-22 00:53:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:53:45,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-22 00:53:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:45,572 INFO L225 Difference]: With dead ends: 29796 [2020-10-22 00:53:45,572 INFO L226 Difference]: Without dead ends: 29778 [2020-10-22 00:53:45,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-22 00:53:45,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29778 states. [2020-10-22 00:53:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29778 to 8972. [2020-10-22 00:53:46,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8972 states. [2020-10-22 00:53:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8972 states to 8972 states and 41051 transitions. [2020-10-22 00:53:46,436 INFO L78 Accepts]: Start accepts. Automaton has 8972 states and 41051 transitions. Word has length 21 [2020-10-22 00:53:46,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:46,436 INFO L481 AbstractCegarLoop]: Abstraction has 8972 states and 41051 transitions. [2020-10-22 00:53:46,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:53:46,436 INFO L276 IsEmpty]: Start isEmpty. Operand 8972 states and 41051 transitions. [2020-10-22 00:53:46,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:53:46,438 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:46,438 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:46,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-10-22 00:53:46,439 INFO L429 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-22 00:53:46,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:46,439 INFO L82 PathProgramCache]: Analyzing trace with hash 912052447, now seen corresponding path program 6 times [2020-10-22 00:53:46,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:46,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452164244] [2020-10-22 00:53:46,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:46,519 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-22 00:53:46,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452164244] [2020-10-22 00:53:46,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:46,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:53:46,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1286821883] [2020-10-22 00:53:46,520 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:46,522 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:46,527 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 53 transitions. [2020-10-22 00:53:46,528 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:46,708 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:46,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:53:46,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:46,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:53:46,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:53:46,710 INFO L87 Difference]: Start difference. First operand 8972 states and 41051 transitions. Second operand 9 states. [2020-10-22 00:53:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:47,802 INFO L93 Difference]: Finished difference Result 29387 states and 112119 transitions. [2020-10-22 00:53:47,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:53:47,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-22 00:53:47,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:47,880 INFO L225 Difference]: With dead ends: 29387 [2020-10-22 00:53:47,881 INFO L226 Difference]: Without dead ends: 29364 [2020-10-22 00:53:47,881 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-22 00:53:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29364 states. [2020-10-22 00:53:48,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29364 to 8573. [2020-10-22 00:53:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8573 states. [2020-10-22 00:53:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8573 states to 8573 states and 39353 transitions. [2020-10-22 00:53:48,382 INFO L78 Accepts]: Start accepts. Automaton has 8573 states and 39353 transitions. Word has length 21 [2020-10-22 00:53:48,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:48,382 INFO L481 AbstractCegarLoop]: Abstraction has 8573 states and 39353 transitions. [2020-10-22 00:53:48,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:53:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 8573 states and 39353 transitions. [2020-10-22 00:53:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 00:53:48,384 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:48,384 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:48,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-10-22 00:53:48,384 INFO L429 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-22 00:53:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:48,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1391110006, now seen corresponding path program 1 times [2020-10-22 00:53:48,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:48,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503202937] [2020-10-22 00:53:48,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:48,453 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-22 00:53:48,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503202937] [2020-10-22 00:53:48,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320787317] [2020-10-22 00:53:48,454 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-22 00:53:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:48,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-22 00:53:48,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:53:48,624 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-22 00:53:48,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:53:48,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-22 00:53:48,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1319430876] [2020-10-22 00:53:48,626 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:48,628 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:48,635 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 71 transitions. [2020-10-22 00:53:48,636 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:48,875 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [610463#(<= (+ ~x~0 20) ~n~0), 610462#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0)] [2020-10-22 00:53:48,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:53:48,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:48,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:53:48,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:53:48,876 INFO L87 Difference]: Start difference. First operand 8573 states and 39353 transitions. Second operand 9 states. [2020-10-22 00:53:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:49,386 INFO L93 Difference]: Finished difference Result 19727 states and 80274 transitions. [2020-10-22 00:53:49,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:49,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-22 00:53:49,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:49,447 INFO L225 Difference]: With dead ends: 19727 [2020-10-22 00:53:49,448 INFO L226 Difference]: Without dead ends: 19703 [2020-10-22 00:53:49,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-22 00:53:49,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19703 states. [2020-10-22 00:53:50,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19703 to 8847. [2020-10-22 00:53:50,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2020-10-22 00:53:50,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40495 transitions. [2020-10-22 00:53:50,040 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40495 transitions. Word has length 23 [2020-10-22 00:53:50,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:50,040 INFO L481 AbstractCegarLoop]: Abstraction has 8847 states and 40495 transitions. [2020-10-22 00:53:50,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:53:50,041 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40495 transitions. [2020-10-22 00:53:50,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 00:53:50,043 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:50,043 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:50,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-10-22 00:53:50,257 INFO L429 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-22 00:53:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:50,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1213836140, now seen corresponding path program 1 times [2020-10-22 00:53:50,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:50,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563171079] [2020-10-22 00:53:50,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:50,315 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-22 00:53:50,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563171079] [2020-10-22 00:53:50,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846391382] [2020-10-22 00:53:50,316 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-22 00:53:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:50,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-22 00:53:50,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:53:50,510 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-22 00:53:50,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:53:50,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-22 00:53:50,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1972249402] [2020-10-22 00:53:50,511 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:50,514 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:50,521 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 39 transitions. [2020-10-22 00:53:50,521 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:50,644 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [647979#(<= (+ thr2Thread3of5ForFork0_~t~0 20) ~n~0), 647980#(<= (+ ~x~0 20) ~n~0)] [2020-10-22 00:53:50,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:53:50,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:50,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:53:50,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:53:50,646 INFO L87 Difference]: Start difference. First operand 8847 states and 40495 transitions. Second operand 9 states. [2020-10-22 00:53:51,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:51,190 INFO L93 Difference]: Finished difference Result 20670 states and 84217 transitions. [2020-10-22 00:53:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:51,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-22 00:53:51,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:51,246 INFO L225 Difference]: With dead ends: 20670 [2020-10-22 00:53:51,246 INFO L226 Difference]: Without dead ends: 20642 [2020-10-22 00:53:51,247 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-22 00:53:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20642 states. [2020-10-22 00:53:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20642 to 9111. [2020-10-22 00:53:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9111 states. [2020-10-22 00:53:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9111 states to 9111 states and 41667 transitions. [2020-10-22 00:53:51,627 INFO L78 Accepts]: Start accepts. Automaton has 9111 states and 41667 transitions. Word has length 23 [2020-10-22 00:53:51,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:51,627 INFO L481 AbstractCegarLoop]: Abstraction has 9111 states and 41667 transitions. [2020-10-22 00:53:51,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:53:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 9111 states and 41667 transitions. [2020-10-22 00:53:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 00:53:51,629 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:51,629 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:51,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:53:51,831 INFO L429 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-22 00:53:51,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:51,831 INFO L82 PathProgramCache]: Analyzing trace with hash 65683220, now seen corresponding path program 2 times [2020-10-22 00:53:51,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:51,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060257306] [2020-10-22 00:53:51,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:51,890 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-22 00:53:51,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060257306] [2020-10-22 00:53:51,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:51,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:53:51,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1425640063] [2020-10-22 00:53:51,892 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:51,894 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:51,899 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 23 transitions. [2020-10-22 00:53:51,900 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:51,900 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:51,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:53:51,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:51,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:53:51,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:53:51,901 INFO L87 Difference]: Start difference. First operand 9111 states and 41667 transitions. Second operand 7 states. [2020-10-22 00:53:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:52,365 INFO L93 Difference]: Finished difference Result 20926 states and 85293 transitions. [2020-10-22 00:53:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:52,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-22 00:53:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:52,420 INFO L225 Difference]: With dead ends: 20926 [2020-10-22 00:53:52,420 INFO L226 Difference]: Without dead ends: 20889 [2020-10-22 00:53:52,420 INFO L677 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-22 00:53:52,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20889 states. [2020-10-22 00:53:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20889 to 9002. [2020-10-22 00:53:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9002 states. [2020-10-22 00:53:52,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9002 states to 9002 states and 41147 transitions. [2020-10-22 00:53:52,795 INFO L78 Accepts]: Start accepts. Automaton has 9002 states and 41147 transitions. Word has length 23 [2020-10-22 00:53:52,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:52,796 INFO L481 AbstractCegarLoop]: Abstraction has 9002 states and 41147 transitions. [2020-10-22 00:53:52,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:53:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 9002 states and 41147 transitions. [2020-10-22 00:53:52,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 00:53:52,798 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:52,802 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:52,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-10-22 00:53:52,802 INFO L429 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-22 00:53:52,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:52,802 INFO L82 PathProgramCache]: Analyzing trace with hash 65703370, now seen corresponding path program 2 times [2020-10-22 00:53:52,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:52,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814735780] [2020-10-22 00:53:52,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:52,945 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-22 00:53:52,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814735780] [2020-10-22 00:53:52,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:52,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:53:52,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1548064963] [2020-10-22 00:53:52,946 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:52,948 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:52,954 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 23 transitions. [2020-10-22 00:53:52,954 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:52,955 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:52,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:53:52,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:52,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:53:52,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:53:52,956 INFO L87 Difference]: Start difference. First operand 9002 states and 41147 transitions. Second operand 7 states. [2020-10-22 00:53:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:53,515 INFO L93 Difference]: Finished difference Result 20671 states and 84034 transitions. [2020-10-22 00:53:53,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:53,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-22 00:53:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:53,598 INFO L225 Difference]: With dead ends: 20671 [2020-10-22 00:53:53,599 INFO L226 Difference]: Without dead ends: 20634 [2020-10-22 00:53:53,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-22 00:53:53,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20634 states. [2020-10-22 00:53:53,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20634 to 8910. [2020-10-22 00:53:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8910 states. [2020-10-22 00:53:53,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8910 states to 8910 states and 40716 transitions. [2020-10-22 00:53:53,994 INFO L78 Accepts]: Start accepts. Automaton has 8910 states and 40716 transitions. Word has length 23 [2020-10-22 00:53:53,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:53,995 INFO L481 AbstractCegarLoop]: Abstraction has 8910 states and 40716 transitions. [2020-10-22 00:53:53,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:53:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 8910 states and 40716 transitions. [2020-10-22 00:53:53,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 00:53:53,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:53,997 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:53,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-10-22 00:53:53,997 INFO L429 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-22 00:53:53,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:53,997 INFO L82 PathProgramCache]: Analyzing trace with hash 65695651, now seen corresponding path program 1 times [2020-10-22 00:53:53,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:53,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634596877] [2020-10-22 00:53:53,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:54,056 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-22 00:53:54,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634596877] [2020-10-22 00:53:54,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:54,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:53:54,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1179140582] [2020-10-22 00:53:54,057 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:54,060 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:54,063 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 23 transitions. [2020-10-22 00:53:54,064 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:54,064 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:54,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:53:54,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:54,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:53:54,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:53:54,065 INFO L87 Difference]: Start difference. First operand 8910 states and 40716 transitions. Second operand 7 states. [2020-10-22 00:53:54,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:54,515 INFO L93 Difference]: Finished difference Result 21060 states and 85755 transitions. [2020-10-22 00:53:54,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:54,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-22 00:53:54,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:54,577 INFO L225 Difference]: With dead ends: 21060 [2020-10-22 00:53:54,577 INFO L226 Difference]: Without dead ends: 21023 [2020-10-22 00:53:54,577 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-22 00:53:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21023 states. [2020-10-22 00:53:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21023 to 9327. [2020-10-22 00:53:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9327 states. [2020-10-22 00:53:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9327 states to 9327 states and 42562 transitions. [2020-10-22 00:53:54,973 INFO L78 Accepts]: Start accepts. Automaton has 9327 states and 42562 transitions. Word has length 23 [2020-10-22 00:53:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:54,973 INFO L481 AbstractCegarLoop]: Abstraction has 9327 states and 42562 transitions. [2020-10-22 00:53:54,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:53:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 9327 states and 42562 transitions. [2020-10-22 00:53:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 00:53:54,975 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:54,975 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:54,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-10-22 00:53:54,976 INFO L429 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-22 00:53:54,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:54,976 INFO L82 PathProgramCache]: Analyzing trace with hash 61469731, now seen corresponding path program 2 times [2020-10-22 00:53:54,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:54,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008113086] [2020-10-22 00:53:54,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:55,039 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-22 00:53:55,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008113086] [2020-10-22 00:53:55,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:55,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:53:55,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1313785009] [2020-10-22 00:53:55,041 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:55,043 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:55,052 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 55 transitions. [2020-10-22 00:53:55,053 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:55,280 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:53:55,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:53:55,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:55,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:53:55,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:53:55,282 INFO L87 Difference]: Start difference. First operand 9327 states and 42562 transitions. Second operand 7 states. [2020-10-22 00:53:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:55,780 INFO L93 Difference]: Finished difference Result 21207 states and 86283 transitions. [2020-10-22 00:53:55,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:53:55,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-22 00:53:55,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:55,838 INFO L225 Difference]: With dead ends: 21207 [2020-10-22 00:53:55,839 INFO L226 Difference]: Without dead ends: 21170 [2020-10-22 00:53:55,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-22 00:53:55,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21170 states. [2020-10-22 00:53:56,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21170 to 9426. [2020-10-22 00:53:56,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9426 states. [2020-10-22 00:53:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9426 states to 9426 states and 43057 transitions. [2020-10-22 00:53:56,369 INFO L78 Accepts]: Start accepts. Automaton has 9426 states and 43057 transitions. Word has length 23 [2020-10-22 00:53:56,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:56,369 INFO L481 AbstractCegarLoop]: Abstraction has 9426 states and 43057 transitions. [2020-10-22 00:53:56,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:53:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 9426 states and 43057 transitions. [2020-10-22 00:53:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:53:56,373 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:56,373 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-22 00:53:56,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-10-22 00:53:56,373 INFO L429 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-22 00:53:56,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:56,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1893562914, now seen corresponding path program 1 times [2020-10-22 00:53:56,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:56,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878508335] [2020-10-22 00:53:56,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:56,456 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-22 00:53:56,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878508335] [2020-10-22 00:53:56,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361906552] [2020-10-22 00:53:56,457 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-22 00:53:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:56,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:53:56,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:53:56,675 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-22 00:53:56,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:53:56,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:53:56,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1347662117] [2020-10-22 00:53:56,677 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:56,679 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:56,689 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 89 transitions. [2020-10-22 00:53:56,689 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:56,993 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [844264#(<= (+ ~x~0 20) ~n~0), 844263#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0)] [2020-10-22 00:53:56,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:53:56,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:56,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:53:56,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:53:56,994 INFO L87 Difference]: Start difference. First operand 9426 states and 43057 transitions. Second operand 11 states. [2020-10-22 00:53:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:58,198 INFO L93 Difference]: Finished difference Result 30145 states and 115754 transitions. [2020-10-22 00:53:58,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:53:58,198 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-22 00:53:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:58,286 INFO L225 Difference]: With dead ends: 30145 [2020-10-22 00:53:58,286 INFO L226 Difference]: Without dead ends: 30125 [2020-10-22 00:53:58,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:53:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30125 states. [2020-10-22 00:53:58,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30125 to 9346. [2020-10-22 00:53:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9346 states. [2020-10-22 00:53:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9346 states to 9346 states and 42602 transitions. [2020-10-22 00:53:58,797 INFO L78 Accepts]: Start accepts. Automaton has 9346 states and 42602 transitions. Word has length 25 [2020-10-22 00:53:58,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:58,798 INFO L481 AbstractCegarLoop]: Abstraction has 9346 states and 42602 transitions. [2020-10-22 00:53:58,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:53:58,798 INFO L276 IsEmpty]: Start isEmpty. Operand 9346 states and 42602 transitions. [2020-10-22 00:53:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:53:58,801 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:58,801 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-22 00:53:59,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2020-10-22 00:53:59,002 INFO L429 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-22 00:53:59,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:59,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1121885022, now seen corresponding path program 2 times [2020-10-22 00:53:59,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:59,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516892053] [2020-10-22 00:53:59,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:59,082 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-22 00:53:59,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516892053] [2020-10-22 00:53:59,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910210296] [2020-10-22 00:53:59,083 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 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-22 00:53:59,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-22 00:53:59,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-22 00:53:59,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:53:59,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:53:59,301 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-22 00:53:59,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:53:59,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:53:59,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [791682275] [2020-10-22 00:53:59,301 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:59,304 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:59,313 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 73 transitions. [2020-10-22 00:53:59,313 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:59,580 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [893237#(<= (+ ~x~0 20) ~n~0), 893236#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0)] [2020-10-22 00:53:59,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:53:59,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:59,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:53:59,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:53:59,582 INFO L87 Difference]: Start difference. First operand 9346 states and 42602 transitions. Second operand 11 states. [2020-10-22 00:54:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:00,994 INFO L93 Difference]: Finished difference Result 29656 states and 113703 transitions. [2020-10-22 00:54:00,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:54:00,995 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-22 00:54:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:01,075 INFO L225 Difference]: With dead ends: 29656 [2020-10-22 00:54:01,075 INFO L226 Difference]: Without dead ends: 29634 [2020-10-22 00:54:01,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:54:01,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29634 states. [2020-10-22 00:54:01,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29634 to 9343. [2020-10-22 00:54:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9343 states. [2020-10-22 00:54:01,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9343 states to 9343 states and 42547 transitions. [2020-10-22 00:54:01,557 INFO L78 Accepts]: Start accepts. Automaton has 9343 states and 42547 transitions. Word has length 25 [2020-10-22 00:54:01,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:01,558 INFO L481 AbstractCegarLoop]: Abstraction has 9343 states and 42547 transitions. [2020-10-22 00:54:01,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:54:01,558 INFO L276 IsEmpty]: Start isEmpty. Operand 9343 states and 42547 transitions. [2020-10-22 00:54:01,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:54:01,561 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:01,562 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-22 00:54:01,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2020-10-22 00:54:01,765 INFO L429 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-22 00:54:01,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:01,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1121872591, now seen corresponding path program 1 times [2020-10-22 00:54:01,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:01,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295275687] [2020-10-22 00:54:01,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:01,845 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-22 00:54:01,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295275687] [2020-10-22 00:54:01,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799985176] [2020-10-22 00:54:01,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 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-22 00:54:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:01,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:54:01,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:54:02,066 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-22 00:54:02,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:54:02,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:54:02,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1720327965] [2020-10-22 00:54:02,067 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:02,069 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:02,081 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 73 transitions. [2020-10-22 00:54:02,081 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:02,302 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [941714#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0), 941715#(<= (+ ~x~0 20) ~n~0)] [2020-10-22 00:54:02,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:54:02,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:02,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:54:02,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:54:02,303 INFO L87 Difference]: Start difference. First operand 9343 states and 42547 transitions. Second operand 11 states. [2020-10-22 00:54:03,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:03,533 INFO L93 Difference]: Finished difference Result 29316 states and 112409 transitions. [2020-10-22 00:54:03,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:54:03,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-22 00:54:03,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:03,622 INFO L225 Difference]: With dead ends: 29316 [2020-10-22 00:54:03,622 INFO L226 Difference]: Without dead ends: 29296 [2020-10-22 00:54:03,622 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:54:03,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29296 states. [2020-10-22 00:54:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29296 to 9260. [2020-10-22 00:54:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9260 states. [2020-10-22 00:54:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9260 states to 9260 states and 42114 transitions. [2020-10-22 00:54:04,092 INFO L78 Accepts]: Start accepts. Automaton has 9260 states and 42114 transitions. Word has length 25 [2020-10-22 00:54:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:04,092 INFO L481 AbstractCegarLoop]: Abstraction has 9260 states and 42114 transitions. [2020-10-22 00:54:04,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:54:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 9260 states and 42114 transitions. [2020-10-22 00:54:04,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:54:04,095 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:04,095 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-22 00:54:04,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2020-10-22 00:54:04,296 INFO L429 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-22 00:54:04,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:04,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1126098511, now seen corresponding path program 2 times [2020-10-22 00:54:04,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:04,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904357168] [2020-10-22 00:54:04,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:04,379 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-22 00:54:04,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904357168] [2020-10-22 00:54:04,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898793109] [2020-10-22 00:54:04,379 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 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-22 00:54:04,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-22 00:54:04,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-22 00:54:04,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:54:04,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:54:04,577 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-22 00:54:04,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:54:04,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:54:04,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1808881173] [2020-10-22 00:54:04,578 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:04,581 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:04,593 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 105 transitions. [2020-10-22 00:54:04,594 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:04,966 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [989687#(<= (+ ~x~0 20) ~n~0), 989686#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0)] [2020-10-22 00:54:04,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:54:04,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:04,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:54:04,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:54:04,967 INFO L87 Difference]: Start difference. First operand 9260 states and 42114 transitions. Second operand 11 states. [2020-10-22 00:54:06,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:06,216 INFO L93 Difference]: Finished difference Result 29093 states and 111462 transitions. [2020-10-22 00:54:06,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:54:06,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-22 00:54:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:06,295 INFO L225 Difference]: With dead ends: 29093 [2020-10-22 00:54:06,295 INFO L226 Difference]: Without dead ends: 29071 [2020-10-22 00:54:06,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:54:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29071 states. [2020-10-22 00:54:06,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29071 to 9176. [2020-10-22 00:54:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2020-10-22 00:54:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 41695 transitions. [2020-10-22 00:54:06,793 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 41695 transitions. Word has length 25 [2020-10-22 00:54:06,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:06,793 INFO L481 AbstractCegarLoop]: Abstraction has 9176 states and 41695 transitions. [2020-10-22 00:54:06,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:54:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 41695 transitions. [2020-10-22 00:54:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:54:06,797 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:06,798 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-22 00:54:06,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:54:06,998 INFO L429 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-22 00:54:06,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:06,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1814954082, now seen corresponding path program 3 times [2020-10-22 00:54:07,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:07,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197553486] [2020-10-22 00:54:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:07,088 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-22 00:54:07,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197553486] [2020-10-22 00:54:07,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145420250] [2020-10-22 00:54:07,089 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 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-22 00:54:07,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-22 00:54:07,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-22 00:54:07,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:54:07,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:54:07,301 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-22 00:54:07,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:54:07,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:54:07,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1749021423] [2020-10-22 00:54:07,302 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:07,304 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:07,312 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 57 transitions. [2020-10-22 00:54:07,313 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:07,448 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1037268#(<= (+ ~x~0 20) ~n~0), 1037267#(<= (+ thr2Thread3of5ForFork0_~t~0 20) ~n~0)] [2020-10-22 00:54:07,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:54:07,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:07,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:54:07,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:54:07,449 INFO L87 Difference]: Start difference. First operand 9176 states and 41695 transitions. Second operand 11 states. [2020-10-22 00:54:08,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:08,683 INFO L93 Difference]: Finished difference Result 29030 states and 111196 transitions. [2020-10-22 00:54:08,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:54:08,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-22 00:54:08,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:08,761 INFO L225 Difference]: With dead ends: 29030 [2020-10-22 00:54:08,761 INFO L226 Difference]: Without dead ends: 29010 [2020-10-22 00:54:08,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:54:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29010 states. [2020-10-22 00:54:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29010 to 9004. [2020-10-22 00:54:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9004 states. [2020-10-22 00:54:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9004 states to 9004 states and 40905 transitions. [2020-10-22 00:54:09,230 INFO L78 Accepts]: Start accepts. Automaton has 9004 states and 40905 transitions. Word has length 25 [2020-10-22 00:54:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:09,230 INFO L481 AbstractCegarLoop]: Abstraction has 9004 states and 40905 transitions. [2020-10-22 00:54:09,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:54:09,231 INFO L276 IsEmpty]: Start isEmpty. Operand 9004 states and 40905 transitions. [2020-10-22 00:54:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:54:09,234 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:09,235 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-22 00:54:09,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2020-10-22 00:54:09,435 INFO L429 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-22 00:54:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:09,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1734595810, now seen corresponding path program 4 times [2020-10-22 00:54:09,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:09,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198362514] [2020-10-22 00:54:09,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:09,514 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-22 00:54:09,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198362514] [2020-10-22 00:54:09,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588408873] [2020-10-22 00:54:09,515 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 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-22 00:54:09,595 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-22 00:54:09,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-22 00:54:09,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:54:09,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:54:09,713 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-22 00:54:09,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:54:09,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:54:09,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1258708505] [2020-10-22 00:54:09,714 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:09,716 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:09,723 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 41 transitions. [2020-10-22 00:54:09,723 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:09,811 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1084441#(<= (+ thr2Thread3of5ForFork0_~t~0 20) ~n~0), 1084442#(<= (+ ~x~0 20) ~n~0)] [2020-10-22 00:54:09,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:54:09,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:09,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:54:09,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:54:09,812 INFO L87 Difference]: Start difference. First operand 9004 states and 40905 transitions. Second operand 11 states. [2020-10-22 00:54:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:11,197 INFO L93 Difference]: Finished difference Result 29275 states and 112216 transitions. [2020-10-22 00:54:11,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:54:11,197 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-22 00:54:11,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:11,279 INFO L225 Difference]: With dead ends: 29275 [2020-10-22 00:54:11,279 INFO L226 Difference]: Without dead ends: 29253 [2020-10-22 00:54:11,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:54:11,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29253 states. [2020-10-22 00:54:11,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29253 to 9001. [2020-10-22 00:54:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9001 states. [2020-10-22 00:54:11,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9001 states to 9001 states and 40850 transitions. [2020-10-22 00:54:11,748 INFO L78 Accepts]: Start accepts. Automaton has 9001 states and 40850 transitions. Word has length 25 [2020-10-22 00:54:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:11,749 INFO L481 AbstractCegarLoop]: Abstraction has 9001 states and 40850 transitions. [2020-10-22 00:54:11,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:54:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 9001 states and 40850 transitions. [2020-10-22 00:54:11,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:54:11,752 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:11,752 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-22 00:54:11,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:54:11,953 INFO L429 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-22 00:54:11,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:11,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1734588091, now seen corresponding path program 1 times [2020-10-22 00:54:11,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:11,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837395570] [2020-10-22 00:54:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:12,034 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-22 00:54:12,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837395570] [2020-10-22 00:54:12,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621930271] [2020-10-22 00:54:12,035 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-22 00:54:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:12,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:54:12,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:54:12,259 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-22 00:54:12,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:54:12,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:54:12,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [271043323] [2020-10-22 00:54:12,260 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:12,262 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:12,268 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 41 transitions. [2020-10-22 00:54:12,268 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:12,357 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1131855#(<= (+ ~x~0 20) ~n~0), 1131854#(<= (+ thr2Thread3of5ForFork0_~t~0 20) ~n~0)] [2020-10-22 00:54:12,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:54:12,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:12,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:54:12,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:54:12,358 INFO L87 Difference]: Start difference. First operand 9001 states and 40850 transitions. Second operand 11 states. [2020-10-22 00:54:13,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:13,560 INFO L93 Difference]: Finished difference Result 29105 states and 111801 transitions. [2020-10-22 00:54:13,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:54:13,560 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-22 00:54:13,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:13,628 INFO L225 Difference]: With dead ends: 29105 [2020-10-22 00:54:13,628 INFO L226 Difference]: Without dead ends: 29085 [2020-10-22 00:54:13,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:54:13,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29085 states. [2020-10-22 00:54:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29085 to 8951. [2020-10-22 00:54:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8951 states. [2020-10-22 00:54:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8951 states to 8951 states and 40581 transitions. [2020-10-22 00:54:14,074 INFO L78 Accepts]: Start accepts. Automaton has 8951 states and 40581 transitions. Word has length 25 [2020-10-22 00:54:14,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:14,074 INFO L481 AbstractCegarLoop]: Abstraction has 8951 states and 40581 transitions. [2020-10-22 00:54:14,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:54:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 8951 states and 40581 transitions. [2020-10-22 00:54:14,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:54:14,078 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:14,078 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-22 00:54:14,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:54:14,278 INFO L429 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-22 00:54:14,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:14,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1730362171, now seen corresponding path program 2 times [2020-10-22 00:54:14,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:14,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164385106] [2020-10-22 00:54:14,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:14,347 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-22 00:54:14,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164385106] [2020-10-22 00:54:14,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698831362] [2020-10-22 00:54:14,348 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 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-22 00:54:14,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-22 00:54:14,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-22 00:54:14,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:54:14,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:54:14,534 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-22 00:54:14,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:54:14,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:54:14,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [96714191] [2020-10-22 00:54:14,535 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:14,538 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:14,544 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 57 transitions. [2020-10-22 00:54:14,545 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:14,690 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1178997#(<= (+ thr2Thread3of5ForFork0_~t~0 20) ~n~0), 1178998#(<= (+ ~x~0 20) ~n~0)] [2020-10-22 00:54:14,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:54:14,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:14,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:54:14,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:54:14,691 INFO L87 Difference]: Start difference. First operand 8951 states and 40581 transitions. Second operand 11 states. [2020-10-22 00:54:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:15,946 INFO L93 Difference]: Finished difference Result 28806 states and 110558 transitions. [2020-10-22 00:54:15,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:54:15,947 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-22 00:54:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:16,017 INFO L225 Difference]: With dead ends: 28806 [2020-10-22 00:54:16,017 INFO L226 Difference]: Without dead ends: 28779 [2020-10-22 00:54:16,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:54:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28779 states. [2020-10-22 00:54:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28779 to 8841. [2020-10-22 00:54:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8841 states. [2020-10-22 00:54:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 40058 transitions. [2020-10-22 00:54:16,437 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 40058 transitions. Word has length 25 [2020-10-22 00:54:16,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:16,437 INFO L481 AbstractCegarLoop]: Abstraction has 8841 states and 40058 transitions. [2020-10-22 00:54:16,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:54:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 40058 transitions. [2020-10-22 00:54:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:54:16,442 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:16,442 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-22 00:54:16,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2020-10-22 00:54:16,649 INFO L429 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-22 00:54:16,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:16,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1302913182, now seen corresponding path program 5 times [2020-10-22 00:54:16,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:16,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271907236] [2020-10-22 00:54:16,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:16,716 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-22 00:54:16,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271907236] [2020-10-22 00:54:16,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:16,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:54:16,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1435790222] [2020-10-22 00:54:16,717 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:16,719 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:16,724 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 25 transitions. [2020-10-22 00:54:16,724 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:16,724 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:54:16,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:54:16,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:16,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:54:16,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:54:16,725 INFO L87 Difference]: Start difference. First operand 8841 states and 40058 transitions. Second operand 9 states. [2020-10-22 00:54:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:17,710 INFO L93 Difference]: Finished difference Result 28597 states and 109522 transitions. [2020-10-22 00:54:17,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:54:17,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-22 00:54:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:17,788 INFO L225 Difference]: With dead ends: 28597 [2020-10-22 00:54:17,788 INFO L226 Difference]: Without dead ends: 28577 [2020-10-22 00:54:17,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-22 00:54:17,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28577 states. [2020-10-22 00:54:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28577 to 8616. [2020-10-22 00:54:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8616 states. [2020-10-22 00:54:18,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8616 states to 8616 states and 39029 transitions. [2020-10-22 00:54:18,228 INFO L78 Accepts]: Start accepts. Automaton has 8616 states and 39029 transitions. Word has length 25 [2020-10-22 00:54:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:18,228 INFO L481 AbstractCegarLoop]: Abstraction has 8616 states and 39029 transitions. [2020-10-22 00:54:18,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:54:18,228 INFO L276 IsEmpty]: Start isEmpty. Operand 8616 states and 39029 transitions. [2020-10-22 00:54:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:54:18,231 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:18,232 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-22 00:54:18,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2020-10-22 00:54:18,232 INFO L429 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-22 00:54:18,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:18,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1302920901, now seen corresponding path program 3 times [2020-10-22 00:54:18,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:18,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330838109] [2020-10-22 00:54:18,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:18,305 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-22 00:54:18,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330838109] [2020-10-22 00:54:18,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:18,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:54:18,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1565538270] [2020-10-22 00:54:18,306 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:18,309 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:18,315 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 25 transitions. [2020-10-22 00:54:18,315 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:18,316 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:54:18,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:54:18,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:18,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:54:18,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:54:18,318 INFO L87 Difference]: Start difference. First operand 8616 states and 39029 transitions. Second operand 9 states. [2020-10-22 00:54:19,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:19,319 INFO L93 Difference]: Finished difference Result 28374 states and 108800 transitions. [2020-10-22 00:54:19,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:54:19,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-22 00:54:19,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:19,388 INFO L225 Difference]: With dead ends: 28374 [2020-10-22 00:54:19,388 INFO L226 Difference]: Without dead ends: 28354 [2020-10-22 00:54:19,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-22 00:54:19,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28354 states. [2020-10-22 00:54:19,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28354 to 8466. [2020-10-22 00:54:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8466 states. [2020-10-22 00:54:19,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8466 states to 8466 states and 38348 transitions. [2020-10-22 00:54:19,808 INFO L78 Accepts]: Start accepts. Automaton has 8466 states and 38348 transitions. Word has length 25 [2020-10-22 00:54:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:19,808 INFO L481 AbstractCegarLoop]: Abstraction has 8466 states and 38348 transitions. [2020-10-22 00:54:19,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:54:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 8466 states and 38348 transitions. [2020-10-22 00:54:19,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:54:19,811 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:19,811 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-22 00:54:19,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2020-10-22 00:54:19,811 INFO L429 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-22 00:54:19,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:19,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1283569182, now seen corresponding path program 6 times [2020-10-22 00:54:19,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:19,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301768301] [2020-10-22 00:54:19,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:19,953 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-22 00:54:19,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301768301] [2020-10-22 00:54:19,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:19,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:54:19,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [98550699] [2020-10-22 00:54:19,954 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:19,956 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:19,961 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 25 transitions. [2020-10-22 00:54:19,961 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:19,962 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:54:19,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:54:19,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:19,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:54:19,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:54:19,962 INFO L87 Difference]: Start difference. First operand 8466 states and 38348 transitions. Second operand 9 states. [2020-10-22 00:54:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:20,977 INFO L93 Difference]: Finished difference Result 27919 states and 106695 transitions. [2020-10-22 00:54:20,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:54:20,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-22 00:54:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:21,052 INFO L225 Difference]: With dead ends: 27919 [2020-10-22 00:54:21,052 INFO L226 Difference]: Without dead ends: 27892 [2020-10-22 00:54:21,053 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-22 00:54:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27892 states. [2020-10-22 00:54:21,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27892 to 8151. [2020-10-22 00:54:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8151 states. [2020-10-22 00:54:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8151 states to 8151 states and 36997 transitions. [2020-10-22 00:54:21,470 INFO L78 Accepts]: Start accepts. Automaton has 8151 states and 36997 transitions. Word has length 25 [2020-10-22 00:54:21,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:21,471 INFO L481 AbstractCegarLoop]: Abstraction has 8151 states and 36997 transitions. [2020-10-22 00:54:21,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:54:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 8151 states and 36997 transitions. [2020-10-22 00:54:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:54:21,474 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:21,475 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-22 00:54:21,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2020-10-22 00:54:21,475 INFO L429 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-22 00:54:21,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:21,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1283556751, now seen corresponding path program 3 times [2020-10-22 00:54:21,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:21,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294972216] [2020-10-22 00:54:21,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:21,565 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-22 00:54:21,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294972216] [2020-10-22 00:54:21,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:21,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:54:21,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [17211455] [2020-10-22 00:54:21,566 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:21,570 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:21,576 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 25 transitions. [2020-10-22 00:54:21,577 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:21,578 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:54:21,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:54:21,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:21,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:54:21,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:54:21,578 INFO L87 Difference]: Start difference. First operand 8151 states and 36997 transitions. Second operand 9 states. [2020-10-22 00:54:22,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:22,585 INFO L93 Difference]: Finished difference Result 27732 states and 106194 transitions. [2020-10-22 00:54:22,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:54:22,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-22 00:54:22,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:22,652 INFO L225 Difference]: With dead ends: 27732 [2020-10-22 00:54:22,653 INFO L226 Difference]: Without dead ends: 27712 [2020-10-22 00:54:22,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-22 00:54:22,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27712 states. [2020-10-22 00:54:23,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27712 to 8053. [2020-10-22 00:54:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8053 states. [2020-10-22 00:54:23,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8053 states to 8053 states and 36561 transitions. [2020-10-22 00:54:23,060 INFO L78 Accepts]: Start accepts. Automaton has 8053 states and 36561 transitions. Word has length 25 [2020-10-22 00:54:23,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:23,060 INFO L481 AbstractCegarLoop]: Abstraction has 8053 states and 36561 transitions. [2020-10-22 00:54:23,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:54:23,061 INFO L276 IsEmpty]: Start isEmpty. Operand 8053 states and 36561 transitions. [2020-10-22 00:54:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:54:23,064 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:23,064 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-22 00:54:23,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2020-10-22 00:54:23,064 INFO L429 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-22 00:54:23,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:23,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1290987141, now seen corresponding path program 4 times [2020-10-22 00:54:23,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:23,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729319610] [2020-10-22 00:54:23,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:23,145 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-22 00:54:23,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729319610] [2020-10-22 00:54:23,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:23,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:54:23,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1831895522] [2020-10-22 00:54:23,146 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:23,148 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:23,153 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 25 transitions. [2020-10-22 00:54:23,153 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:23,153 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:54:23,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:54:23,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:23,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:54:23,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:54:23,154 INFO L87 Difference]: Start difference. First operand 8053 states and 36561 transitions. Second operand 9 states. [2020-10-22 00:54:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:24,239 INFO L93 Difference]: Finished difference Result 27752 states and 106300 transitions. [2020-10-22 00:54:24,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:54:24,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-22 00:54:24,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:24,307 INFO L225 Difference]: With dead ends: 27752 [2020-10-22 00:54:24,307 INFO L226 Difference]: Without dead ends: 27725 [2020-10-22 00:54:24,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-22 00:54:24,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27725 states. [2020-10-22 00:54:24,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27725 to 8053. [2020-10-22 00:54:24,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8053 states. [2020-10-22 00:54:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8053 states to 8053 states and 36529 transitions. [2020-10-22 00:54:24,954 INFO L78 Accepts]: Start accepts. Automaton has 8053 states and 36529 transitions. Word has length 25 [2020-10-22 00:54:24,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:24,954 INFO L481 AbstractCegarLoop]: Abstraction has 8053 states and 36529 transitions. [2020-10-22 00:54:24,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:54:24,954 INFO L276 IsEmpty]: Start isEmpty. Operand 8053 states and 36529 transitions. [2020-10-22 00:54:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:54:24,958 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:24,958 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-22 00:54:24,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-10-22 00:54:24,958 INFO L429 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-22 00:54:24,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:24,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1290966991, now seen corresponding path program 4 times [2020-10-22 00:54:24,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:24,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958381790] [2020-10-22 00:54:24,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:25,032 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-22 00:54:25,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958381790] [2020-10-22 00:54:25,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:25,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:54:25,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1063074888] [2020-10-22 00:54:25,033 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:25,036 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:25,043 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 25 transitions. [2020-10-22 00:54:25,043 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:25,043 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:54:25,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:54:25,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:25,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:54:25,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:54:25,044 INFO L87 Difference]: Start difference. First operand 8053 states and 36529 transitions. Second operand 9 states. [2020-10-22 00:54:26,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:26,011 INFO L93 Difference]: Finished difference Result 27429 states and 105043 transitions. [2020-10-22 00:54:26,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:54:26,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-22 00:54:26,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:26,077 INFO L225 Difference]: With dead ends: 27429 [2020-10-22 00:54:26,078 INFO L226 Difference]: Without dead ends: 27402 [2020-10-22 00:54:26,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-22 00:54:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27402 states. [2020-10-22 00:54:26,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27402 to 7996. [2020-10-22 00:54:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7996 states. [2020-10-22 00:54:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7996 states to 7996 states and 36246 transitions. [2020-10-22 00:54:26,489 INFO L78 Accepts]: Start accepts. Automaton has 7996 states and 36246 transitions. Word has length 25 [2020-10-22 00:54:26,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:26,489 INFO L481 AbstractCegarLoop]: Abstraction has 7996 states and 36246 transitions. [2020-10-22 00:54:26,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:54:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 7996 states and 36246 transitions. [2020-10-22 00:54:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:54:26,492 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:26,492 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:54:26,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2020-10-22 00:54:26,492 INFO L429 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-22 00:54:26,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:26,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1806156920, now seen corresponding path program 1 times [2020-10-22 00:54:26,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:26,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400325180] [2020-10-22 00:54:26,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:26,543 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-22 00:54:26,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400325180] [2020-10-22 00:54:26,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:26,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:54:26,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1667659592] [2020-10-22 00:54:26,544 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:26,546 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:26,552 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 25 transitions. [2020-10-22 00:54:26,552 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:26,552 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:54:26,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:54:26,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:26,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:54:26,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:54:26,553 INFO L87 Difference]: Start difference. First operand 7996 states and 36246 transitions. Second operand 5 states. [2020-10-22 00:54:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:26,825 INFO L93 Difference]: Finished difference Result 13000 states and 56551 transitions. [2020-10-22 00:54:26,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:54:26,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-10-22 00:54:26,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:26,888 INFO L225 Difference]: With dead ends: 13000 [2020-10-22 00:54:26,888 INFO L226 Difference]: Without dead ends: 12968 [2020-10-22 00:54:26,889 INFO L677 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-22 00:54:27,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12968 states. [2020-10-22 00:54:27,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12968 to 9425. [2020-10-22 00:54:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9425 states. [2020-10-22 00:54:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9425 states to 9425 states and 42312 transitions. [2020-10-22 00:54:27,451 INFO L78 Accepts]: Start accepts. Automaton has 9425 states and 42312 transitions. Word has length 25 [2020-10-22 00:54:27,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:27,451 INFO L481 AbstractCegarLoop]: Abstraction has 9425 states and 42312 transitions. [2020-10-22 00:54:27,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:54:27,452 INFO L276 IsEmpty]: Start isEmpty. Operand 9425 states and 42312 transitions. [2020-10-22 00:54:27,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:54:27,457 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:27,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-22 00:54:27,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2020-10-22 00:54:27,458 INFO L429 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-22 00:54:27,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:27,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1073288645, now seen corresponding path program 5 times [2020-10-22 00:54:27,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:27,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902012998] [2020-10-22 00:54:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:27,563 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-22 00:54:27,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902012998] [2020-10-22 00:54:27,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:27,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:54:27,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [301432178] [2020-10-22 00:54:27,565 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:27,569 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:27,580 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 73 transitions. [2020-10-22 00:54:27,581 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:27,904 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:54:27,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:54:27,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:27,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:54:27,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:54:27,905 INFO L87 Difference]: Start difference. First operand 9425 states and 42312 transitions. Second operand 9 states. [2020-10-22 00:54:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:28,912 INFO L93 Difference]: Finished difference Result 30960 states and 119709 transitions. [2020-10-22 00:54:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:54:28,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-22 00:54:28,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:28,994 INFO L225 Difference]: With dead ends: 30960 [2020-10-22 00:54:28,994 INFO L226 Difference]: Without dead ends: 30934 [2020-10-22 00:54:28,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-22 00:54:29,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30934 states. [2020-10-22 00:54:29,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30934 to 9270. [2020-10-22 00:54:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9270 states. [2020-10-22 00:54:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9270 states to 9270 states and 41573 transitions. [2020-10-22 00:54:29,468 INFO L78 Accepts]: Start accepts. Automaton has 9270 states and 41573 transitions. Word has length 25 [2020-10-22 00:54:29,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:29,468 INFO L481 AbstractCegarLoop]: Abstraction has 9270 states and 41573 transitions. [2020-10-22 00:54:29,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:54:29,468 INFO L276 IsEmpty]: Start isEmpty. Operand 9270 states and 41573 transitions. [2020-10-22 00:54:29,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:54:29,471 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:29,471 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-22 00:54:29,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2020-10-22 00:54:29,472 INFO L429 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-22 00:54:29,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:29,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1057128965, now seen corresponding path program 6 times [2020-10-22 00:54:29,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:29,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943849560] [2020-10-22 00:54:29,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:29,544 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-22 00:54:29,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943849560] [2020-10-22 00:54:29,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:29,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:54:29,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1032184758] [2020-10-22 00:54:29,545 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:29,548 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:29,558 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 57 transitions. [2020-10-22 00:54:29,559 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:29,764 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:54:29,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:54:29,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:29,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:54:29,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:54:29,765 INFO L87 Difference]: Start difference. First operand 9270 states and 41573 transitions. Second operand 9 states. [2020-10-22 00:54:30,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:30,940 INFO L93 Difference]: Finished difference Result 30557 states and 118001 transitions. [2020-10-22 00:54:30,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:54:30,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-22 00:54:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:31,015 INFO L225 Difference]: With dead ends: 30557 [2020-10-22 00:54:31,015 INFO L226 Difference]: Without dead ends: 30524 [2020-10-22 00:54:31,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-22 00:54:31,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30524 states. [2020-10-22 00:54:31,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30524 to 9003. [2020-10-22 00:54:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9003 states. [2020-10-22 00:54:31,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9003 states to 9003 states and 40426 transitions. [2020-10-22 00:54:31,475 INFO L78 Accepts]: Start accepts. Automaton has 9003 states and 40426 transitions. Word has length 25 [2020-10-22 00:54:31,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:31,475 INFO L481 AbstractCegarLoop]: Abstraction has 9003 states and 40426 transitions. [2020-10-22 00:54:31,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:54:31,475 INFO L276 IsEmpty]: Start isEmpty. Operand 9003 states and 40426 transitions. [2020-10-22 00:54:31,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:54:31,478 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:31,478 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-22 00:54:31,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2020-10-22 00:54:31,479 INFO L429 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-22 00:54:31,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:31,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1057108815, now seen corresponding path program 5 times [2020-10-22 00:54:31,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:31,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268602781] [2020-10-22 00:54:31,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:31,558 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-22 00:54:31,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268602781] [2020-10-22 00:54:31,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:31,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:54:31,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [969616288] [2020-10-22 00:54:31,559 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:31,562 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:31,573 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 57 transitions. [2020-10-22 00:54:31,574 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:31,862 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:54:31,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:54:31,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:31,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:54:31,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:54:31,864 INFO L87 Difference]: Start difference. First operand 9003 states and 40426 transitions. Second operand 9 states. [2020-10-22 00:54:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:33,364 INFO L93 Difference]: Finished difference Result 30154 states and 116397 transitions. [2020-10-22 00:54:33,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:54:33,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-22 00:54:33,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:33,496 INFO L225 Difference]: With dead ends: 30154 [2020-10-22 00:54:33,497 INFO L226 Difference]: Without dead ends: 30128 [2020-10-22 00:54:33,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-22 00:54:33,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30128 states. [2020-10-22 00:54:34,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30128 to 8901. [2020-10-22 00:54:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8901 states. [2020-10-22 00:54:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8901 states to 8901 states and 39944 transitions. [2020-10-22 00:54:34,163 INFO L78 Accepts]: Start accepts. Automaton has 8901 states and 39944 transitions. Word has length 25 [2020-10-22 00:54:34,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:34,163 INFO L481 AbstractCegarLoop]: Abstraction has 8901 states and 39944 transitions. [2020-10-22 00:54:34,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:54:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 8901 states and 39944 transitions. [2020-10-22 00:54:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:54:34,166 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:34,166 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-22 00:54:34,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2020-10-22 00:54:34,166 INFO L429 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-22 00:54:34,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:34,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1053924495, now seen corresponding path program 6 times [2020-10-22 00:54:34,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:34,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203513028] [2020-10-22 00:54:34,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:34,251 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-22 00:54:34,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203513028] [2020-10-22 00:54:34,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:34,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:54:34,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1435144574] [2020-10-22 00:54:34,252 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:34,254 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:34,264 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 89 transitions. [2020-10-22 00:54:34,264 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:34,601 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:54:34,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:54:34,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:34,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:54:34,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:54:34,602 INFO L87 Difference]: Start difference. First operand 8901 states and 39944 transitions. Second operand 9 states. [2020-10-22 00:54:35,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:35,711 INFO L93 Difference]: Finished difference Result 29876 states and 115200 transitions. [2020-10-22 00:54:35,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:54:35,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-22 00:54:35,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:35,795 INFO L225 Difference]: With dead ends: 29876 [2020-10-22 00:54:35,795 INFO L226 Difference]: Without dead ends: 29843 [2020-10-22 00:54:35,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-22 00:54:35,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29843 states. [2020-10-22 00:54:36,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29843 to 8560. [2020-10-22 00:54:36,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8560 states. [2020-10-22 00:54:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8560 states to 8560 states and 38495 transitions. [2020-10-22 00:54:36,254 INFO L78 Accepts]: Start accepts. Automaton has 8560 states and 38495 transitions. Word has length 25 [2020-10-22 00:54:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:36,254 INFO L481 AbstractCegarLoop]: Abstraction has 8560 states and 38495 transitions. [2020-10-22 00:54:36,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:54:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 8560 states and 38495 transitions. [2020-10-22 00:54:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-22 00:54:36,258 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:36,258 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:54:36,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-10-22 00:54:36,258 INFO L429 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-22 00:54:36,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:36,258 INFO L82 PathProgramCache]: Analyzing trace with hash 150081278, now seen corresponding path program 1 times [2020-10-22 00:54:36,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:36,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776160664] [2020-10-22 00:54:36,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:54:36,267 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:54:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:54:36,274 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:54:36,283 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:54:36,283 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:54:36,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2020-10-22 00:54:36,283 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 00:54:36,284 WARN L371 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-22 00:54:36,284 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2020-10-22 00:54:36,365 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,365 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,365 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,365 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,365 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,366 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,366 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,366 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,366 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,366 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,366 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,366 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,367 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,367 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,367 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,367 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,367 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,367 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,367 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,368 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,368 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,368 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,368 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,368 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,368 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,368 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,368 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,369 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,369 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,369 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,369 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,369 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,369 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,369 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,370 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,370 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,370 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,370 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,370 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,370 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,370 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,370 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,373 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,374 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,377 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,378 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,378 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,379 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,379 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,379 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,379 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,379 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,381 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,381 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,381 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,381 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,381 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,383 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,384 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,384 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,384 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,384 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,385 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,385 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,385 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,385 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,385 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,392 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,392 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,392 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,392 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,392 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,393 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,394 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,394 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,394 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,394 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,397 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,397 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,399 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,399 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,399 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,399 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,400 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,400 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,402 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,402 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,403 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,403 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:54:36,405 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:54:36,406 INFO L253 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-10-22 00:54:36,406 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:54:36,406 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:54:36,406 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:54:36,406 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:54:36,407 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:54:36,407 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:54:36,407 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:54:36,407 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:54:36,409 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:54:36,409 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 172 transitions, 464 flow [2020-10-22 00:54:36,409 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 172 transitions, 464 flow [2020-10-22 00:54:36,410 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 184 places, 172 transitions, 464 flow [2020-10-22 00:54:36,432 INFO L129 PetriNetUnfolder]: 10/182 cut-off events. [2020-10-22 00:54:36,432 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-22 00:54:36,434 INFO L80 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 182 events. 10/182 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 320 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 217. Up to 14 conditions per place. [2020-10-22 00:54:36,440 INFO L116 LiptonReduction]: Number of co-enabled transitions 3372 [2020-10-22 00:54:38,758 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2020-10-22 00:54:39,395 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-10-22 00:54:39,647 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2020-10-22 00:54:40,067 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2020-10-22 00:54:40,212 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-22 00:54:40,230 INFO L131 LiptonReduction]: Checked pairs total: 5911 [2020-10-22 00:54:40,231 INFO L133 LiptonReduction]: Total number of compositions: 191 [2020-10-22 00:54:40,231 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 45 transitions, 210 flow [2020-10-22 00:54:41,965 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2020-10-22 00:54:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2020-10-22 00:54:41,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-22 00:54:41,965 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:41,965 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-22 00:54:41,965 INFO L429 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-22 00:54:41,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:41,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1689038, now seen corresponding path program 1 times [2020-10-22 00:54:41,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:41,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682718669] [2020-10-22 00:54:41,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:41,979 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-22 00:54:41,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682718669] [2020-10-22 00:54:41,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:41,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:54:41,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [711141385] [2020-10-22 00:54:41,980 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:41,980 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:41,980 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-22 00:54:41,981 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:41,981 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:54:41,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:54:41,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:41,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:54:41,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:54:41,982 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2020-10-22 00:54:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:42,144 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2020-10-22 00:54:42,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:54:42,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-22 00:54:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:42,198 INFO L225 Difference]: With dead ends: 17885 [2020-10-22 00:54:42,199 INFO L226 Difference]: Without dead ends: 16791 [2020-10-22 00:54:42,199 INFO L677 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-22 00:54:42,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2020-10-22 00:54:43,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16791. [2020-10-22 00:54:43,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16791 states. [2020-10-22 00:54:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16791 states to 16791 states and 86558 transitions. [2020-10-22 00:54:43,321 INFO L78 Accepts]: Start accepts. Automaton has 16791 states and 86558 transitions. Word has length 3 [2020-10-22 00:54:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:43,321 INFO L481 AbstractCegarLoop]: Abstraction has 16791 states and 86558 transitions. [2020-10-22 00:54:43,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:54:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 16791 states and 86558 transitions. [2020-10-22 00:54:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 00:54:43,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:43,322 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:54:43,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2020-10-22 00:54:43,322 INFO L429 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-22 00:54:43,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:43,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1195163712, now seen corresponding path program 1 times [2020-10-22 00:54:43,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:43,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978747590] [2020-10-22 00:54:43,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:43,352 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-22 00:54:43,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978747590] [2020-10-22 00:54:43,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:43,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:54:43,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1925996300] [2020-10-22 00:54:43,353 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:43,354 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:43,354 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 00:54:43,355 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:43,355 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:54:43,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:54:43,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:43,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:54:43,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:54:43,355 INFO L87 Difference]: Start difference. First operand 16791 states and 86558 transitions. Second operand 5 states. [2020-10-22 00:54:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:43,673 INFO L93 Difference]: Finished difference Result 30985 states and 150574 transitions. [2020-10-22 00:54:43,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:54:43,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-22 00:54:43,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:43,769 INFO L225 Difference]: With dead ends: 30985 [2020-10-22 00:54:43,769 INFO L226 Difference]: Without dead ends: 30977 [2020-10-22 00:54:43,770 INFO L677 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-22 00:54:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30977 states. [2020-10-22 00:54:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30977 to 19868. [2020-10-22 00:54:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19868 states. [2020-10-22 00:54:44,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19868 states to 19868 states and 103363 transitions. [2020-10-22 00:54:44,806 INFO L78 Accepts]: Start accepts. Automaton has 19868 states and 103363 transitions. Word has length 9 [2020-10-22 00:54:44,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:44,807 INFO L481 AbstractCegarLoop]: Abstraction has 19868 states and 103363 transitions. [2020-10-22 00:54:44,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:54:44,807 INFO L276 IsEmpty]: Start isEmpty. Operand 19868 states and 103363 transitions. [2020-10-22 00:54:44,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:54:44,807 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:44,807 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:54:44,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2020-10-22 00:54:44,808 INFO L429 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-22 00:54:44,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:44,808 INFO L82 PathProgramCache]: Analyzing trace with hash 749431237, now seen corresponding path program 1 times [2020-10-22 00:54:44,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:44,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054532630] [2020-10-22 00:54:44,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:44,850 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-22 00:54:44,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054532630] [2020-10-22 00:54:44,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:44,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:54:44,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [159797732] [2020-10-22 00:54:44,850 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:44,851 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:44,853 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-10-22 00:54:44,853 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:44,853 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:54:44,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:54:44,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:44,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:54:44,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:54:44,854 INFO L87 Difference]: Start difference. First operand 19868 states and 103363 transitions. Second operand 5 states. [2020-10-22 00:54:45,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:45,344 INFO L93 Difference]: Finished difference Result 36296 states and 178836 transitions. [2020-10-22 00:54:45,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:54:45,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-22 00:54:45,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:45,522 INFO L225 Difference]: With dead ends: 36296 [2020-10-22 00:54:45,522 INFO L226 Difference]: Without dead ends: 36280 [2020-10-22 00:54:45,522 INFO L677 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-22 00:54:46,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36280 states. [2020-10-22 00:54:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36280 to 23806. [2020-10-22 00:54:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23806 states. [2020-10-22 00:54:48,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23806 states to 23806 states and 125455 transitions. [2020-10-22 00:54:48,913 INFO L78 Accepts]: Start accepts. Automaton has 23806 states and 125455 transitions. Word has length 13 [2020-10-22 00:54:48,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:48,913 INFO L481 AbstractCegarLoop]: Abstraction has 23806 states and 125455 transitions. [2020-10-22 00:54:48,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:54:48,913 INFO L276 IsEmpty]: Start isEmpty. Operand 23806 states and 125455 transitions. [2020-10-22 00:54:48,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:54:48,914 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:48,914 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:54:48,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-10-22 00:54:48,914 INFO L429 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-22 00:54:48,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:48,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1975297452, now seen corresponding path program 1 times [2020-10-22 00:54:48,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:48,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906849148] [2020-10-22 00:54:48,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:48,954 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-22 00:54:48,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906849148] [2020-10-22 00:54:48,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030546156] [2020-10-22 00:54:48,955 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-22 00:54:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:49,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-22 00:54:49,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:54:49,117 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-22 00:54:49,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:54:49,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-22 00:54:49,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1819198922] [2020-10-22 00:54:49,118 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:49,120 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:49,122 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-10-22 00:54:49,122 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:49,206 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [243527#(<= (+ ~x~0 20) ~n~0), 243526#(<= (+ thr2Thread1of6ForFork0_~t~0 20) ~n~0)] [2020-10-22 00:54:49,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:54:49,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:49,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:54:49,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:54:49,207 INFO L87 Difference]: Start difference. First operand 23806 states and 125455 transitions. Second operand 9 states. [2020-10-22 00:54:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:49,973 INFO L93 Difference]: Finished difference Result 56720 states and 262685 transitions. [2020-10-22 00:54:49,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:54:49,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-22 00:54:49,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:50,151 INFO L225 Difference]: With dead ends: 56720 [2020-10-22 00:54:50,151 INFO L226 Difference]: Without dead ends: 56704 [2020-10-22 00:54:50,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-22 00:54:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56704 states. [2020-10-22 00:54:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56704 to 23629. [2020-10-22 00:54:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23629 states. [2020-10-22 00:54:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23629 states to 23629 states and 124418 transitions. [2020-10-22 00:54:51,669 INFO L78 Accepts]: Start accepts. Automaton has 23629 states and 124418 transitions. Word has length 15 [2020-10-22 00:54:51,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:51,670 INFO L481 AbstractCegarLoop]: Abstraction has 23629 states and 124418 transitions. [2020-10-22 00:54:51,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:54:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 23629 states and 124418 transitions. [2020-10-22 00:54:51,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:54:51,670 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:51,670 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:54:51,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2020-10-22 00:54:51,871 INFO L429 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-22 00:54:51,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:51,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1351073514, now seen corresponding path program 2 times [2020-10-22 00:54:51,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:51,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856626759] [2020-10-22 00:54:51,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:51,919 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-22 00:54:51,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856626759] [2020-10-22 00:54:51,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:51,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:54:51,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [840982268] [2020-10-22 00:54:51,920 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:51,921 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:51,922 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2020-10-22 00:54:51,922 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:51,923 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:54:51,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:54:51,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:51,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:54:51,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:54:51,923 INFO L87 Difference]: Start difference. First operand 23629 states and 124418 transitions. Second operand 7 states. [2020-10-22 00:54:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:53,169 INFO L93 Difference]: Finished difference Result 58078 states and 269185 transitions. [2020-10-22 00:54:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:54:53,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-22 00:54:53,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:53,370 INFO L225 Difference]: With dead ends: 58078 [2020-10-22 00:54:53,370 INFO L226 Difference]: Without dead ends: 58061 [2020-10-22 00:54:53,370 INFO L677 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-22 00:54:54,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58061 states. [2020-10-22 00:54:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58061 to 23109. [2020-10-22 00:54:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23109 states. [2020-10-22 00:54:54,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23109 states to 23109 states and 121651 transitions. [2020-10-22 00:54:54,854 INFO L78 Accepts]: Start accepts. Automaton has 23109 states and 121651 transitions. Word has length 15 [2020-10-22 00:54:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:54,855 INFO L481 AbstractCegarLoop]: Abstraction has 23109 states and 121651 transitions. [2020-10-22 00:54:54,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:54:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 23109 states and 121651 transitions. [2020-10-22 00:54:54,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 00:54:54,855 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:54,855 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:54:54,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2020-10-22 00:54:54,856 INFO L429 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-22 00:54:54,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:54,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1256878032, now seen corresponding path program 1 times [2020-10-22 00:54:54,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:54,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878735979] [2020-10-22 00:54:54,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:54,896 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-22 00:54:54,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878735979] [2020-10-22 00:54:54,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:54,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:54:54,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1909581424] [2020-10-22 00:54:54,897 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:54,898 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:54,900 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-10-22 00:54:54,900 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:54,900 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:54:54,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:54:54,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:54,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:54:54,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:54:54,901 INFO L87 Difference]: Start difference. First operand 23109 states and 121651 transitions. Second operand 5 states. [2020-10-22 00:54:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:55,290 INFO L93 Difference]: Finished difference Result 41885 states and 209629 transitions. [2020-10-22 00:54:55,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:54:55,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-22 00:54:55,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:55,438 INFO L225 Difference]: With dead ends: 41885 [2020-10-22 00:54:55,438 INFO L226 Difference]: Without dead ends: 41856 [2020-10-22 00:54:55,439 INFO L677 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-22 00:54:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41856 states. [2020-10-22 00:54:57,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41856 to 28237. [2020-10-22 00:54:57,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28237 states. [2020-10-22 00:54:57,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28237 states to 28237 states and 150261 transitions. [2020-10-22 00:54:57,370 INFO L78 Accepts]: Start accepts. Automaton has 28237 states and 150261 transitions. Word has length 17 [2020-10-22 00:54:57,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:57,371 INFO L481 AbstractCegarLoop]: Abstraction has 28237 states and 150261 transitions. [2020-10-22 00:54:57,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:54:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 28237 states and 150261 transitions. [2020-10-22 00:54:57,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 00:54:57,371 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:57,371 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:54:57,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2020-10-22 00:54:57,372 INFO L429 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-22 00:54:57,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:57,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1122599135, now seen corresponding path program 1 times [2020-10-22 00:54:57,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:57,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359553346] [2020-10-22 00:54:57,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:57,417 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-22 00:54:57,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359553346] [2020-10-22 00:54:57,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919857493] [2020-10-22 00:54:57,418 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-22 00:54:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:57,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-22 00:54:57,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:54:57,577 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-22 00:54:57,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:54:57,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-22 00:54:57,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [422887223] [2020-10-22 00:54:57,578 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:57,579 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:57,583 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 51 transitions. [2020-10-22 00:54:57,584 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:57,729 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [550275#(<= (+ thr2Thread1of6ForFork0_~t~0 20) ~n~0), 550276#(<= (+ ~x~0 20) ~n~0)] [2020-10-22 00:54:57,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:54:57,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:57,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:54:57,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:54:57,730 INFO L87 Difference]: Start difference. First operand 28237 states and 150261 transitions. Second operand 9 states. [2020-10-22 00:54:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:58,536 INFO L93 Difference]: Finished difference Result 66831 states and 314874 transitions. [2020-10-22 00:54:58,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:54:58,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-22 00:54:58,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:58,754 INFO L225 Difference]: With dead ends: 66831 [2020-10-22 00:54:58,754 INFO L226 Difference]: Without dead ends: 66807 [2020-10-22 00:54:58,754 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-22 00:54:59,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66807 states. [2020-10-22 00:55:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66807 to 28673. [2020-10-22 00:55:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28673 states. [2020-10-22 00:55:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28673 states to 28673 states and 152375 transitions. [2020-10-22 00:55:00,492 INFO L78 Accepts]: Start accepts. Automaton has 28673 states and 152375 transitions. Word has length 19 [2020-10-22 00:55:00,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:55:00,492 INFO L481 AbstractCegarLoop]: Abstraction has 28673 states and 152375 transitions. [2020-10-22 00:55:00,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:55:00,493 INFO L276 IsEmpty]: Start isEmpty. Operand 28673 states and 152375 transitions. [2020-10-22 00:55:00,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 00:55:00,493 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:55:00,493 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:55:00,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2020-10-22 00:55:00,709 INFO L429 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-22 00:55:00,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:55:00,709 INFO L82 PathProgramCache]: Analyzing trace with hash -30740687, now seen corresponding path program 1 times [2020-10-22 00:55:00,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:55:00,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335972301] [2020-10-22 00:55:00,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:55:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:55:00,760 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-22 00:55:00,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335972301] [2020-10-22 00:55:00,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252346616] [2020-10-22 00:55:00,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:55:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:55:00,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-22 00:55:00,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:55:00,926 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-22 00:55:00,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:55:00,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-22 00:55:00,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1253191992] [2020-10-22 00:55:00,927 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:55:00,929 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:55:00,933 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 35 transitions. [2020-10-22 00:55:00,933 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:55:01,021 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [674536#(<= (+ thr2Thread2of6ForFork0_~t~0 20) ~n~0), 674537#(<= (+ ~x~0 20) ~n~0)] [2020-10-22 00:55:01,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:55:01,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:55:01,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:55:01,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:55:01,022 INFO L87 Difference]: Start difference. First operand 28673 states and 152375 transitions. Second operand 9 states. [2020-10-22 00:55:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:55:02,188 INFO L93 Difference]: Finished difference Result 69484 states and 328264 transitions. [2020-10-22 00:55:02,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:55:02,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-22 00:55:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:55:02,422 INFO L225 Difference]: With dead ends: 69484 [2020-10-22 00:55:02,423 INFO L226 Difference]: Without dead ends: 69451 [2020-10-22 00:55:02,423 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-22 00:55:03,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69451 states. [2020-10-22 00:55:04,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69451 to 28873. [2020-10-22 00:55:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28873 states. [2020-10-22 00:55:04,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28873 states to 28873 states and 153454 transitions. [2020-10-22 00:55:04,186 INFO L78 Accepts]: Start accepts. Automaton has 28873 states and 153454 transitions. Word has length 19 [2020-10-22 00:55:04,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:55:04,186 INFO L481 AbstractCegarLoop]: Abstraction has 28873 states and 153454 transitions. [2020-10-22 00:55:04,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:55:04,187 INFO L276 IsEmpty]: Start isEmpty. Operand 28873 states and 153454 transitions. [2020-10-22 00:55:04,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 00:55:04,187 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:55:04,187 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:55:04,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:55:04,388 INFO L429 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-22 00:55:04,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:55:04,389 INFO L82 PathProgramCache]: Analyzing trace with hash 973992033, now seen corresponding path program 2 times [2020-10-22 00:55:04,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:55:04,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84326920] [2020-10-22 00:55:04,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:55:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:55:04,438 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-22 00:55:04,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84326920] [2020-10-22 00:55:04,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:55:04,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:55:04,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1814942610] [2020-10-22 00:55:04,439 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:55:04,440 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:55:04,442 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 19 transitions. [2020-10-22 00:55:04,442 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:55:04,443 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:55:04,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:55:04,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:55:04,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:55:04,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:55:04,443 INFO L87 Difference]: Start difference. First operand 28873 states and 153454 transitions. Second operand 7 states. [2020-10-22 00:55:05,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:55:05,191 INFO L93 Difference]: Finished difference Result 70510 states and 333491 transitions. [2020-10-22 00:55:05,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:55:05,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-22 00:55:05,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:55:05,417 INFO L225 Difference]: With dead ends: 70510 [2020-10-22 00:55:05,417 INFO L226 Difference]: Without dead ends: 70477 [2020-10-22 00:55:05,417 INFO L677 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-22 00:55:06,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70477 states. [2020-10-22 00:55:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70477 to 28942. [2020-10-22 00:55:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28942 states. [2020-10-22 00:55:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28942 states to 28942 states and 153921 transitions. [2020-10-22 00:55:07,730 INFO L78 Accepts]: Start accepts. Automaton has 28942 states and 153921 transitions. Word has length 19 [2020-10-22 00:55:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:55:07,731 INFO L481 AbstractCegarLoop]: Abstraction has 28942 states and 153921 transitions. [2020-10-22 00:55:07,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:55:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 28942 states and 153921 transitions. [2020-10-22 00:55:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 00:55:07,732 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:55:07,732 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:55:07,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2020-10-22 00:55:07,732 INFO L429 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-22 00:55:07,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:55:07,732 INFO L82 PathProgramCache]: Analyzing trace with hash 973976719, now seen corresponding path program 2 times [2020-10-22 00:55:07,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:55:07,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210365275] [2020-10-22 00:55:07,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:55:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:55:07,787 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-22 00:55:07,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210365275] [2020-10-22 00:55:07,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:55:07,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:55:07,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [271913449] [2020-10-22 00:55:07,788 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:55:07,789 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:55:07,791 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 19 transitions. [2020-10-22 00:55:07,791 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:55:07,792 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:55:07,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:55:07,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:55:07,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:55:07,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:55:07,792 INFO L87 Difference]: Start difference. First operand 28942 states and 153921 transitions. Second operand 7 states. [2020-10-22 00:55:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:55:08,548 INFO L93 Difference]: Finished difference Result 70096 states and 331298 transitions. [2020-10-22 00:55:08,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:55:08,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-22 00:55:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:55:08,788 INFO L225 Difference]: With dead ends: 70096 [2020-10-22 00:55:08,788 INFO L226 Difference]: Without dead ends: 70063 [2020-10-22 00:55:08,788 INFO L677 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-22 00:55:09,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70063 states. [2020-10-22 00:55:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70063 to 29094. [2020-10-22 00:55:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29094 states. [2020-10-22 00:55:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29094 states to 29094 states and 154883 transitions. [2020-10-22 00:55:11,355 INFO L78 Accepts]: Start accepts. Automaton has 29094 states and 154883 transitions. Word has length 19 [2020-10-22 00:55:11,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:55:11,355 INFO L481 AbstractCegarLoop]: Abstraction has 29094 states and 154883 transitions. [2020-10-22 00:55:11,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:55:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 29094 states and 154883 transitions. [2020-10-22 00:55:11,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:55:11,356 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:55:11,356 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:55:11,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2020-10-22 00:55:11,356 INFO L429 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-22 00:55:11,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:55:11,357 INFO L82 PathProgramCache]: Analyzing trace with hash -223741824, now seen corresponding path program 1 times [2020-10-22 00:55:11,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:55:11,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311354917] [2020-10-22 00:55:11,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:55:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:55:11,427 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-22 00:55:11,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311354917] [2020-10-22 00:55:11,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137407938] [2020-10-22 00:55:11,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:55:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:55:11,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:55:11,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:55:11,641 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-22 00:55:11,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:55:11,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:55:11,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [908931651] [2020-10-22 00:55:11,643 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:55:11,645 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:55:11,651 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 69 transitions. [2020-10-22 00:55:11,652 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:55:11,882 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1058584#(<= (+ thr2Thread1of6ForFork0_~t~0 20) ~n~0), 1058585#(<= (+ ~x~0 20) ~n~0)] [2020-10-22 00:55:11,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:55:11,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:55:11,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:55:11,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:55:11,884 INFO L87 Difference]: Start difference. First operand 29094 states and 154883 transitions. Second operand 11 states. [2020-10-22 00:55:13,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:55:13,487 INFO L93 Difference]: Finished difference Result 100731 states and 448596 transitions. [2020-10-22 00:55:13,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:55:13,488 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-22 00:55:13,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:55:13,819 INFO L225 Difference]: With dead ends: 100731 [2020-10-22 00:55:13,819 INFO L226 Difference]: Without dead ends: 100715 [2020-10-22 00:55:13,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:55:14,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100715 states. [2020-10-22 00:55:18,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100715 to 28719. [2020-10-22 00:55:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28719 states. [2020-10-22 00:55:19,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28719 states to 28719 states and 152760 transitions. [2020-10-22 00:55:19,076 INFO L78 Accepts]: Start accepts. Automaton has 28719 states and 152760 transitions. Word has length 21 [2020-10-22 00:55:19,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:55:19,076 INFO L481 AbstractCegarLoop]: Abstraction has 28719 states and 152760 transitions. [2020-10-22 00:55:19,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:55:19,076 INFO L276 IsEmpty]: Start isEmpty. Operand 28719 states and 152760 transitions. [2020-10-22 00:55:19,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:55:19,077 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:55:19,077 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:55:19,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:55:19,278 INFO L429 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-22 00:55:19,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:55:19,279 INFO L82 PathProgramCache]: Analyzing trace with hash 780975582, now seen corresponding path program 2 times [2020-10-22 00:55:19,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:55:19,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13667040] [2020-10-22 00:55:19,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:55:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:55:19,352 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-22 00:55:19,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13667040] [2020-10-22 00:55:19,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443354780] [2020-10-22 00:55:19,353 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 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-22 00:55:19,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-22 00:55:19,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-22 00:55:19,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:55:19,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:55:19,560 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-22 00:55:19,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:55:19,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:55:19,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1398882683] [2020-10-22 00:55:19,561 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:55:19,562 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:55:19,568 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 53 transitions. [2020-10-22 00:55:19,568 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:55:19,732 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1216878#(<= (+ ~x~0 20) ~n~0), 1216877#(<= (+ thr2Thread1of6ForFork0_~t~0 20) ~n~0)] [2020-10-22 00:55:19,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:55:19,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:55:19,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:55:19,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:55:19,734 INFO L87 Difference]: Start difference. First operand 28719 states and 152760 transitions. Second operand 11 states. [2020-10-22 00:55:21,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:55:21,389 INFO L93 Difference]: Finished difference Result 99876 states and 444348 transitions. [2020-10-22 00:55:21,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:55:21,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-22 00:55:21,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:55:21,738 INFO L225 Difference]: With dead ends: 99876 [2020-10-22 00:55:21,738 INFO L226 Difference]: Without dead ends: 99855 [2020-10-22 00:55:21,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:55:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99855 states. [2020-10-22 00:55:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99855 to 28343. [2020-10-22 00:55:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28343 states. [2020-10-22 00:55:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28343 states to 28343 states and 150639 transitions. [2020-10-22 00:55:24,656 INFO L78 Accepts]: Start accepts. Automaton has 28343 states and 150639 transitions. Word has length 21 [2020-10-22 00:55:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:55:24,657 INFO L481 AbstractCegarLoop]: Abstraction has 28343 states and 150639 transitions. [2020-10-22 00:55:24,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:55:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 28343 states and 150639 transitions. [2020-10-22 00:55:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:55:24,658 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:55:24,658 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:55:24,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2020-10-22 00:55:24,859 INFO L429 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-22 00:55:24,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:55:24,859 INFO L82 PathProgramCache]: Analyzing trace with hash -141594176, now seen corresponding path program 3 times [2020-10-22 00:55:24,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:55:24,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244662550] [2020-10-22 00:55:24,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:55:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:55:24,928 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-22 00:55:24,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244662550] [2020-10-22 00:55:24,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257853869] [2020-10-22 00:55:24,929 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 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-22 00:55:25,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-22 00:55:25,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-22 00:55:25,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:55:25,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:55:25,150 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-22 00:55:25,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:55:25,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:55:25,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [276936419] [2020-10-22 00:55:25,151 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:55:25,153 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:55:25,159 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 53 transitions. [2020-10-22 00:55:25,159 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:55:25,305 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1373564#(<= (+ ~x~0 20) ~n~0), 1373563#(<= (+ thr2Thread2of6ForFork0_~t~0 20) ~n~0)] [2020-10-22 00:55:25,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:55:25,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:55:25,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:55:25,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:55:25,306 INFO L87 Difference]: Start difference. First operand 28343 states and 150639 transitions. Second operand 11 states. [2020-10-22 00:55:26,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:55:26,959 INFO L93 Difference]: Finished difference Result 100071 states and 445291 transitions. [2020-10-22 00:55:26,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:55:26,959 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-22 00:55:26,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:55:27,275 INFO L225 Difference]: With dead ends: 100071 [2020-10-22 00:55:27,275 INFO L226 Difference]: Without dead ends: 100055 [2020-10-22 00:55:27,276 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:55:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100055 states. [2020-10-22 00:55:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100055 to 27654. [2020-10-22 00:55:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27654 states. [2020-10-22 00:55:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27654 states to 27654 states and 147080 transitions. [2020-10-22 00:55:32,151 INFO L78 Accepts]: Start accepts. Automaton has 27654 states and 147080 transitions. Word has length 21 [2020-10-22 00:55:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:55:32,151 INFO L481 AbstractCegarLoop]: Abstraction has 27654 states and 147080 transitions. [2020-10-22 00:55:32,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:55:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 27654 states and 147080 transitions. [2020-10-22 00:55:32,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:55:32,152 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:55:32,152 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:55:32,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:55:32,353 INFO L429 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-22 00:55:32,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:55:32,353 INFO L82 PathProgramCache]: Analyzing trace with hash 522984322, now seen corresponding path program 4 times [2020-10-22 00:55:32,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:55:32,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930483456] [2020-10-22 00:55:32,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:55:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:55:32,423 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-22 00:55:32,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930483456] [2020-10-22 00:55:32,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403886121] [2020-10-22 00:55:32,424 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 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-22 00:55:32,515 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-22 00:55:32,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-22 00:55:32,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:55:32,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:55:32,628 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-22 00:55:32,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:55:32,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:55:32,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [506918727] [2020-10-22 00:55:32,629 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:55:32,630 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:55:32,634 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 37 transitions. [2020-10-22 00:55:32,635 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:55:32,722 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1529067#(<= (+ ~x~0 20) ~n~0), 1529066#(<= (+ thr2Thread2of6ForFork0_~t~0 20) ~n~0)] [2020-10-22 00:55:32,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:55:32,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:55:32,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:55:32,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:55:32,722 INFO L87 Difference]: Start difference. First operand 27654 states and 147080 transitions. Second operand 11 states. [2020-10-22 00:55:34,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:55:34,278 INFO L93 Difference]: Finished difference Result 99523 states and 442763 transitions. [2020-10-22 00:55:34,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:55:34,279 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-22 00:55:34,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:55:34,617 INFO L225 Difference]: With dead ends: 99523 [2020-10-22 00:55:34,617 INFO L226 Difference]: Without dead ends: 99502 [2020-10-22 00:55:34,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:55:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99502 states. [2020-10-22 00:55:37,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99502 to 27278. [2020-10-22 00:55:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27278 states. [2020-10-22 00:55:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27278 states to 27278 states and 144959 transitions. [2020-10-22 00:55:37,347 INFO L78 Accepts]: Start accepts. Automaton has 27278 states and 144959 transitions. Word has length 21 [2020-10-22 00:55:37,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:55:37,347 INFO L481 AbstractCegarLoop]: Abstraction has 27278 states and 144959 transitions. [2020-10-22 00:55:37,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:55:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 27278 states and 144959 transitions. [2020-10-22 00:55:37,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:55:37,348 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:55:37,348 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:55:37,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2020-10-22 00:55:37,549 INFO L429 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-22 00:55:37,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:55:37,550 INFO L82 PathProgramCache]: Analyzing trace with hash -456681683, now seen corresponding path program 1 times [2020-10-22 00:55:37,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:55:37,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468637797] [2020-10-22 00:55:37,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:55:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:55:37,583 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-22 00:55:37,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468637797] [2020-10-22 00:55:37,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:55:37,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:55:37,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [622085582] [2020-10-22 00:55:37,584 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:55:37,586 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:55:37,588 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-22 00:55:37,588 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:55:37,588 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:55:37,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:55:37,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:55:37,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:55:37,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:55:37,589 INFO L87 Difference]: Start difference. First operand 27278 states and 144959 transitions. Second operand 5 states. [2020-10-22 00:55:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:55:38,009 INFO L93 Difference]: Finished difference Result 48996 states and 248701 transitions. [2020-10-22 00:55:38,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:55:38,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-22 00:55:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:55:38,159 INFO L225 Difference]: With dead ends: 48996 [2020-10-22 00:55:38,159 INFO L226 Difference]: Without dead ends: 48950 [2020-10-22 00:55:38,159 INFO L677 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-22 00:55:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48950 states. [2020-10-22 00:55:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48950 to 33977. [2020-10-22 00:55:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33977 states. [2020-10-22 00:55:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33977 states to 33977 states and 181757 transitions. [2020-10-22 00:55:41,713 INFO L78 Accepts]: Start accepts. Automaton has 33977 states and 181757 transitions. Word has length 21 [2020-10-22 00:55:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:55:41,714 INFO L481 AbstractCegarLoop]: Abstraction has 33977 states and 181757 transitions. [2020-10-22 00:55:41,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:55:41,714 INFO L276 IsEmpty]: Start isEmpty. Operand 33977 states and 181757 transitions. [2020-10-22 00:55:41,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:55:41,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:55:41,715 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:55:41,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2020-10-22 00:55:41,715 INFO L429 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-22 00:55:41,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:55:41,715 INFO L82 PathProgramCache]: Analyzing trace with hash -296528672, now seen corresponding path program 5 times [2020-10-22 00:55:41,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:55:41,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95483063] [2020-10-22 00:55:41,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:55:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:55:41,786 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-22 00:55:41,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95483063] [2020-10-22 00:55:41,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:55:41,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:55:41,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1751865638] [2020-10-22 00:55:41,787 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:55:41,789 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:55:41,792 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-22 00:55:41,792 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:55:41,793 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:55:41,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:55:41,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:55:41,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:55:41,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:55:41,793 INFO L87 Difference]: Start difference. First operand 33977 states and 181757 transitions. Second operand 9 states. [2020-10-22 00:55:43,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:55:43,371 INFO L93 Difference]: Finished difference Result 115584 states and 523727 transitions. [2020-10-22 00:55:43,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:55:43,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-22 00:55:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:55:43,720 INFO L225 Difference]: With dead ends: 115584 [2020-10-22 00:55:43,720 INFO L226 Difference]: Without dead ends: 115559 [2020-10-22 00:55:43,720 INFO L677 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-22 00:55:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115559 states. [2020-10-22 00:55:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115559 to 33074. [2020-10-22 00:55:46,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33074 states. [2020-10-22 00:55:46,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33074 states to 33074 states and 176935 transitions. [2020-10-22 00:55:46,957 INFO L78 Accepts]: Start accepts. Automaton has 33074 states and 176935 transitions. Word has length 21 [2020-10-22 00:55:46,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:55:46,958 INFO L481 AbstractCegarLoop]: Abstraction has 33074 states and 176935 transitions. [2020-10-22 00:55:46,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:55:46,958 INFO L276 IsEmpty]: Start isEmpty. Operand 33074 states and 176935 transitions. [2020-10-22 00:55:46,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:55:46,959 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:55:46,959 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:55:46,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2020-10-22 00:55:46,959 INFO L429 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-22 00:55:46,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:55:46,959 INFO L82 PathProgramCache]: Analyzing trace with hash -311230112, now seen corresponding path program 6 times [2020-10-22 00:55:46,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:55:46,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237215128] [2020-10-22 00:55:46,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:55:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:55:47,031 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-22 00:55:47,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237215128] [2020-10-22 00:55:47,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:55:47,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:55:47,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [971186619] [2020-10-22 00:55:47,033 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:55:47,035 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:55:47,039 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-22 00:55:47,039 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:55:47,039 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:55:47,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:55:47,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:55:47,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:55:47,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:55:47,040 INFO L87 Difference]: Start difference. First operand 33074 states and 176935 transitions. Second operand 9 states. [2020-10-22 00:55:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:55:50,905 INFO L93 Difference]: Finished difference Result 114402 states and 517732 transitions. [2020-10-22 00:55:50,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:55:50,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-22 00:55:50,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:55:51,274 INFO L225 Difference]: With dead ends: 114402 [2020-10-22 00:55:51,275 INFO L226 Difference]: Without dead ends: 114371 [2020-10-22 00:55:51,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-22 00:55:52,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114371 states. [2020-10-22 00:55:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114371 to 31960. [2020-10-22 00:55:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31960 states. [2020-10-22 00:55:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31960 states to 31960 states and 171209 transitions. [2020-10-22 00:55:54,356 INFO L78 Accepts]: Start accepts. Automaton has 31960 states and 171209 transitions. Word has length 21 [2020-10-22 00:55:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:55:54,356 INFO L481 AbstractCegarLoop]: Abstraction has 31960 states and 171209 transitions. [2020-10-22 00:55:54,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:55:54,356 INFO L276 IsEmpty]: Start isEmpty. Operand 31960 states and 171209 transitions. [2020-10-22 00:55:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 00:55:54,357 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:55:54,357 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:55:54,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2020-10-22 00:55:54,358 INFO L429 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-22 00:55:54,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:55:54,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1247180612, now seen corresponding path program 1 times [2020-10-22 00:55:54,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:55:54,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377262008] [2020-10-22 00:55:54,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:55:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:55:54,412 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-22 00:55:54,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377262008] [2020-10-22 00:55:54,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324349566] [2020-10-22 00:55:54,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:55:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:55:54,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-22 00:55:54,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:55:54,577 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-22 00:55:54,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:55:54,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-22 00:55:54,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1213709530] [2020-10-22 00:55:54,578 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:55:54,579 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:55:54,586 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 71 transitions. [2020-10-22 00:55:54,586 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:55:54,835 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2160394#(<= (+ thr2Thread1of6ForFork0_~t~0 20) ~n~0), 2160395#(<= (+ ~x~0 20) ~n~0)] [2020-10-22 00:55:54,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:55:54,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:55:54,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:55:54,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:55:54,836 INFO L87 Difference]: Start difference. First operand 31960 states and 171209 transitions. Second operand 9 states. [2020-10-22 00:55:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:55:55,679 INFO L93 Difference]: Finished difference Result 75380 states and 361389 transitions. [2020-10-22 00:55:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:55:55,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-22 00:55:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:55:55,939 INFO L225 Difference]: With dead ends: 75380 [2020-10-22 00:55:55,940 INFO L226 Difference]: Without dead ends: 75344 [2020-10-22 00:55:55,940 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-22 00:55:56,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75344 states. [2020-10-22 00:55:57,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75344 to 32974. [2020-10-22 00:55:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32974 states. [2020-10-22 00:56:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32974 states to 32974 states and 176363 transitions. [2020-10-22 00:56:01,125 INFO L78 Accepts]: Start accepts. Automaton has 32974 states and 176363 transitions. Word has length 23 [2020-10-22 00:56:01,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:56:01,125 INFO L481 AbstractCegarLoop]: Abstraction has 32974 states and 176363 transitions. [2020-10-22 00:56:01,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:56:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 32974 states and 176363 transitions. [2020-10-22 00:56:01,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 00:56:01,127 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:56:01,127 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:56:01,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:56:01,328 INFO L429 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-22 00:56:01,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:56:01,329 INFO L82 PathProgramCache]: Analyzing trace with hash -83395058, now seen corresponding path program 1 times [2020-10-22 00:56:01,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:56:01,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88307540] [2020-10-22 00:56:01,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:56:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:56:01,378 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-22 00:56:01,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88307540] [2020-10-22 00:56:01,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905374563] [2020-10-22 00:56:01,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:56:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:56:01,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-22 00:56:01,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:56:01,543 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-22 00:56:01,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:56:01,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-22 00:56:01,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2088809400] [2020-10-22 00:56:01,545 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:56:01,546 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:56:01,552 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 55 transitions. [2020-10-22 00:56:01,552 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:56:01,710 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2301819#(<= (+ ~x~0 20) ~n~0), 2301818#(<= (+ thr2Thread2of6ForFork0_~t~0 20) ~n~0)] [2020-10-22 00:56:01,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:56:01,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:56:01,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:56:01,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:56:01,712 INFO L87 Difference]: Start difference. First operand 32974 states and 176363 transitions. Second operand 9 states. [2020-10-22 00:56:02,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:56:02,548 INFO L93 Difference]: Finished difference Result 79487 states and 381757 transitions. [2020-10-22 00:56:02,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:56:02,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-22 00:56:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:56:02,810 INFO L225 Difference]: With dead ends: 79487 [2020-10-22 00:56:02,810 INFO L226 Difference]: Without dead ends: 79445 [2020-10-22 00:56:02,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-22 00:56:03,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79445 states. [2020-10-22 00:56:05,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79445 to 33981. [2020-10-22 00:56:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33981 states. [2020-10-22 00:56:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33981 states to 33981 states and 181710 transitions. [2020-10-22 00:56:05,494 INFO L78 Accepts]: Start accepts. Automaton has 33981 states and 181710 transitions. Word has length 23 [2020-10-22 00:56:05,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:56:05,494 INFO L481 AbstractCegarLoop]: Abstraction has 33981 states and 181710 transitions. [2020-10-22 00:56:05,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:56:05,494 INFO L276 IsEmpty]: Start isEmpty. Operand 33981 states and 181710 transitions. [2020-10-22 00:56:05,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 00:56:05,496 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:56:05,496 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:56:05,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:56:05,697 INFO L429 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-22 00:56:05,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:56:05,697 INFO L82 PathProgramCache]: Analyzing trace with hash 859803225, now seen corresponding path program 1 times [2020-10-22 00:56:05,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:56:05,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247325959] [2020-10-22 00:56:05,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:56:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:56:05,749 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-22 00:56:05,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247325959] [2020-10-22 00:56:05,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920347369] [2020-10-22 00:56:05,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:56:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:56:05,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-22 00:56:05,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:56:05,927 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-22 00:56:05,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:56:05,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-22 00:56:05,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [539628245] [2020-10-22 00:56:05,928 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:56:05,931 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:56:05,935 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 39 transitions. [2020-10-22 00:56:05,936 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:56:06,026 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2449364#(<= (+ ~x~0 20) ~n~0), 2449363#(<= (+ thr2Thread3of6ForFork0_~t~0 20) ~n~0)] [2020-10-22 00:56:06,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 00:56:06,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:56:06,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 00:56:06,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:56:06,027 INFO L87 Difference]: Start difference. First operand 33981 states and 181710 transitions. Second operand 9 states. [2020-10-22 00:56:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:56:06,938 INFO L93 Difference]: Finished difference Result 82728 states and 398553 transitions. [2020-10-22 00:56:06,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:56:06,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-22 00:56:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:56:07,245 INFO L225 Difference]: With dead ends: 82728 [2020-10-22 00:56:07,245 INFO L226 Difference]: Without dead ends: 82673 [2020-10-22 00:56:07,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-22 00:56:08,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82673 states. [2020-10-22 00:56:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82673 to 34821. [2020-10-22 00:56:10,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34821 states. [2020-10-22 00:56:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 186422 transitions. [2020-10-22 00:56:10,170 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 186422 transitions. Word has length 23 [2020-10-22 00:56:10,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:56:10,171 INFO L481 AbstractCegarLoop]: Abstraction has 34821 states and 186422 transitions. [2020-10-22 00:56:10,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 00:56:10,171 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 186422 transitions. [2020-10-22 00:56:10,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 00:56:10,173 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:56:10,173 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:56:10,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:56:10,383 INFO L429 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-22 00:56:10,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:56:10,383 INFO L82 PathProgramCache]: Analyzing trace with hash -784422783, now seen corresponding path program 2 times [2020-10-22 00:56:10,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:56:10,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125366277] [2020-10-22 00:56:10,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:56:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:56:10,434 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-22 00:56:10,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125366277] [2020-10-22 00:56:10,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:56:10,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:56:10,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [255352592] [2020-10-22 00:56:10,435 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:56:10,437 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:56:10,442 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 23 transitions. [2020-10-22 00:56:10,442 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:56:10,443 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:56:10,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:56:10,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:56:10,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:56:10,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:56:10,444 INFO L87 Difference]: Start difference. First operand 34821 states and 186422 transitions. Second operand 7 states. [2020-10-22 00:56:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:56:11,306 INFO L93 Difference]: Finished difference Result 83487 states and 402661 transitions. [2020-10-22 00:56:11,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:56:11,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-22 00:56:11,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:56:11,619 INFO L225 Difference]: With dead ends: 83487 [2020-10-22 00:56:11,619 INFO L226 Difference]: Without dead ends: 83432 [2020-10-22 00:56:11,622 INFO L677 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-22 00:56:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83432 states. [2020-10-22 00:56:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83432 to 35694. [2020-10-22 00:56:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35694 states. [2020-10-22 00:56:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35694 states to 35694 states and 191145 transitions. [2020-10-22 00:56:14,616 INFO L78 Accepts]: Start accepts. Automaton has 35694 states and 191145 transitions. Word has length 23 [2020-10-22 00:56:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:56:14,617 INFO L481 AbstractCegarLoop]: Abstraction has 35694 states and 191145 transitions. [2020-10-22 00:56:14,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:56:14,617 INFO L276 IsEmpty]: Start isEmpty. Operand 35694 states and 191145 transitions. [2020-10-22 00:56:14,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 00:56:14,619 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:56:14,619 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:56:14,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2020-10-22 00:56:14,619 INFO L429 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-22 00:56:14,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:56:14,619 INFO L82 PathProgramCache]: Analyzing trace with hash -784419714, now seen corresponding path program 2 times [2020-10-22 00:56:14,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:56:14,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424015494] [2020-10-22 00:56:14,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:56:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:56:14,672 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-22 00:56:14,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424015494] [2020-10-22 00:56:14,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:56:14,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:56:14,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1798132747] [2020-10-22 00:56:14,673 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:56:14,675 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:56:14,679 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 23 transitions. [2020-10-22 00:56:14,679 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:56:14,679 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:56:14,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:56:14,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:56:14,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:56:14,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:56:14,680 INFO L87 Difference]: Start difference. First operand 35694 states and 191145 transitions. Second operand 7 states. [2020-10-22 00:56:15,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:56:15,564 INFO L93 Difference]: Finished difference Result 83543 states and 402494 transitions. [2020-10-22 00:56:15,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:56:15,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-22 00:56:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:56:15,869 INFO L225 Difference]: With dead ends: 83543 [2020-10-22 00:56:15,869 INFO L226 Difference]: Without dead ends: 83488 [2020-10-22 00:56:15,869 INFO L677 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-22 00:56:16,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83488 states. [2020-10-22 00:56:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83488 to 36306. [2020-10-22 00:56:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36306 states. [2020-10-22 00:56:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36306 states to 36306 states and 194552 transitions. [2020-10-22 00:56:21,319 INFO L78 Accepts]: Start accepts. Automaton has 36306 states and 194552 transitions. Word has length 23 [2020-10-22 00:56:21,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:56:21,319 INFO L481 AbstractCegarLoop]: Abstraction has 36306 states and 194552 transitions. [2020-10-22 00:56:21,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:56:21,319 INFO L276 IsEmpty]: Start isEmpty. Operand 36306 states and 194552 transitions. [2020-10-22 00:56:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 00:56:21,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:56:21,322 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:56:21,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2020-10-22 00:56:21,322 INFO L429 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-22 00:56:21,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:56:21,322 INFO L82 PathProgramCache]: Analyzing trace with hash -784435028, now seen corresponding path program 2 times [2020-10-22 00:56:21,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:56:21,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613399688] [2020-10-22 00:56:21,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:56:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:56:21,375 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-22 00:56:21,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613399688] [2020-10-22 00:56:21,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:56:21,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:56:21,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [874927310] [2020-10-22 00:56:21,376 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:56:21,378 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:56:21,381 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 23 transitions. [2020-10-22 00:56:21,381 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:56:21,382 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:56:21,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:56:21,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:56:21,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:56:21,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:56:21,382 INFO L87 Difference]: Start difference. First operand 36306 states and 194552 transitions. Second operand 7 states. [2020-10-22 00:56:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:56:22,294 INFO L93 Difference]: Finished difference Result 83918 states and 404136 transitions. [2020-10-22 00:56:22,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:56:22,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-22 00:56:22,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:56:22,573 INFO L225 Difference]: With dead ends: 83918 [2020-10-22 00:56:22,574 INFO L226 Difference]: Without dead ends: 83863 [2020-10-22 00:56:22,574 INFO L677 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-22 00:56:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83863 states. [2020-10-22 00:56:24,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83863 to 37062. [2020-10-22 00:56:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37062 states. [2020-10-22 00:56:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37062 states to 37062 states and 198528 transitions. [2020-10-22 00:56:25,526 INFO L78 Accepts]: Start accepts. Automaton has 37062 states and 198528 transitions. Word has length 23 [2020-10-22 00:56:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:56:25,526 INFO L481 AbstractCegarLoop]: Abstraction has 37062 states and 198528 transitions. [2020-10-22 00:56:25,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:56:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 37062 states and 198528 transitions. [2020-10-22 00:56:25,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:56:25,530 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:56:25,530 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-22 00:56:25,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2020-10-22 00:56:25,530 INFO L429 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-22 00:56:25,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:56:25,530 INFO L82 PathProgramCache]: Analyzing trace with hash 456345565, now seen corresponding path program 1 times [2020-10-22 00:56:25,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:56:25,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887532701] [2020-10-22 00:56:25,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:56:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:56:25,608 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-22 00:56:25,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887532701] [2020-10-22 00:56:25,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20790433] [2020-10-22 00:56:25,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-22 00:56:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:56:25,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:56:25,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:56:25,838 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-22 00:56:25,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:56:25,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:56:25,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1314707020] [2020-10-22 00:56:25,839 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:56:25,841 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:56:25,855 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 105 transitions. [2020-10-22 00:56:25,856 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:56:26,205 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3070980#(<= (+ thr2Thread1of6ForFork0_~t~0 20) ~n~0), 3070981#(<= (+ ~x~0 20) ~n~0)] [2020-10-22 00:56:26,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:56:26,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:56:26,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:56:26,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:56:26,206 INFO L87 Difference]: Start difference. First operand 37062 states and 198528 transitions. Second operand 11 states. [2020-10-22 00:56:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:56:28,071 INFO L93 Difference]: Finished difference Result 122892 states and 561130 transitions. [2020-10-22 00:56:28,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-22 00:56:28,072 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-22 00:56:28,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:56:28,508 INFO L225 Difference]: With dead ends: 122892 [2020-10-22 00:56:28,508 INFO L226 Difference]: Without dead ends: 122862 [2020-10-22 00:56:28,508 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:56:29,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122862 states. [2020-10-22 00:56:31,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122862 to 36727. [2020-10-22 00:56:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36727 states. [2020-10-22 00:56:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36727 states to 36727 states and 196466 transitions. [2020-10-22 00:56:32,032 INFO L78 Accepts]: Start accepts. Automaton has 36727 states and 196466 transitions. Word has length 25 [2020-10-22 00:56:32,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:56:32,032 INFO L481 AbstractCegarLoop]: Abstraction has 36727 states and 196466 transitions. [2020-10-22 00:56:32,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:56:32,032 INFO L276 IsEmpty]: Start isEmpty. Operand 36727 states and 196466 transitions. [2020-10-22 00:56:32,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 00:56:32,035 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:56:32,035 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-22 00:56:32,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2020-10-22 00:56:32,236 INFO L429 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-22 00:56:32,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:56:32,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1399543848, now seen corresponding path program 1 times [2020-10-22 00:56:32,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:56:32,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003767904] [2020-10-22 00:56:32,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:56:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:56:32,308 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-22 00:56:32,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003767904] [2020-10-22 00:56:32,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431009166] [2020-10-22 00:56:32,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:56:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:56:32,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-22 00:56:32,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-22 00:56:32,519 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-22 00:56:32,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-22 00:56:32,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-22 00:56:32,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [856281724] [2020-10-22 00:56:32,520 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:56:32,522 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:56:32,532 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 89 transitions. [2020-10-22 00:56:32,532 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider Received shutdown request... [2020-10-22 00:56:32,547 WARN L210 SmtUtils]: Removed 4 from assertion stack [2020-10-22 00:56:32,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-22 00:56:32,749 WARN L546 AbstractCegarLoop]: Verification canceled [2020-10-22 00:56:32,753 WARN L235 ceAbstractionStarter]: Timeout [2020-10-22 00:56:32,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 12:56:32 BasicIcfg [2020-10-22 00:56:32,754 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 00:56:32,755 INFO L168 Benchmark]: Toolchain (without parser) took 222146.28 ms. Allocated memory was 145.8 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 100.3 MB in the beginning and 857.6 MB in the end (delta: -757.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2020-10-22 00:56:32,755 INFO L168 Benchmark]: CDTParser took 2.56 ms. Allocated memory is still 145.8 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-22 00:56:32,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.74 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 99.5 MB in the beginning and 158.4 MB in the end (delta: -58.9 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2020-10-22 00:56:32,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.68 ms. Allocated memory is still 202.4 MB. Free memory was 157.8 MB in the beginning and 155.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-22 00:56:32,756 INFO L168 Benchmark]: Boogie Preprocessor took 29.22 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 154.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-10-22 00:56:32,757 INFO L168 Benchmark]: RCFGBuilder took 471.25 ms. Allocated memory is still 202.4 MB. Free memory was 154.4 MB in the beginning and 131.9 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2020-10-22 00:56:32,757 INFO L168 Benchmark]: TraceAbstraction took 220795.12 ms. Allocated memory was 202.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 131.2 MB in the beginning and 857.6 MB in the end (delta: -726.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2020-10-22 00:56:32,759 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.56 ms. Allocated memory is still 145.8 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.74 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 99.5 MB in the beginning and 158.4 MB in the end (delta: -58.9 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.68 ms. Allocated memory is still 202.4 MB. Free memory was 157.8 MB in the beginning and 155.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.22 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 154.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 471.25 ms. Allocated memory is still 202.4 MB. Free memory was 154.4 MB in the beginning and 131.9 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 220795.12 ms. Allocated memory was 202.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 131.2 MB in the beginning and 857.6 MB in the end (delta: -726.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 454 VarBasedMoverChecksPositive, 2 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 3 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.7s, 69 PlacesBefore, 18 PlacesAfterwards, 67 TransitionsBefore, 12 TransitionsAfterwards, 832 CoEnabledTransitionPairs, 7 FixpointIterations, 25 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 5 ConcurrentYvCompositions, 4 ChoiceCompositions, 69 TotalNumberOfCompositions, 793 MoverChecksTotal - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 655 VarBasedMoverChecksPositive, 10 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 25 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.4s, 92 PlacesBefore, 31 PlacesAfterwards, 88 TransitionsBefore, 21 TransitionsAfterwards, 1220 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 6 ConcurrentYvCompositions, 6 ChoiceCompositions, 86 TotalNumberOfCompositions, 1551 MoverChecksTotal - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 863 VarBasedMoverChecksPositive, 15 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 41 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.7s, 115 PlacesBefore, 41 PlacesAfterwards, 109 TransitionsBefore, 27 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 6 FixpointIterations, 55 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 107 TotalNumberOfCompositions, 2216 MoverChecksTotal - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1161 VarBasedMoverChecksPositive, 21 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 64 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.6s, 138 PlacesBefore, 51 PlacesAfterwards, 130 TransitionsBefore, 33 TransitionsAfterwards, 2176 CoEnabledTransitionPairs, 6 FixpointIterations, 70 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 5 ConcurrentYvCompositions, 10 ChoiceCompositions, 134 TotalNumberOfCompositions, 3275 MoverChecksTotal - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1421 VarBasedMoverChecksPositive, 23 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 82 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.3s, 161 PlacesBefore, 61 PlacesAfterwards, 151 TransitionsBefore, 39 TransitionsAfterwards, 2744 CoEnabledTransitionPairs, 6 FixpointIterations, 89 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 17 TrivialYvCompositions, 6 ConcurrentYvCompositions, 12 ChoiceCompositions, 162 TotalNumberOfCompositions, 4200 MoverChecksTotal - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1751 VarBasedMoverChecksPositive, 28 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 95 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.8s, 184 PlacesBefore, 71 PlacesAfterwards, 172 TransitionsBefore, 45 TransitionsAfterwards, 3372 CoEnabledTransitionPairs, 6 FixpointIterations, 109 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 6 ConcurrentYvCompositions, 14 ChoiceCompositions, 191 TotalNumberOfCompositions, 5911 MoverChecksTotal - TimeoutResultAtElement [Line: 683]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 683). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 4,while SimplifyDDAWithTimeout was simplifying term of DAG size 18 for 12ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 63 locations, 1 error locations. Started 6 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 220.3s, OverallIterations: 100, TraceHistogramMax: 6, AutomataDifference: 79.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 19.9s, HoareTripleCheckerStatistics: 4231 SDtfs, 17376 SDslu, 12641 SDs, 0 SdLazy, 24619 SolverSat, 1544 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2912 GetRequests, 973 SyntacticMatches, 80 SemanticMatches, 1859 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12569 ImplicationChecksByTransitivity, 25.0s 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: 92.8s AutomataMinimizationTime, 94 MinimizatonAttempts, 1775553 StatesRemovedByMinimization, 87 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 2485 NumberOfCodeBlocks, 2473 NumberOfCodeBlocksAsserted, 138 NumberOfCheckSat, 2274 ConstructedInterpolants, 0 QuantifiedInterpolants, 302740 SizeOfPredicates, 150 NumberOfNonLiveVariables, 3646 ConjunctsInSsa, 237 ConjunctsInUnsatCore, 123 InterpolantComputations, 65 PerfectInterpolantSequences, 854/1296 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