/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 12:20:39,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 12:20:39,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 12:20:39,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 12:20:39,395 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 12:20:39,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 12:20:39,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 12:20:39,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 12:20:39,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 12:20:39,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 12:20:39,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 12:20:39,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 12:20:39,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 12:20:39,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 12:20:39,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 12:20:39,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 12:20:39,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 12:20:39,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 12:20:39,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 12:20:39,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 12:20:39,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 12:20:39,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 12:20:39,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 12:20:39,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 12:20:39,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 12:20:39,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 12:20:39,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 12:20:39,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 12:20:39,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 12:20:39,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 12:20:39,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 12:20:39,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 12:20:39,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 12:20:39,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 12:20:39,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 12:20:39,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 12:20:39,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 12:20:39,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 12:20:39,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 12:20:39,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 12:20:39,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 12:20:39,443 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 12:20:39,480 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 12:20:39,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 12:20:39,480 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 12:20:39,480 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 12:20:39,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 12:20:39,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 12:20:39,486 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 12:20:39,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 12:20:39,487 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 12:20:39,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 12:20:39,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 12:20:39,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 12:20:39,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 12:20:39,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 12:20:39,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 12:20:39,488 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 12:20:39,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 12:20:39,488 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 12:20:39,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 12:20:39,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 12:20:39,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 12:20:39,489 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 12:20:39,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 12:20:39,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 12:20:39,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 12:20:39,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 12:20:39,490 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 12:20:39,490 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 12:20:39,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 12:20:39,490 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 12:20:39,490 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 12:20:39,490 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 12:20:39,491 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 12:20:39,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 12:20:39,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 12:20:39,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 12:20:39,815 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 12:20:39,816 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 12:20:39,817 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2021-06-05 12:20:39,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ffd24cf0/10057250e0fe47ae8248d7c0c0faeb69/FLAG47f199ef9 [2021-06-05 12:20:40,354 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 12:20:40,355 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2021-06-05 12:20:40,373 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ffd24cf0/10057250e0fe47ae8248d7c0c0faeb69/FLAG47f199ef9 [2021-06-05 12:20:40,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ffd24cf0/10057250e0fe47ae8248d7c0c0faeb69 [2021-06-05 12:20:40,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 12:20:40,852 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 12:20:40,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 12:20:40,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 12:20:40,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 12:20:40,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:20:40" (1/1) ... [2021-06-05 12:20:40,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599920ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:20:40, skipping insertion in model container [2021-06-05 12:20:40,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:20:40" (1/1) ... [2021-06-05 12:20:40,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 12:20:40,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 12:20:41,250 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41060,41073] [2021-06-05 12:20:41,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:20:41,297 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 12:20:41,334 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41060,41073] [2021-06-05 12:20:41,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:20:41,481 INFO L208 MainTranslator]: Completed translation [2021-06-05 12:20:41,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:20:41 WrapperNode [2021-06-05 12:20:41,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 12:20:41,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 12:20:41,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 12:20:41,482 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 12:20:41,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:20:41" (1/1) ... [2021-06-05 12:20:41,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:20:41" (1/1) ... [2021-06-05 12:20:41,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 12:20:41,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 12:20:41,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 12:20:41,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 12:20:41,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:20:41" (1/1) ... [2021-06-05 12:20:41,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:20:41" (1/1) ... [2021-06-05 12:20:41,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:20:41" (1/1) ... [2021-06-05 12:20:41,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:20:41" (1/1) ... [2021-06-05 12:20:41,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:20:41" (1/1) ... [2021-06-05 12:20:41,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:20:41" (1/1) ... [2021-06-05 12:20:41,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:20:41" (1/1) ... [2021-06-05 12:20:41,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 12:20:41,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 12:20:41,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 12:20:41,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 12:20:41,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:20:41" (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 [2021-06-05 12:20:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 12:20:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 12:20:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 12:20:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 12:20:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-05 12:20:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-06-05 12:20:41,650 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-06-05 12:20:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 12:20:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 12:20:41,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 12:20:41,652 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 12:20:42,261 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 12:20:42,261 INFO L299 CfgBuilder]: Removed 35 assume(true) statements. [2021-06-05 12:20:42,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:20:42 BoogieIcfgContainer [2021-06-05 12:20:42,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 12:20:42,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 12:20:42,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 12:20:42,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 12:20:42,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 12:20:40" (1/3) ... [2021-06-05 12:20:42,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@883562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:20:42, skipping insertion in model container [2021-06-05 12:20:42,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:20:41" (2/3) ... [2021-06-05 12:20:42,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@883562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:20:42, skipping insertion in model container [2021-06-05 12:20:42,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:20:42" (3/3) ... [2021-06-05 12:20:42,270 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2021-06-05 12:20:42,275 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 12:20:42,275 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 12:20:42,275 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 12:20:42,276 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 12:20:42,323 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,324 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,324 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,324 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,324 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,324 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,325 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,325 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,325 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,325 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,325 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,325 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,326 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,326 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,326 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,326 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,326 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,326 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,326 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,327 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,327 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,327 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,327 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,327 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,328 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,328 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,328 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,329 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,330 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,330 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,331 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,331 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,331 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,331 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,332 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,332 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,332 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,332 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,332 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,333 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,333 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,333 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,334 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,334 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,335 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,335 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,335 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,335 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,335 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,335 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,335 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,336 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,336 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,336 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,336 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,336 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,337 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,337 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,337 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,337 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,338 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,338 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,338 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,338 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,338 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,339 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,339 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,339 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,339 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,339 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,339 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,339 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,340 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,340 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,341 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,341 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,341 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,342 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,342 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,342 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,343 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,343 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,344 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,344 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,345 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,345 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,345 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,345 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,346 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,346 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,346 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,346 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,346 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,347 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,347 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,347 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,347 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,347 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,348 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,349 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,351 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,351 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,351 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,352 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,357 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,357 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,357 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,358 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,358 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,359 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,359 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,359 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,359 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,359 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,359 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,359 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,360 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,360 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,360 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,360 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,360 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,360 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,360 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,361 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,361 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,361 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,361 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,361 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,361 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,361 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,361 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,362 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,362 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,362 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,362 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,362 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,362 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,362 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,363 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,363 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,363 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,363 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,363 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,363 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,364 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,364 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,366 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,367 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,367 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,367 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,367 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,367 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,367 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,368 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,369 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,369 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,369 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,370 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,378 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,378 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,378 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,379 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,379 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,379 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,379 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,379 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,381 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:42,388 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-06-05 12:20:42,410 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 12:20:42,423 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:20:42,423 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:20:42,424 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:20:42,424 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:20:42,424 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:20:42,424 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:20:42,424 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:20:42,424 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 12:20:42,434 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158 places, 186 transitions, 380 flow [2021-06-05 12:20:42,566 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3627 states, 3617 states have (on average 2.395355266795687) internal successors, (8664), 3626 states have internal predecessors, (8664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 3627 states, 3617 states have (on average 2.395355266795687) internal successors, (8664), 3626 states have internal predecessors, (8664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:20:42,592 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:42,593 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:42,593 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:42,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:42,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1144879738, now seen corresponding path program 1 times [2021-06-05 12:20:42,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:42,611 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318822451] [2021-06-05 12:20:42,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:20:42,803 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:42,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318822451] [2021-06-05 12:20:42,804 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318822451] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:42,804 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:20:42,804 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:20:42,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887678746] [2021-06-05 12:20:42,809 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:20:42,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:42,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:20:42,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:20:42,833 INFO L87 Difference]: Start difference. First operand has 3627 states, 3617 states have (on average 2.395355266795687) internal successors, (8664), 3626 states have internal predecessors, (8664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:42,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:42,905 INFO L93 Difference]: Finished difference Result 3508 states and 6927 transitions. [2021-06-05 12:20:42,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:20:42,907 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-06-05 12:20:42,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:42,933 INFO L225 Difference]: With dead ends: 3508 [2021-06-05 12:20:42,934 INFO L226 Difference]: Without dead ends: 2237 [2021-06-05 12:20:42,935 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:20:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2237 states. [2021-06-05 12:20:43,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2237 to 2237. [2021-06-05 12:20:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 2230 states have (on average 1.952017937219731) internal successors, (4353), 2236 states have internal predecessors, (4353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 4353 transitions. [2021-06-05 12:20:43,089 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 4353 transitions. Word has length 42 [2021-06-05 12:20:43,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:43,089 INFO L482 AbstractCegarLoop]: Abstraction has 2237 states and 4353 transitions. [2021-06-05 12:20:43,089 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 4353 transitions. [2021-06-05 12:20:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:20:43,096 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:43,096 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:43,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 12:20:43,097 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:43,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:43,102 INFO L82 PathProgramCache]: Analyzing trace with hash 572314360, now seen corresponding path program 1 times [2021-06-05 12:20:43,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:43,102 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019481332] [2021-06-05 12:20:43,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:43,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:20:43,184 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:43,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019481332] [2021-06-05 12:20:43,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019481332] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:43,184 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:20:43,184 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:20:43,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472559375] [2021-06-05 12:20:43,186 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:20:43,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:43,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:20:43,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:20:43,188 INFO L87 Difference]: Start difference. First operand 2237 states and 4353 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:43,225 INFO L93 Difference]: Finished difference Result 2241 states and 4357 transitions. [2021-06-05 12:20:43,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:20:43,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-06-05 12:20:43,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:43,234 INFO L225 Difference]: With dead ends: 2241 [2021-06-05 12:20:43,235 INFO L226 Difference]: Without dead ends: 2241 [2021-06-05 12:20:43,235 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:20:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2021-06-05 12:20:43,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2238. [2021-06-05 12:20:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2238 states, 2231 states have (on average 1.9515912147019274) internal successors, (4354), 2237 states have internal predecessors, (4354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 4354 transitions. [2021-06-05 12:20:43,285 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 4354 transitions. Word has length 42 [2021-06-05 12:20:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:43,286 INFO L482 AbstractCegarLoop]: Abstraction has 2238 states and 4354 transitions. [2021-06-05 12:20:43,286 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 4354 transitions. [2021-06-05 12:20:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 12:20:43,290 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:43,291 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:43,291 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 12:20:43,291 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:43,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:43,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1507642114, now seen corresponding path program 1 times [2021-06-05 12:20:43,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:43,299 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144253045] [2021-06-05 12:20:43,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:20:43,389 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:43,389 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144253045] [2021-06-05 12:20:43,389 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144253045] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:43,389 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453556147] [2021-06-05 12:20:43,389 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 [2021-06-05 12:20:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:43,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:20:43,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:20:43,630 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453556147] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:43,630 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:20:43,631 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:20:43,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930841744] [2021-06-05 12:20:43,631 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:20:43,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:43,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:20:43,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:20:43,633 INFO L87 Difference]: Start difference. First operand 2238 states and 4354 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:43,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:43,668 INFO L93 Difference]: Finished difference Result 2224 states and 4340 transitions. [2021-06-05 12:20:43,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:20:43,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-06-05 12:20:43,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:43,678 INFO L225 Difference]: With dead ends: 2224 [2021-06-05 12:20:43,678 INFO L226 Difference]: Without dead ends: 2224 [2021-06-05 12:20:43,678 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.7ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:20:43,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2021-06-05 12:20:43,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 2224. [2021-06-05 12:20:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2224 states, 2218 states have (on average 1.956717763751127) internal successors, (4340), 2223 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 4340 transitions. [2021-06-05 12:20:43,735 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 4340 transitions. Word has length 47 [2021-06-05 12:20:43,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:43,735 INFO L482 AbstractCegarLoop]: Abstraction has 2224 states and 4340 transitions. [2021-06-05 12:20:43,735 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 4340 transitions. [2021-06-05 12:20:43,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:20:43,736 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:43,736 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:43,961 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-06-05 12:20:43,961 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:43,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:43,962 INFO L82 PathProgramCache]: Analyzing trace with hash -284217623, now seen corresponding path program 1 times [2021-06-05 12:20:43,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:43,962 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869470167] [2021-06-05 12:20:43,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:20:44,077 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:44,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869470167] [2021-06-05 12:20:44,077 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869470167] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:44,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505591091] [2021-06-05 12:20:44,077 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 [2021-06-05 12:20:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:44,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:20:44,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:20:44,348 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505591091] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:44,385 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:44,386 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:20:44,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042795391] [2021-06-05 12:20:44,387 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:20:44,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:44,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:20:44,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:20:44,388 INFO L87 Difference]: Start difference. First operand 2224 states and 4340 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:44,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:44,444 INFO L93 Difference]: Finished difference Result 2232 states and 4348 transitions. [2021-06-05 12:20:44,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:20:44,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-06-05 12:20:44,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:44,453 INFO L225 Difference]: With dead ends: 2232 [2021-06-05 12:20:44,453 INFO L226 Difference]: Without dead ends: 2232 [2021-06-05 12:20:44,453 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 31.0ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:20:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2021-06-05 12:20:44,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2229. [2021-06-05 12:20:44,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 2223 states have (on average 1.954565901934323) internal successors, (4345), 2228 states have internal predecessors, (4345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 4345 transitions. [2021-06-05 12:20:44,528 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 4345 transitions. Word has length 57 [2021-06-05 12:20:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:44,529 INFO L482 AbstractCegarLoop]: Abstraction has 2229 states and 4345 transitions. [2021-06-05 12:20:44,529 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 4345 transitions. [2021-06-05 12:20:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 12:20:44,530 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:44,530 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:44,754 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:44,754 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:44,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:44,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1050918947, now seen corresponding path program 2 times [2021-06-05 12:20:44,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:44,755 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882272603] [2021-06-05 12:20:44,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:20:44,837 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:44,837 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882272603] [2021-06-05 12:20:44,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882272603] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:44,837 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069589362] [2021-06-05 12:20:44,837 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 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 [2021-06-05 12:20:44,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:20:44,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:44,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:20:44,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:20:45,077 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069589362] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:45,077 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:45,077 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:20:45,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692447617] [2021-06-05 12:20:45,079 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:20:45,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:45,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:20:45,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:20:45,080 INFO L87 Difference]: Start difference. First operand 2229 states and 4345 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:45,113 INFO L93 Difference]: Finished difference Result 509 states and 915 transitions. [2021-06-05 12:20:45,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:20:45,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 12:20:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:45,115 INFO L225 Difference]: With dead ends: 509 [2021-06-05 12:20:45,115 INFO L226 Difference]: Without dead ends: 329 [2021-06-05 12:20:45,116 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 33.4ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:20:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-06-05 12:20:45,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2021-06-05 12:20:45,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.7652439024390243) internal successors, (579), 328 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 579 transitions. [2021-06-05 12:20:45,122 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 579 transitions. Word has length 62 [2021-06-05 12:20:45,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:45,122 INFO L482 AbstractCegarLoop]: Abstraction has 329 states and 579 transitions. [2021-06-05 12:20:45,122 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 579 transitions. [2021-06-05 12:20:45,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 12:20:45,123 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:45,124 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:45,346 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:45,346 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:45,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:45,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1616667064, now seen corresponding path program 1 times [2021-06-05 12:20:45,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:45,347 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531044384] [2021-06-05 12:20:45,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:20:45,428 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:45,428 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531044384] [2021-06-05 12:20:45,429 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531044384] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:45,429 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851389036] [2021-06-05 12:20:45,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:45,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:20:45,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:20:45,675 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851389036] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:45,675 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:45,675 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 12:20:45,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733096293] [2021-06-05 12:20:45,675 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:20:45,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:45,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:20:45,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:20:45,677 INFO L87 Difference]: Start difference. First operand 329 states and 579 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:45,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:45,737 INFO L93 Difference]: Finished difference Result 337 states and 587 transitions. [2021-06-05 12:20:45,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 12:20:45,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 12:20:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:45,739 INFO L225 Difference]: With dead ends: 337 [2021-06-05 12:20:45,739 INFO L226 Difference]: Without dead ends: 337 [2021-06-05 12:20:45,740 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 62.1ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:20:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-06-05 12:20:45,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 334. [2021-06-05 12:20:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.7537537537537538) internal successors, (584), 333 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:45,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 584 transitions. [2021-06-05 12:20:45,745 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 584 transitions. Word has length 68 [2021-06-05 12:20:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:45,746 INFO L482 AbstractCegarLoop]: Abstraction has 334 states and 584 transitions. [2021-06-05 12:20:45,746 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:45,746 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 584 transitions. [2021-06-05 12:20:45,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 12:20:45,747 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:45,747 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:45,960 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:45,961 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:45,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:45,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1456297922, now seen corresponding path program 2 times [2021-06-05 12:20:45,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:45,961 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111770369] [2021-06-05 12:20:45,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:20:46,030 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:46,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111770369] [2021-06-05 12:20:46,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111770369] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:46,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317393048] [2021-06-05 12:20:46,031 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 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 [2021-06-05 12:20:46,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 12:20:46,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:46,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 12:20:46,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:46,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:20:46,171 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,172 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:46,173 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,173 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:20:46,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:20:46,194 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,197 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:46,199 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,199 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:20:46,290 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:20:46,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:20:46,293 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,299 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:46,300 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,300 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:20:46,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:20:46,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:20:46,360 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,363 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:46,364 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,369 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:46,371 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,371 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:20:46,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:20:46,430 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,431 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:46,433 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:20:46,433 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:20:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 12:20:46,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317393048] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:46,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:20:46,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2021-06-05 12:20:46,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784056950] [2021-06-05 12:20:46,505 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 12:20:46,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:46,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 12:20:46,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:20:46,506 INFO L87 Difference]: Start difference. First operand 334 states and 584 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:46,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:46,716 INFO L93 Difference]: Finished difference Result 354 states and 601 transitions. [2021-06-05 12:20:46,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:20:46,717 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 12:20:46,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:46,718 INFO L225 Difference]: With dead ends: 354 [2021-06-05 12:20:46,718 INFO L226 Difference]: Without dead ends: 262 [2021-06-05 12:20:46,718 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 244.4ms TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2021-06-05 12:20:46,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-06-05 12:20:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2021-06-05 12:20:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.685823754789272) internal successors, (440), 261 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 440 transitions. [2021-06-05 12:20:46,723 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 440 transitions. Word has length 73 [2021-06-05 12:20:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:46,723 INFO L482 AbstractCegarLoop]: Abstraction has 262 states and 440 transitions. [2021-06-05 12:20:46,723 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 440 transitions. [2021-06-05 12:20:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 12:20:46,724 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:46,725 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:46,940 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-06-05 12:20:46,941 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:46,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:46,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1966762392, now seen corresponding path program 1 times [2021-06-05 12:20:46,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:46,942 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817606667] [2021-06-05 12:20:46,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:20:47,030 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:47,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817606667] [2021-06-05 12:20:47,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817606667] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:47,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561110716] [2021-06-05 12:20:47,031 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 [2021-06-05 12:20:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:47,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:20:47,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:20:47,250 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561110716] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:47,250 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:47,250 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:20:47,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12166779] [2021-06-05 12:20:47,251 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:20:47,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:47,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:20:47,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:20:47,252 INFO L87 Difference]: Start difference. First operand 262 states and 440 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:47,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:47,339 INFO L93 Difference]: Finished difference Result 270 states and 448 transitions. [2021-06-05 12:20:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:20:47,340 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 12:20:47,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:47,342 INFO L225 Difference]: With dead ends: 270 [2021-06-05 12:20:47,342 INFO L226 Difference]: Without dead ends: 270 [2021-06-05 12:20:47,342 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 82.8ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:20:47,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-06-05 12:20:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2021-06-05 12:20:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.6729323308270676) internal successors, (445), 266 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 445 transitions. [2021-06-05 12:20:47,348 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 445 transitions. Word has length 82 [2021-06-05 12:20:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:47,349 INFO L482 AbstractCegarLoop]: Abstraction has 267 states and 445 transitions. [2021-06-05 12:20:47,349 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 445 transitions. [2021-06-05 12:20:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-05 12:20:47,350 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:47,351 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:47,564 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:47,565 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:47,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:47,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1392313746, now seen corresponding path program 2 times [2021-06-05 12:20:47,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:47,565 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848141807] [2021-06-05 12:20:47,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:47,652 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:20:47,652 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:47,652 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848141807] [2021-06-05 12:20:47,652 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848141807] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:47,652 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129598199] [2021-06-05 12:20:47,652 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 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 [2021-06-05 12:20:47,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:20:47,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:47,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:20:47,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:47,860 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:20:47,860 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129598199] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:47,861 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:47,861 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:20:47,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000688804] [2021-06-05 12:20:47,861 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:20:47,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:47,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:20:47,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:20:47,862 INFO L87 Difference]: Start difference. First operand 267 states and 445 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:47,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:47,961 INFO L93 Difference]: Finished difference Result 275 states and 453 transitions. [2021-06-05 12:20:47,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:20:47,961 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-06-05 12:20:47,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:47,962 INFO L225 Difference]: With dead ends: 275 [2021-06-05 12:20:47,962 INFO L226 Difference]: Without dead ends: 275 [2021-06-05 12:20:47,963 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 115.3ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:20:47,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-06-05 12:20:47,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2021-06-05 12:20:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 1.6605166051660516) internal successors, (450), 271 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:47,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 450 transitions. [2021-06-05 12:20:47,967 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 450 transitions. Word has length 87 [2021-06-05 12:20:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:47,967 INFO L482 AbstractCegarLoop]: Abstraction has 272 states and 450 transitions. [2021-06-05 12:20:47,967 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 450 transitions. [2021-06-05 12:20:47,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-06-05 12:20:47,968 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:47,968 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:48,191 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:48,192 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:48,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:48,192 INFO L82 PathProgramCache]: Analyzing trace with hash 398535208, now seen corresponding path program 3 times [2021-06-05 12:20:48,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:48,192 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848359720] [2021-06-05 12:20:48,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:20:48,307 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:48,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848359720] [2021-06-05 12:20:48,307 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848359720] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:48,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590114759] [2021-06-05 12:20:48,307 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 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 [2021-06-05 12:20:48,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:20:48,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:48,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 13 conjunts are in the unsatisfiable core [2021-06-05 12:20:48,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:48,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:20:48,424 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:48,425 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:48,425 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:48,426 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:20:48,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:20:48,441 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:48,444 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:48,445 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:48,445 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:20:48,543 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:20:48,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:20:48,546 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:48,550 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:48,550 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:48,551 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:20:48,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:20:48,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:20:48,599 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:48,603 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:48,604 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:48,609 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:48,610 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:48,610 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:20:48,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:20:48,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:20:48,690 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:48,694 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:48,695 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:48,700 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:48,702 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:48,702 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:20:48,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:20:48,731 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:48,732 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:48,733 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:20:48,733 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:20:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-06-05 12:20:48,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590114759] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:48,783 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:48,783 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2021-06-05 12:20:48,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510681254] [2021-06-05 12:20:48,783 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 12:20:48,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:48,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 12:20:48,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:20:48,784 INFO L87 Difference]: Start difference. First operand 272 states and 450 transitions. Second operand has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 21 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:49,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:49,289 INFO L93 Difference]: Finished difference Result 276 states and 452 transitions. [2021-06-05 12:20:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 12:20:49,289 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 21 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-06-05 12:20:49,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:49,289 INFO L225 Difference]: With dead ends: 276 [2021-06-05 12:20:49,289 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 12:20:49,294 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 494.3ms TimeCoverageRelationStatistics Valid=360, Invalid=1362, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 12:20:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 12:20:49,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 12:20:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 12:20:49,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2021-06-05 12:20:49,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:49,295 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 12:20:49,295 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 21 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 12:20:49,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 12:20:49,509 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-06-05 12:20:49,509 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 12:20:49,511 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 12:20:49,511 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:20:49,511 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:20:49,511 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:20:49,511 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:20:49,511 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:20:49,512 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:20:49,512 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:20:49,512 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 12:20:49,514 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158 places, 186 transitions, 380 flow [2021-06-05 12:20:49,575 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3627 states, 3617 states have (on average 2.395355266795687) internal successors, (8664), 3626 states have internal predecessors, (8664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:49,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 3627 states, 3617 states have (on average 2.395355266795687) internal successors, (8664), 3626 states have internal predecessors, (8664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-06-05 12:20:49,580 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:49,580 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:49,580 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:20:49,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:49,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1178213848, now seen corresponding path program 1 times [2021-06-05 12:20:49,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:49,580 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690526156] [2021-06-05 12:20:49,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:49,591 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:49,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690526156] [2021-06-05 12:20:49,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690526156] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:49,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:20:49,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:20:49,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871207795] [2021-06-05 12:20:49,592 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:20:49,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:49,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:20:49,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:20:49,598 INFO L87 Difference]: Start difference. First operand has 3627 states, 3617 states have (on average 2.395355266795687) internal successors, (8664), 3626 states have internal predecessors, (8664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:49,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:49,611 INFO L93 Difference]: Finished difference Result 3508 states and 6927 transitions. [2021-06-05 12:20:49,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:20:49,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-06-05 12:20:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:49,614 INFO L225 Difference]: With dead ends: 3508 [2021-06-05 12:20:49,614 INFO L226 Difference]: Without dead ends: 653 [2021-06-05 12:20:49,614 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:20:49,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2021-06-05 12:20:49,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2021-06-05 12:20:49,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 650 states have (on average 1.8676923076923078) internal successors, (1214), 652 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:49,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1214 transitions. [2021-06-05 12:20:49,624 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1214 transitions. Word has length 43 [2021-06-05 12:20:49,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:49,624 INFO L482 AbstractCegarLoop]: Abstraction has 653 states and 1214 transitions. [2021-06-05 12:20:49,625 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:49,625 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1214 transitions. [2021-06-05 12:20:49,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-06-05 12:20:49,625 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:49,625 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:49,625 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 12:20:49,625 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:20:49,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:49,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1039544105, now seen corresponding path program 1 times [2021-06-05 12:20:49,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:49,626 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534917781] [2021-06-05 12:20:49,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:49,641 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:49,641 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534917781] [2021-06-05 12:20:49,641 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534917781] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:49,641 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:20:49,641 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:20:49,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114277395] [2021-06-05 12:20:49,642 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:20:49,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:49,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:20:49,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:20:49,642 INFO L87 Difference]: Start difference. First operand 653 states and 1214 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:49,653 INFO L93 Difference]: Finished difference Result 657 states and 1218 transitions. [2021-06-05 12:20:49,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:20:49,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-06-05 12:20:49,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:49,655 INFO L225 Difference]: With dead ends: 657 [2021-06-05 12:20:49,655 INFO L226 Difference]: Without dead ends: 657 [2021-06-05 12:20:49,655 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:20:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2021-06-05 12:20:49,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 654. [2021-06-05 12:20:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 651 states have (on average 1.8663594470046083) internal successors, (1215), 653 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1215 transitions. [2021-06-05 12:20:49,666 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1215 transitions. Word has length 43 [2021-06-05 12:20:49,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:49,666 INFO L482 AbstractCegarLoop]: Abstraction has 654 states and 1215 transitions. [2021-06-05 12:20:49,666 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1215 transitions. [2021-06-05 12:20:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 12:20:49,666 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:49,667 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:49,667 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 12:20:49,667 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:20:49,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:49,667 INFO L82 PathProgramCache]: Analyzing trace with hash 985402851, now seen corresponding path program 1 times [2021-06-05 12:20:49,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:49,667 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316336778] [2021-06-05 12:20:49,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:49,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:49,692 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:49,692 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316336778] [2021-06-05 12:20:49,692 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316336778] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:49,692 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707690042] [2021-06-05 12:20:49,692 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 [2021-06-05 12:20:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:49,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:20:49,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:49,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707690042] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:49,840 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:49,840 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:20:49,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465288416] [2021-06-05 12:20:49,840 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:20:49,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:49,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:20:49,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:20:49,841 INFO L87 Difference]: Start difference. First operand 654 states and 1215 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:49,873 INFO L93 Difference]: Finished difference Result 662 states and 1223 transitions. [2021-06-05 12:20:49,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:20:49,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 12:20:49,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:49,875 INFO L225 Difference]: With dead ends: 662 [2021-06-05 12:20:49,875 INFO L226 Difference]: Without dead ends: 662 [2021-06-05 12:20:49,876 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 27.1ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:20:49,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2021-06-05 12:20:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 659. [2021-06-05 12:20:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 656 states have (on average 1.8597560975609757) internal successors, (1220), 658 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1220 transitions. [2021-06-05 12:20:49,885 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1220 transitions. Word has length 48 [2021-06-05 12:20:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:49,886 INFO L482 AbstractCegarLoop]: Abstraction has 659 states and 1220 transitions. [2021-06-05 12:20:49,886 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1220 transitions. [2021-06-05 12:20:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 12:20:49,886 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:49,886 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:50,109 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:50,109 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:20:50,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:50,110 INFO L82 PathProgramCache]: Analyzing trace with hash -2108271767, now seen corresponding path program 2 times [2021-06-05 12:20:50,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:50,110 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341693919] [2021-06-05 12:20:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:50,179 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:50,179 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341693919] [2021-06-05 12:20:50,179 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341693919] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:50,179 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801379352] [2021-06-05 12:20:50,179 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 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 [2021-06-05 12:20:50,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:20:50,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:50,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:20:50,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:50,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:50,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801379352] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:50,344 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:50,344 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 12:20:50,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132632628] [2021-06-05 12:20:50,344 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:20:50,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:50,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:20:50,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:20:50,345 INFO L87 Difference]: Start difference. First operand 659 states and 1220 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:50,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:50,394 INFO L93 Difference]: Finished difference Result 667 states and 1228 transitions. [2021-06-05 12:20:50,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 12:20:50,395 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-06-05 12:20:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:50,397 INFO L225 Difference]: With dead ends: 667 [2021-06-05 12:20:50,397 INFO L226 Difference]: Without dead ends: 667 [2021-06-05 12:20:50,397 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 79.3ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:20:50,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2021-06-05 12:20:50,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 664. [2021-06-05 12:20:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 661 states have (on average 1.853252647503782) internal successors, (1225), 663 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1225 transitions. [2021-06-05 12:20:50,408 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1225 transitions. Word has length 53 [2021-06-05 12:20:50,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:50,408 INFO L482 AbstractCegarLoop]: Abstraction has 664 states and 1225 transitions. [2021-06-05 12:20:50,408 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:50,408 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1225 transitions. [2021-06-05 12:20:50,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-06-05 12:20:50,409 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:50,409 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:50,624 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:50,625 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:20:50,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:50,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1912041053, now seen corresponding path program 3 times [2021-06-05 12:20:50,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:50,625 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438914235] [2021-06-05 12:20:50,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:50,675 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:50,675 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438914235] [2021-06-05 12:20:50,675 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438914235] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:50,675 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658190350] [2021-06-05 12:20:50,676 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 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 [2021-06-05 12:20:50,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 12:20:50,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:50,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:20:50,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:50,861 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:50,861 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658190350] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:50,861 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:50,861 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:20:50,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762578855] [2021-06-05 12:20:50,863 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:20:50,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:50,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:20:50,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:20:50,863 INFO L87 Difference]: Start difference. First operand 664 states and 1225 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:50,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:50,934 INFO L93 Difference]: Finished difference Result 672 states and 1233 transitions. [2021-06-05 12:20:50,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:20:50,935 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-06-05 12:20:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:50,936 INFO L225 Difference]: With dead ends: 672 [2021-06-05 12:20:50,937 INFO L226 Difference]: Without dead ends: 672 [2021-06-05 12:20:50,937 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 73.6ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:20:50,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-06-05 12:20:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 669. [2021-06-05 12:20:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 666 states have (on average 1.8468468468468469) internal successors, (1230), 668 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1230 transitions. [2021-06-05 12:20:50,947 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1230 transitions. Word has length 58 [2021-06-05 12:20:50,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:50,947 INFO L482 AbstractCegarLoop]: Abstraction has 669 states and 1230 transitions. [2021-06-05 12:20:50,948 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1230 transitions. [2021-06-05 12:20:50,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 12:20:50,948 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:50,948 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:51,170 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 12:20:51,171 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:20:51,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:51,171 INFO L82 PathProgramCache]: Analyzing trace with hash 822486953, now seen corresponding path program 4 times [2021-06-05 12:20:51,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:51,171 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538460670] [2021-06-05 12:20:51,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:51,240 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:51,240 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538460670] [2021-06-05 12:20:51,240 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538460670] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:51,240 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117574618] [2021-06-05 12:20:51,241 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 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 [2021-06-05 12:20:51,300 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 12:20:51,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:51,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:20:51,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:51,403 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117574618] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:51,403 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:51,403 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:20:51,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552013437] [2021-06-05 12:20:51,403 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:20:51,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:51,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:20:51,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:20:51,404 INFO L87 Difference]: Start difference. First operand 669 states and 1230 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:51,516 INFO L93 Difference]: Finished difference Result 677 states and 1238 transitions. [2021-06-05 12:20:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:20:51,517 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 12:20:51,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:51,519 INFO L225 Difference]: With dead ends: 677 [2021-06-05 12:20:51,519 INFO L226 Difference]: Without dead ends: 677 [2021-06-05 12:20:51,519 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 120.6ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:20:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2021-06-05 12:20:51,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 674. [2021-06-05 12:20:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 671 states have (on average 1.8405365126676603) internal successors, (1235), 673 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:51,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1235 transitions. [2021-06-05 12:20:51,530 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1235 transitions. Word has length 63 [2021-06-05 12:20:51,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:51,530 INFO L482 AbstractCegarLoop]: Abstraction has 674 states and 1235 transitions. [2021-06-05 12:20:51,530 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:51,530 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1235 transitions. [2021-06-05 12:20:51,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 12:20:51,531 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:51,531 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:51,753 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-06-05 12:20:51,753 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:20:51,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:51,753 INFO L82 PathProgramCache]: Analyzing trace with hash -447519389, now seen corresponding path program 5 times [2021-06-05 12:20:51,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:51,754 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241722996] [2021-06-05 12:20:51,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:51,838 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:51,838 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241722996] [2021-06-05 12:20:51,838 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241722996] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:51,839 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257789142] [2021-06-05 12:20:51,839 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:51,916 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-06-05 12:20:51,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:51,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 12:20:51,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:52,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257789142] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:52,042 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:52,042 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2021-06-05 12:20:52,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105094579] [2021-06-05 12:20:52,043 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 12:20:52,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:52,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 12:20:52,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 12:20:52,043 INFO L87 Difference]: Start difference. First operand 674 states and 1235 transitions. Second operand has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:52,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:52,182 INFO L93 Difference]: Finished difference Result 682 states and 1243 transitions. [2021-06-05 12:20:52,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 12:20:52,182 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 12:20:52,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:52,185 INFO L225 Difference]: With dead ends: 682 [2021-06-05 12:20:52,185 INFO L226 Difference]: Without dead ends: 682 [2021-06-05 12:20:52,185 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 156.8ms TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2021-06-05 12:20:52,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2021-06-05 12:20:52,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 679. [2021-06-05 12:20:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 676 states have (on average 1.834319526627219) internal successors, (1240), 678 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1240 transitions. [2021-06-05 12:20:52,195 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1240 transitions. Word has length 68 [2021-06-05 12:20:52,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:52,195 INFO L482 AbstractCegarLoop]: Abstraction has 679 states and 1240 transitions. [2021-06-05 12:20:52,195 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:52,195 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1240 transitions. [2021-06-05 12:20:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 12:20:52,196 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:52,196 INFO L521 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:52,418 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-06-05 12:20:52,419 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:20:52,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:52,419 INFO L82 PathProgramCache]: Analyzing trace with hash 774482921, now seen corresponding path program 6 times [2021-06-05 12:20:52,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:52,419 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432819151] [2021-06-05 12:20:52,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:52,526 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:52,526 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432819151] [2021-06-05 12:20:52,526 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432819151] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:52,526 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279107143] [2021-06-05 12:20:52,527 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2021-06-05 12:20:52,618 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-06-05 12:20:52,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:52,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:20:52,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:52,746 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279107143] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:52,746 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:52,746 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:20:52,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061329673] [2021-06-05 12:20:52,747 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:20:52,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:52,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:20:52,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:20:52,748 INFO L87 Difference]: Start difference. First operand 679 states and 1240 transitions. Second operand has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:52,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:52,914 INFO L93 Difference]: Finished difference Result 687 states and 1248 transitions. [2021-06-05 12:20:52,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:20:52,914 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 12:20:52,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:52,916 INFO L225 Difference]: With dead ends: 687 [2021-06-05 12:20:52,916 INFO L226 Difference]: Without dead ends: 687 [2021-06-05 12:20:52,917 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 200.1ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:20:52,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2021-06-05 12:20:52,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 684. [2021-06-05 12:20:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 681 states have (on average 1.828193832599119) internal successors, (1245), 683 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1245 transitions. [2021-06-05 12:20:52,927 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1245 transitions. Word has length 73 [2021-06-05 12:20:52,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:52,927 INFO L482 AbstractCegarLoop]: Abstraction has 684 states and 1245 transitions. [2021-06-05 12:20:52,927 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:52,927 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1245 transitions. [2021-06-05 12:20:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-05 12:20:52,928 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:52,928 INFO L521 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:53,151 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:53,151 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:20:53,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:53,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1392019747, now seen corresponding path program 7 times [2021-06-05 12:20:53,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:53,152 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750236873] [2021-06-05 12:20:53,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:53,291 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:53,291 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750236873] [2021-06-05 12:20:53,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750236873] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:53,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150679710] [2021-06-05 12:20:53,292 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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 [2021-06-05 12:20:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:53,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:20:53,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:53,492 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150679710] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:53,492 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:53,492 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:20:53,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259556583] [2021-06-05 12:20:53,492 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:20:53,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:53,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:20:53,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:20:53,493 INFO L87 Difference]: Start difference. First operand 684 states and 1245 transitions. Second operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:53,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:53,723 INFO L93 Difference]: Finished difference Result 692 states and 1253 transitions. [2021-06-05 12:20:53,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:20:53,724 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-06-05 12:20:53,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:53,726 INFO L225 Difference]: With dead ends: 692 [2021-06-05 12:20:53,726 INFO L226 Difference]: Without dead ends: 692 [2021-06-05 12:20:53,726 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 252.9ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:20:53,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-06-05 12:20:53,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 689. [2021-06-05 12:20:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 686 states have (on average 1.8221574344023324) internal successors, (1250), 688 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1250 transitions. [2021-06-05 12:20:53,735 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1250 transitions. Word has length 78 [2021-06-05 12:20:53,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:53,735 INFO L482 AbstractCegarLoop]: Abstraction has 689 states and 1250 transitions. [2021-06-05 12:20:53,736 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:53,736 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1250 transitions. [2021-06-05 12:20:53,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 12:20:53,736 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:53,736 INFO L521 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:53,956 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:53,957 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:20:53,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:53,957 INFO L82 PathProgramCache]: Analyzing trace with hash -2132484055, now seen corresponding path program 8 times [2021-06-05 12:20:53,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:53,957 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039107906] [2021-06-05 12:20:53,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:54,119 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:54,119 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039107906] [2021-06-05 12:20:54,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039107906] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:54,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653043545] [2021-06-05 12:20:54,120 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 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 [2021-06-05 12:20:54,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:20:54,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:54,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 12:20:54,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:54,333 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653043545] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:54,333 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:54,333 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2021-06-05 12:20:54,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001710338] [2021-06-05 12:20:54,334 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 12:20:54,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:54,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 12:20:54,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:20:54,335 INFO L87 Difference]: Start difference. First operand 689 states and 1250 transitions. Second operand has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:54,575 INFO L93 Difference]: Finished difference Result 697 states and 1258 transitions. [2021-06-05 12:20:54,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 12:20:54,576 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-05 12:20:54,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:54,578 INFO L225 Difference]: With dead ends: 697 [2021-06-05 12:20:54,578 INFO L226 Difference]: Without dead ends: 697 [2021-06-05 12:20:54,578 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 305.0ms TimeCoverageRelationStatistics Valid=427, Invalid=905, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 12:20:54,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-06-05 12:20:54,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 694. [2021-06-05 12:20:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 691 states have (on average 1.8162083936324167) internal successors, (1255), 693 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:54,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1255 transitions. [2021-06-05 12:20:54,591 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1255 transitions. Word has length 83 [2021-06-05 12:20:54,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:54,591 INFO L482 AbstractCegarLoop]: Abstraction has 694 states and 1255 transitions. [2021-06-05 12:20:54,591 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1255 transitions. [2021-06-05 12:20:54,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-05 12:20:54,592 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:54,592 INFO L521 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:54,800 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:54,801 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:20:54,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:54,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1504445213, now seen corresponding path program 9 times [2021-06-05 12:20:54,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:54,801 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857652645] [2021-06-05 12:20:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:54,985 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:54,985 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857652645] [2021-06-05 12:20:54,986 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857652645] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:54,986 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598514481] [2021-06-05 12:20:54,986 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 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 [2021-06-05 12:20:55,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-06-05 12:20:55,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:55,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:20:55,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:55,335 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:20:55,335 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598514481] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:55,335 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:55,335 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:20:55,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568805656] [2021-06-05 12:20:55,336 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:20:55,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:55,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:20:55,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:20:55,336 INFO L87 Difference]: Start difference. First operand 694 states and 1255 transitions. Second operand has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:55,631 INFO L93 Difference]: Finished difference Result 699 states and 1260 transitions. [2021-06-05 12:20:55,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:20:55,632 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-06-05 12:20:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:55,634 INFO L225 Difference]: With dead ends: 699 [2021-06-05 12:20:55,634 INFO L226 Difference]: Without dead ends: 699 [2021-06-05 12:20:55,634 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 363.1ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:20:55,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-06-05 12:20:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2021-06-05 12:20:55,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 696 states have (on average 1.8103448275862069) internal successors, (1260), 698 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:55,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1260 transitions. [2021-06-05 12:20:55,645 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1260 transitions. Word has length 88 [2021-06-05 12:20:55,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:55,645 INFO L482 AbstractCegarLoop]: Abstraction has 699 states and 1260 transitions. [2021-06-05 12:20:55,646 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1260 transitions. [2021-06-05 12:20:55,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-05 12:20:55,646 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:55,647 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:55,869 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-06-05 12:20:55,869 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:20:55,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:55,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1822702487, now seen corresponding path program 10 times [2021-06-05 12:20:55,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:55,870 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035798904] [2021-06-05 12:20:55,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 12:20:55,895 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 12:20:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 12:20:55,919 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 12:20:55,942 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 12:20:55,942 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 12:20:55,943 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 12:20:55,943 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 12:20:55,943 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 12:20:55,943 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 12:20:55,961 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,961 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,961 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,962 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,962 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,962 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,962 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,962 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,962 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,962 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,962 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,962 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,962 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,962 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,962 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,962 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,963 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,963 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,963 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,963 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,963 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,963 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,963 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,963 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,963 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,963 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,963 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,964 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,964 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,964 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,964 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,964 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,964 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,964 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,964 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,964 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,965 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,965 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,965 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,965 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,965 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,965 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,965 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,965 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,965 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,965 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,965 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,965 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,965 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,966 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,966 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,966 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,966 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,966 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,966 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,966 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,966 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,966 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,966 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,966 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,966 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,966 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,967 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,967 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,967 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,967 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,967 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,967 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,967 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,967 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,967 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,967 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,967 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,967 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,968 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,968 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,968 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,968 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,968 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,968 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,968 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,968 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,968 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,968 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,968 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,968 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,969 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,969 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,969 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,969 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,969 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,969 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,969 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,969 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,969 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,969 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,969 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,969 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,969 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,970 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,970 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,970 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,970 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,970 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,970 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,970 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,970 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,970 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,970 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,970 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,970 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,970 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,971 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,971 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,971 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,971 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,971 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,971 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,971 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,971 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,971 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,971 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,971 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,971 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,971 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,971 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,972 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,973 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,973 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,973 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,973 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,973 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,973 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,973 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,973 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,973 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,973 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,973 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,973 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,973 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,973 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,973 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,973 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,974 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,974 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,974 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,974 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,974 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,974 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,974 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,975 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,975 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,975 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,975 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,975 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,975 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,975 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,975 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,975 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,975 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,975 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,975 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,975 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,975 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,976 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,976 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,976 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,976 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,976 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,976 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,976 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,976 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,976 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,976 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,976 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,976 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,977 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,977 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,977 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,977 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,977 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,977 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,977 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,977 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,977 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,977 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,977 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,977 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,978 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,978 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,978 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,978 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,978 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,978 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,978 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,978 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,978 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,978 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,978 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,978 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,979 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,979 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,979 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,979 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,979 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,979 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,979 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,979 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,979 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,979 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,979 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,979 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,979 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,979 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,980 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,980 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,980 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,980 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,980 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,980 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,980 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,980 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,980 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,980 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,981 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,981 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,981 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,981 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,981 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,981 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,981 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,981 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,981 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,981 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,981 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,981 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,981 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,981 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,982 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,982 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,982 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,983 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,983 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,983 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,983 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,983 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,983 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,983 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,983 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,983 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,983 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,983 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,983 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,983 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,983 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,983 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,984 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,984 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,984 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,984 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,984 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,984 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,984 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,984 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,984 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,984 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,984 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,984 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,984 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,984 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,984 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,985 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,985 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,985 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,985 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,985 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,985 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,985 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,985 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,985 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,986 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,986 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,986 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,986 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,987 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,987 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,987 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,987 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,987 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,987 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,987 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,987 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,987 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,987 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,987 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,987 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,989 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,989 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,989 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,989 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,989 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,989 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,989 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,989 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,989 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,990 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,990 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,990 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,990 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,991 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:20:55,994 INFO L149 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-06-05 12:20:55,994 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 12:20:55,994 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:20:55,994 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:20:55,994 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:20:55,994 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:20:55,995 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:20:55,995 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:20:55,995 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:20:55,995 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 12:20:55,998 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 217 places, 257 transitions, 532 flow [2021-06-05 12:21:40,812 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 205977 states, 205953 states have (on average 3.603827086762514) internal successors, (742219), 205976 states have internal predecessors, (742219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 205977 states, 205953 states have (on average 3.603827086762514) internal successors, (742219), 205976 states have internal predecessors, (742219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:41,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:21:41,103 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:41,103 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:41,103 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:41,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:41,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1772857671, now seen corresponding path program 1 times [2021-06-05 12:21:41,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:41,104 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635723288] [2021-06-05 12:21:41,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:21:41,116 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:41,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635723288] [2021-06-05 12:21:41,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635723288] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:21:41,116 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:21:41,116 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:21:41,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234612649] [2021-06-05 12:21:41,116 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:21:41,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:41,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:21:41,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:21:41,324 INFO L87 Difference]: Start difference. First operand has 205977 states, 205953 states have (on average 3.603827086762514) internal successors, (742219), 205976 states have internal predecessors, (742219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:42,883 INFO L93 Difference]: Finished difference Result 195700 states and 582720 transitions. [2021-06-05 12:21:42,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:21:42,883 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-06-05 12:21:42,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:43,345 INFO L225 Difference]: With dead ends: 195700 [2021-06-05 12:21:43,345 INFO L226 Difference]: Without dead ends: 157169 [2021-06-05 12:21:43,345 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:21:49,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157169 states. [2021-06-05 12:21:51,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157169 to 157169. [2021-06-05 12:21:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157169 states, 157139 states have (on average 2.961219048103908) internal successors, (465323), 157168 states have internal predecessors, (465323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157169 states to 157169 states and 465323 transitions. [2021-06-05 12:21:52,287 INFO L78 Accepts]: Start accepts. Automaton has 157169 states and 465323 transitions. Word has length 42 [2021-06-05 12:21:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:52,287 INFO L482 AbstractCegarLoop]: Abstraction has 157169 states and 465323 transitions. [2021-06-05 12:21:52,287 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:52,287 INFO L276 IsEmpty]: Start isEmpty. Operand 157169 states and 465323 transitions. [2021-06-05 12:21:52,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:21:52,288 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:52,288 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:52,288 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 12:21:52,288 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:52,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:52,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1839864424, now seen corresponding path program 1 times [2021-06-05 12:21:52,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:52,289 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629779124] [2021-06-05 12:21:52,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:21:52,749 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:52,749 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629779124] [2021-06-05 12:21:52,750 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629779124] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:21:52,750 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:21:52,750 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:21:52,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421440485] [2021-06-05 12:21:52,750 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:21:52,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:52,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:21:52,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:21:52,751 INFO L87 Difference]: Start difference. First operand 157169 states and 465323 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:53,359 INFO L93 Difference]: Finished difference Result 157173 states and 465327 transitions. [2021-06-05 12:21:53,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:21:53,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-06-05 12:21:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:53,679 INFO L225 Difference]: With dead ends: 157173 [2021-06-05 12:21:53,680 INFO L226 Difference]: Without dead ends: 157173 [2021-06-05 12:21:53,680 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:21:59,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157173 states. [2021-06-05 12:22:01,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157173 to 157170. [2021-06-05 12:22:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157170 states, 157140 states have (on average 2.9612065673921344) internal successors, (465324), 157169 states have internal predecessors, (465324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157170 states to 157170 states and 465324 transitions. [2021-06-05 12:22:02,849 INFO L78 Accepts]: Start accepts. Automaton has 157170 states and 465324 transitions. Word has length 42 [2021-06-05 12:22:02,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:02,849 INFO L482 AbstractCegarLoop]: Abstraction has 157170 states and 465324 transitions. [2021-06-05 12:22:02,849 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:02,849 INFO L276 IsEmpty]: Start isEmpty. Operand 157170 states and 465324 transitions. [2021-06-05 12:22:02,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 12:22:02,850 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:02,850 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:22:02,850 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 12:22:02,850 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:02,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:02,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1214977823, now seen corresponding path program 1 times [2021-06-05 12:22:02,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:02,851 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958927531] [2021-06-05 12:22:02,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:22:02,877 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:02,877 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958927531] [2021-06-05 12:22:02,877 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958927531] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:02,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403730457] [2021-06-05 12:22:02,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:02,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:22:02,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:22:03,052 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403730457] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:03,052 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:22:03,052 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:22:03,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929693924] [2021-06-05 12:22:03,052 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:22:03,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:03,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:22:03,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:22:03,053 INFO L87 Difference]: Start difference. First operand 157170 states and 465324 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:03,621 INFO L93 Difference]: Finished difference Result 157156 states and 465310 transitions. [2021-06-05 12:22:03,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:22:03,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-06-05 12:22:03,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:03,912 INFO L225 Difference]: With dead ends: 157156 [2021-06-05 12:22:03,913 INFO L226 Difference]: Without dead ends: 157156 [2021-06-05 12:22:03,913 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:22:10,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157156 states. [2021-06-05 12:22:11,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157156 to 157156. [2021-06-05 12:22:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157156 states, 157127 states have (on average 2.961362464757807) internal successors, (465310), 157155 states have internal predecessors, (465310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157156 states to 157156 states and 465310 transitions. [2021-06-05 12:22:12,422 INFO L78 Accepts]: Start accepts. Automaton has 157156 states and 465310 transitions. Word has length 47 [2021-06-05 12:22:12,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:12,422 INFO L482 AbstractCegarLoop]: Abstraction has 157156 states and 465310 transitions. [2021-06-05 12:22:12,422 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 157156 states and 465310 transitions. [2021-06-05 12:22:12,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:22:12,423 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:12,423 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:22:12,626 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-06-05 12:22:12,627 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:12,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:12,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1783084037, now seen corresponding path program 1 times [2021-06-05 12:22:12,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:12,627 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342499189] [2021-06-05 12:22:12,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:22:12,651 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:12,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342499189] [2021-06-05 12:22:12,651 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342499189] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:12,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616258947] [2021-06-05 12:22:12,651 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 [2021-06-05 12:22:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:12,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:22:12,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:22:12,815 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616258947] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:12,815 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:22:12,815 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:22:12,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180108207] [2021-06-05 12:22:12,815 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:22:12,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:12,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:22:12,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:22:12,816 INFO L87 Difference]: Start difference. First operand 157156 states and 465310 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:13,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:13,992 INFO L93 Difference]: Finished difference Result 157164 states and 465318 transitions. [2021-06-05 12:22:13,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:22:13,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-06-05 12:22:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:14,258 INFO L225 Difference]: With dead ends: 157164 [2021-06-05 12:22:14,258 INFO L226 Difference]: Without dead ends: 157164 [2021-06-05 12:22:14,258 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 25.4ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:22:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157164 states. [2021-06-05 12:22:21,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157164 to 157161. [2021-06-05 12:22:22,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157161 states, 157132 states have (on average 2.9613000534582388) internal successors, (465315), 157160 states have internal predecessors, (465315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157161 states to 157161 states and 465315 transitions. [2021-06-05 12:22:22,589 INFO L78 Accepts]: Start accepts. Automaton has 157161 states and 465315 transitions. Word has length 57 [2021-06-05 12:22:22,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:22,589 INFO L482 AbstractCegarLoop]: Abstraction has 157161 states and 465315 transitions. [2021-06-05 12:22:22,589 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 157161 states and 465315 transitions. [2021-06-05 12:22:22,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 12:22:22,591 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:22,591 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:22:22,796 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-06-05 12:22:22,797 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:22,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:22,797 INFO L82 PathProgramCache]: Analyzing trace with hash 116810654, now seen corresponding path program 2 times [2021-06-05 12:22:22,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:22,797 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535704411] [2021-06-05 12:22:22,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:22:22,824 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:22,824 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535704411] [2021-06-05 12:22:22,824 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535704411] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:22,824 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227232183] [2021-06-05 12:22:22,824 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 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 [2021-06-05 12:22:22,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:22:22,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:22:22,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:22:22,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:22:23,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227232183] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:23,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:22:23,003 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:22:23,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433350673] [2021-06-05 12:22:23,003 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:22:23,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:23,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:22:23,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:22:23,004 INFO L87 Difference]: Start difference. First operand 157161 states and 465315 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:23,506 INFO L93 Difference]: Finished difference Result 155675 states and 462318 transitions. [2021-06-05 12:22:23,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:22:23,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 12:22:23,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:24,452 INFO L225 Difference]: With dead ends: 155675 [2021-06-05 12:22:24,452 INFO L226 Difference]: Without dead ends: 155675 [2021-06-05 12:22:24,452 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 24.9ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:22:30,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155675 states. [2021-06-05 12:22:31,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155675 to 155675. [2021-06-05 12:22:31,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155675 states, 155649 states have (on average 2.970260008095137) internal successors, (462318), 155674 states have internal predecessors, (462318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:32,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155675 states to 155675 states and 462318 transitions. [2021-06-05 12:22:32,234 INFO L78 Accepts]: Start accepts. Automaton has 155675 states and 462318 transitions. Word has length 62 [2021-06-05 12:22:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:32,234 INFO L482 AbstractCegarLoop]: Abstraction has 155675 states and 462318 transitions. [2021-06-05 12:22:32,234 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 155675 states and 462318 transitions. [2021-06-05 12:22:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 12:22:32,238 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:32,238 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:22:32,461 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-06-05 12:22:32,462 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:32,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:32,462 INFO L82 PathProgramCache]: Analyzing trace with hash -357366445, now seen corresponding path program 1 times [2021-06-05 12:22:32,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:32,462 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869187660] [2021-06-05 12:22:32,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:32,504 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:22:32,504 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:32,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869187660] [2021-06-05 12:22:32,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869187660] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:32,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968758814] [2021-06-05 12:22:32,506 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 [2021-06-05 12:22:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:32,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:22:32,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:33,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:22:33,227 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968758814] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:33,227 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:22:33,227 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 12:22:33,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516954370] [2021-06-05 12:22:33,228 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:22:33,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:33,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:22:33,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:22:33,229 INFO L87 Difference]: Start difference. First operand 155675 states and 462318 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:33,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:33,989 INFO L93 Difference]: Finished difference Result 155683 states and 462326 transitions. [2021-06-05 12:22:33,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 12:22:33,989 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 12:22:33,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:34,245 INFO L225 Difference]: With dead ends: 155683 [2021-06-05 12:22:34,245 INFO L226 Difference]: Without dead ends: 155683 [2021-06-05 12:22:34,246 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 68.1ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:22:40,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155683 states. [2021-06-05 12:22:41,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155683 to 155680. [2021-06-05 12:22:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155680 states, 155654 states have (on average 2.970196718362522) internal successors, (462323), 155679 states have internal predecessors, (462323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155680 states to 155680 states and 462323 transitions. [2021-06-05 12:22:42,863 INFO L78 Accepts]: Start accepts. Automaton has 155680 states and 462323 transitions. Word has length 68 [2021-06-05 12:22:42,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:42,863 INFO L482 AbstractCegarLoop]: Abstraction has 155680 states and 462323 transitions. [2021-06-05 12:22:42,863 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 155680 states and 462323 transitions. [2021-06-05 12:22:42,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 12:22:42,867 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:42,867 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:22:43,088 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-06-05 12:22:43,089 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:43,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:43,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1048366106, now seen corresponding path program 2 times [2021-06-05 12:22:43,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:43,089 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724464619] [2021-06-05 12:22:43,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:22:43,140 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:43,140 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724464619] [2021-06-05 12:22:43,140 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724464619] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:43,140 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683716024] [2021-06-05 12:22:43,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:43,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 12:22:43,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:22:43,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 12:22:43,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:43,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:22:43,257 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:43,258 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:43,259 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:43,259 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:22:43,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:22:43,273 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:43,276 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:43,277 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:43,277 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:22:43,348 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:22:43,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:22:43,351 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:43,354 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:43,355 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:43,356 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:22:43,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:22:43,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:22:43,402 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:43,406 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:43,407 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:43,412 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:43,415 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:43,415 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:22:43,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:22:43,469 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:43,471 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:43,472 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:22:43,472 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:22:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 12:22:43,519 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683716024] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:43,519 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:22:43,519 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2021-06-05 12:22:43,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893265385] [2021-06-05 12:22:43,519 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 12:22:43,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:43,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 12:22:43,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:22:43,520 INFO L87 Difference]: Start difference. First operand 155680 states and 462323 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:45,923 INFO L93 Difference]: Finished difference Result 281799 states and 826277 transitions. [2021-06-05 12:22:45,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 12:22:45,924 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 12:22:45,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:46,370 INFO L225 Difference]: With dead ends: 281799 [2021-06-05 12:22:46,370 INFO L226 Difference]: Without dead ends: 270303 [2021-06-05 12:22:46,371 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 471.5ms TimeCoverageRelationStatistics Valid=364, Invalid=1442, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 12:22:53,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270303 states. [2021-06-05 12:22:55,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270303 to 189186. [2021-06-05 12:22:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189186 states, 189160 states have (on average 2.9799481920067667) internal successors, (563687), 189185 states have internal predecessors, (563687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189186 states to 189186 states and 563687 transitions. [2021-06-05 12:22:56,279 INFO L78 Accepts]: Start accepts. Automaton has 189186 states and 563687 transitions. Word has length 73 [2021-06-05 12:22:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:56,280 INFO L482 AbstractCegarLoop]: Abstraction has 189186 states and 563687 transitions. [2021-06-05 12:22:56,280 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand 189186 states and 563687 transitions. [2021-06-05 12:22:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 12:22:56,288 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:56,288 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:22:56,510 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:56,510 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:56,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:56,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1717203094, now seen corresponding path program 1 times [2021-06-05 12:22:56,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:56,511 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219674808] [2021-06-05 12:22:56,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:22:57,195 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:57,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219674808] [2021-06-05 12:22:57,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219674808] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:57,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469946132] [2021-06-05 12:22:57,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2021-06-05 12:22:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:57,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:22:57,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:57,568 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:22:57,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469946132] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:57,568 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:22:57,569 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:22:57,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019371624] [2021-06-05 12:22:57,570 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:22:57,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:57,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:22:57,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:22:57,571 INFO L87 Difference]: Start difference. First operand 189186 states and 563687 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:58,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:58,252 INFO L93 Difference]: Finished difference Result 189194 states and 563695 transitions. [2021-06-05 12:22:58,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:22:58,253 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-06-05 12:22:58,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:58,602 INFO L225 Difference]: With dead ends: 189194 [2021-06-05 12:22:58,602 INFO L226 Difference]: Without dead ends: 189194 [2021-06-05 12:22:58,602 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 696.7ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:23:04,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189194 states. [2021-06-05 12:23:07,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189194 to 189191. [2021-06-05 12:23:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189191 states, 189165 states have (on average 2.9798958581132875) internal successors, (563692), 189190 states have internal predecessors, (563692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189191 states to 189191 states and 563692 transitions. [2021-06-05 12:23:08,056 INFO L78 Accepts]: Start accepts. Automaton has 189191 states and 563692 transitions. Word has length 77 [2021-06-05 12:23:08,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:08,056 INFO L482 AbstractCegarLoop]: Abstraction has 189191 states and 563692 transitions. [2021-06-05 12:23:08,056 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 189191 states and 563692 transitions. [2021-06-05 12:23:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 12:23:08,061 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:08,061 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:23:08,262 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:08,262 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:08,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:08,262 INFO L82 PathProgramCache]: Analyzing trace with hash 714176643, now seen corresponding path program 2 times [2021-06-05 12:23:08,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:08,262 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418084777] [2021-06-05 12:23:08,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:23:08,337 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:08,337 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418084777] [2021-06-05 12:23:08,337 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418084777] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:08,337 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515621622] [2021-06-05 12:23:08,337 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 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 [2021-06-05 12:23:08,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:23:08,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:23:08,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:23:08,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:23:08,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515621622] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:08,550 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:08,550 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:23:08,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722372976] [2021-06-05 12:23:08,550 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:23:08,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:08,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:23:08,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:23:08,551 INFO L87 Difference]: Start difference. First operand 189191 states and 563692 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:10,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:10,038 INFO L93 Difference]: Finished difference Result 189199 states and 563700 transitions. [2021-06-05 12:23:10,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:23:10,038 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 12:23:10,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:10,354 INFO L225 Difference]: With dead ends: 189199 [2021-06-05 12:23:10,355 INFO L226 Difference]: Without dead ends: 189199 [2021-06-05 12:23:10,355 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 98.7ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:23:16,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189199 states. [2021-06-05 12:23:18,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189199 to 189196. [2021-06-05 12:23:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189196 states, 189170 states have (on average 2.9798435269863086) internal successors, (563697), 189195 states have internal predecessors, (563697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189196 states to 189196 states and 563697 transitions. [2021-06-05 12:23:20,036 INFO L78 Accepts]: Start accepts. Automaton has 189196 states and 563697 transitions. Word has length 82 [2021-06-05 12:23:20,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:20,037 INFO L482 AbstractCegarLoop]: Abstraction has 189196 states and 563697 transitions. [2021-06-05 12:23:20,037 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 189196 states and 563697 transitions. [2021-06-05 12:23:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-05 12:23:20,044 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:20,044 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:23:20,260 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:20,261 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:20,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:20,261 INFO L82 PathProgramCache]: Analyzing trace with hash 945313546, now seen corresponding path program 3 times [2021-06-05 12:23:20,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:20,261 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181129625] [2021-06-05 12:23:20,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:20,344 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:23:20,345 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:20,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181129625] [2021-06-05 12:23:20,345 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181129625] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:20,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229898392] [2021-06-05 12:23:20,345 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 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 [2021-06-05 12:23:20,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 12:23:20,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:23:20,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:23:20,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-05 12:23:20,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229898392] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:20,582 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:20,582 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2021-06-05 12:23:20,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079238262] [2021-06-05 12:23:20,583 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 12:23:20,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:20,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 12:23:20,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-06-05 12:23:20,583 INFO L87 Difference]: Start difference. First operand 189196 states and 563697 transitions. Second operand has 18 states, 18 states have (on average 6.388888888888889) internal successors, (115), 18 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:20,886 INFO L93 Difference]: Finished difference Result 37700 states and 108576 transitions. [2021-06-05 12:23:20,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 12:23:20,888 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.388888888888889) internal successors, (115), 18 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-06-05 12:23:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:20,932 INFO L225 Difference]: With dead ends: 37700 [2021-06-05 12:23:20,933 INFO L226 Difference]: Without dead ends: 31580 [2021-06-05 12:23:20,933 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 229.6ms TimeCoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2021-06-05 12:23:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31580 states. [2021-06-05 12:23:21,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31580 to 31577. [2021-06-05 12:23:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31577 states, 31572 states have (on average 2.870486507031547) internal successors, (90627), 31576 states have internal predecessors, (90627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31577 states to 31577 states and 90627 transitions. [2021-06-05 12:23:22,163 INFO L78 Accepts]: Start accepts. Automaton has 31577 states and 90627 transitions. Word has length 87 [2021-06-05 12:23:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:22,163 INFO L482 AbstractCegarLoop]: Abstraction has 31577 states and 90627 transitions. [2021-06-05 12:23:22,164 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 6.388888888888889) internal successors, (115), 18 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 31577 states and 90627 transitions. [2021-06-05 12:23:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-06-05 12:23:22,171 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:22,171 INFO L521 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:23:22,375 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-06-05 12:23:22,375 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:22,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:22,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2046986638, now seen corresponding path program 1 times [2021-06-05 12:23:22,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:22,376 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668045269] [2021-06-05 12:23:22,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:23:22,550 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:22,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668045269] [2021-06-05 12:23:22,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668045269] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:22,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450638139] [2021-06-05 12:23:22,550 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 [2021-06-05 12:23:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:22,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:23:22,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:22,798 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:23:22,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450638139] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:22,798 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:22,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:23:22,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421052904] [2021-06-05 12:23:22,799 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:23:22,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:22,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:23:22,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:23:22,800 INFO L87 Difference]: Start difference. First operand 31577 states and 90627 transitions. Second operand has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:23,059 INFO L93 Difference]: Finished difference Result 31585 states and 90635 transitions. [2021-06-05 12:23:23,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:23:23,059 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-06-05 12:23:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:23,122 INFO L225 Difference]: With dead ends: 31585 [2021-06-05 12:23:23,123 INFO L226 Difference]: Without dead ends: 31585 [2021-06-05 12:23:23,125 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 224.3ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:23:23,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31585 states. [2021-06-05 12:23:23,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31585 to 31582. [2021-06-05 12:23:23,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31582 states, 31577 states have (on average 2.870190328403585) internal successors, (90632), 31581 states have internal predecessors, (90632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:24,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31582 states to 31582 states and 90632 transitions. [2021-06-05 12:23:24,020 INFO L78 Accepts]: Start accepts. Automaton has 31582 states and 90632 transitions. Word has length 97 [2021-06-05 12:23:24,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:24,020 INFO L482 AbstractCegarLoop]: Abstraction has 31582 states and 90632 transitions. [2021-06-05 12:23:24,021 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:24,021 INFO L276 IsEmpty]: Start isEmpty. Operand 31582 states and 90632 transitions. [2021-06-05 12:23:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-06-05 12:23:24,028 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:24,028 INFO L521 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:23:24,240 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:24,241 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:24,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:24,241 INFO L82 PathProgramCache]: Analyzing trace with hash -439690997, now seen corresponding path program 2 times [2021-06-05 12:23:24,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:24,241 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004371240] [2021-06-05 12:23:24,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:23:24,423 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:24,423 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004371240] [2021-06-05 12:23:24,423 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004371240] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:24,423 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909437572] [2021-06-05 12:23:24,423 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 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 [2021-06-05 12:23:24,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:23:24,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:23:24,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:23:24,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:25,025 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2021-06-05 12:23:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:23:25,026 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909437572] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:25,026 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:25,026 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:23:25,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325012556] [2021-06-05 12:23:25,026 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:23:25,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:25,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:23:25,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:23:25,027 INFO L87 Difference]: Start difference. First operand 31582 states and 90632 transitions. Second operand has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:25,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:25,447 INFO L93 Difference]: Finished difference Result 31590 states and 90640 transitions. [2021-06-05 12:23:25,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:23:25,447 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-06-05 12:23:25,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:25,493 INFO L225 Difference]: With dead ends: 31590 [2021-06-05 12:23:25,497 INFO L226 Difference]: Without dead ends: 31590 [2021-06-05 12:23:25,497 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 284.2ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:23:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31590 states. [2021-06-05 12:23:26,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31590 to 31587. [2021-06-05 12:23:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31587 states, 31582 states have (on average 2.8698942435564563) internal successors, (90637), 31586 states have internal predecessors, (90637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:26,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31587 states to 31587 states and 90637 transitions. [2021-06-05 12:23:26,199 INFO L78 Accepts]: Start accepts. Automaton has 31587 states and 90637 transitions. Word has length 102 [2021-06-05 12:23:26,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:26,200 INFO L482 AbstractCegarLoop]: Abstraction has 31587 states and 90637 transitions. [2021-06-05 12:23:26,200 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:26,200 INFO L276 IsEmpty]: Start isEmpty. Operand 31587 states and 90637 transitions. [2021-06-05 12:23:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-06-05 12:23:26,205 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:26,205 INFO L521 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:23:26,406 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-06-05 12:23:26,406 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:26,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:26,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1642058222, now seen corresponding path program 3 times [2021-06-05 12:23:26,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:26,407 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205366683] [2021-06-05 12:23:26,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:26,545 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:23:26,545 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:26,545 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205366683] [2021-06-05 12:23:26,545 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205366683] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:26,545 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090109386] [2021-06-05 12:23:26,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:26,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:23:26,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:23:26,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 13 conjunts are in the unsatisfiable core [2021-06-05 12:23:26,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:26,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:23:26,658 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:26,659 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:26,660 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:26,660 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:23:26,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:23:26,674 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:26,677 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:26,677 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:26,677 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:23:26,790 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:23:26,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:23:26,792 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:26,795 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:26,796 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:26,796 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:23:26,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:23:26,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:23:26,832 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:26,836 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:26,837 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:26,842 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:26,843 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:26,843 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:23:26,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:23:26,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:23:26,917 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:26,921 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:26,921 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:26,926 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:26,928 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:26,928 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:23:26,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:23:26,957 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:26,958 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:26,959 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:23:26,959 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:23:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-06-05 12:23:27,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090109386] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:27,014 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:27,014 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 27 [2021-06-05 12:23:27,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608576248] [2021-06-05 12:23:27,016 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 12:23:27,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:27,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 12:23:27,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2021-06-05 12:23:27,017 INFO L87 Difference]: Start difference. First operand 31587 states and 90637 transitions. Second operand has 27 states, 27 states have (on average 5.962962962962963) internal successors, (161), 27 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:28,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:28,188 INFO L93 Difference]: Finished difference Result 33920 states and 96519 transitions. [2021-06-05 12:23:28,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 12:23:28,194 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.962962962962963) internal successors, (161), 27 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-06-05 12:23:28,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:28,233 INFO L225 Difference]: With dead ends: 33920 [2021-06-05 12:23:28,233 INFO L226 Difference]: Without dead ends: 29671 [2021-06-05 12:23:28,234 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 787.2ms TimeCoverageRelationStatistics Valid=735, Invalid=2925, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 12:23:28,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29671 states. [2021-06-05 12:23:28,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29671 to 23036. [2021-06-05 12:23:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23036 states, 23033 states have (on average 2.8406633959970478) internal successors, (65429), 23035 states have internal predecessors, (65429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:28,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23036 states to 23036 states and 65429 transitions. [2021-06-05 12:23:28,768 INFO L78 Accepts]: Start accepts. Automaton has 23036 states and 65429 transitions. Word has length 107 [2021-06-05 12:23:28,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:28,768 INFO L482 AbstractCegarLoop]: Abstraction has 23036 states and 65429 transitions. [2021-06-05 12:23:28,768 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 5.962962962962963) internal successors, (161), 27 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:28,768 INFO L276 IsEmpty]: Start isEmpty. Operand 23036 states and 65429 transitions. [2021-06-05 12:23:28,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-06-05 12:23:28,773 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:28,773 INFO L521 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:23:28,973 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:28,974 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:28,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:28,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1836685252, now seen corresponding path program 1 times [2021-06-05 12:23:28,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:28,974 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256807632] [2021-06-05 12:23:28,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:23:29,150 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:29,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256807632] [2021-06-05 12:23:29,150 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256807632] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:29,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219456753] [2021-06-05 12:23:29,150 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 [2021-06-05 12:23:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:29,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:23:29,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:23:29,403 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219456753] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:29,403 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:29,403 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:23:29,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694154687] [2021-06-05 12:23:29,404 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:23:29,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:29,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:23:29,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:23:29,405 INFO L87 Difference]: Start difference. First operand 23036 states and 65429 transitions. Second operand has 23 states, 23 states have (on average 4.956521739130435) internal successors, (114), 23 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:29,741 INFO L93 Difference]: Finished difference Result 23041 states and 65434 transitions. [2021-06-05 12:23:29,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:23:29,741 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.956521739130435) internal successors, (114), 23 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2021-06-05 12:23:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:29,765 INFO L225 Difference]: With dead ends: 23041 [2021-06-05 12:23:29,765 INFO L226 Difference]: Without dead ends: 23041 [2021-06-05 12:23:29,765 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 387.5ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:23:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23041 states. [2021-06-05 12:23:30,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23041 to 23041. [2021-06-05 12:23:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23041 states, 23038 states have (on average 2.840263911797899) internal successors, (65434), 23040 states have internal predecessors, (65434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23041 states to 23041 states and 65434 transitions. [2021-06-05 12:23:30,216 INFO L78 Accepts]: Start accepts. Automaton has 23041 states and 65434 transitions. Word has length 113 [2021-06-05 12:23:30,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:30,217 INFO L482 AbstractCegarLoop]: Abstraction has 23041 states and 65434 transitions. [2021-06-05 12:23:30,217 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 4.956521739130435) internal successors, (114), 23 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 23041 states and 65434 transitions. [2021-06-05 12:23:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-06-05 12:23:30,222 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:30,222 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:23:30,422 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-06-05 12:23:30,422 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:30,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:30,423 INFO L82 PathProgramCache]: Analyzing trace with hash -808933283, now seen corresponding path program 2 times [2021-06-05 12:23:30,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:30,423 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756460626] [2021-06-05 12:23:30,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:30,559 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:23:30,560 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:30,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756460626] [2021-06-05 12:23:30,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756460626] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:30,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176229571] [2021-06-05 12:23:30,560 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 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 [2021-06-05 12:23:30,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:23:30,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:23:30,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 13 conjunts are in the unsatisfiable core [2021-06-05 12:23:30,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:30,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:23:30,670 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:30,671 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:30,672 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:30,672 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:23:30,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:23:30,678 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:30,681 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:30,682 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:30,682 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:23:30,784 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:23:30,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:23:30,786 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:30,789 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:30,790 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:30,790 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:23:30,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:23:30,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:23:30,809 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:30,813 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:30,814 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:30,818 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:30,819 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:30,820 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:23:30,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:23:30,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:23:30,852 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:30,855 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:30,856 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:30,860 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:30,861 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:30,861 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:23:30,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:23:30,895 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:30,896 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:30,897 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:23:30,897 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:23:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:23:30,939 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176229571] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:30,939 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:30,939 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2021-06-05 12:23:30,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116317170] [2021-06-05 12:23:30,939 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:23:30,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:30,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:23:30,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:23:30,940 INFO L87 Difference]: Start difference. First operand 23041 states and 65434 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:31,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:31,257 INFO L93 Difference]: Finished difference Result 26437 states and 73728 transitions. [2021-06-05 12:23:31,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:23:31,257 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2021-06-05 12:23:31,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:31,281 INFO L225 Difference]: With dead ends: 26437 [2021-06-05 12:23:31,281 INFO L226 Difference]: Without dead ends: 22969 [2021-06-05 12:23:31,281 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 177.8ms TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2021-06-05 12:23:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22969 states. [2021-06-05 12:23:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22969 to 22519. [2021-06-05 12:23:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22519 states, 22516 states have (on average 2.805604903179961) internal successors, (63171), 22518 states have internal predecessors, (63171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22519 states to 22519 states and 63171 transitions. [2021-06-05 12:23:31,773 INFO L78 Accepts]: Start accepts. Automaton has 22519 states and 63171 transitions. Word has length 118 [2021-06-05 12:23:31,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:31,774 INFO L482 AbstractCegarLoop]: Abstraction has 22519 states and 63171 transitions. [2021-06-05 12:23:31,774 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:31,774 INFO L276 IsEmpty]: Start isEmpty. Operand 22519 states and 63171 transitions. [2021-06-05 12:23:31,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-06-05 12:23:31,784 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:31,784 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:23:31,984 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:31,985 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:31,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:31,985 INFO L82 PathProgramCache]: Analyzing trace with hash -125914372, now seen corresponding path program 3 times [2021-06-05 12:23:31,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:31,985 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686332317] [2021-06-05 12:23:31,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2021-06-05 12:23:32,094 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:32,094 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686332317] [2021-06-05 12:23:32,094 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686332317] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:32,094 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960571932] [2021-06-05 12:23:32,094 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:32,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 12:23:32,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:23:32,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:23:32,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:32,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:23:32,213 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:32,214 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:32,214 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:32,214 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:23:32,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:23:32,221 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:32,224 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:32,224 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:32,224 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:23:32,324 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:23:32,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:23:32,326 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:32,328 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:32,329 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:32,329 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:23:32,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:23:32,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:23:32,343 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:32,347 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:32,347 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:32,351 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:32,352 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:32,352 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:23:32,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:23:32,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:23:32,399 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:32,403 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:32,404 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:32,409 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:32,410 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:32,410 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:23:32,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:23:32,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:23:32,488 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:32,492 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:32,492 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:32,497 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:32,498 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:32,498 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:23:32,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:23:32,515 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:32,517 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:32,517 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:23:32,517 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:23:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2021-06-05 12:23:32,545 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960571932] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:32,545 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:32,545 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2021-06-05 12:23:32,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563838714] [2021-06-05 12:23:32,545 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 12:23:32,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:32,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 12:23:32,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-06-05 12:23:32,546 INFO L87 Difference]: Start difference. First operand 22519 states and 63171 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:32,857 INFO L93 Difference]: Finished difference Result 22681 states and 63486 transitions. [2021-06-05 12:23:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:23:32,857 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2021-06-05 12:23:32,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:32,882 INFO L225 Difference]: With dead ends: 22681 [2021-06-05 12:23:32,882 INFO L226 Difference]: Without dead ends: 19277 [2021-06-05 12:23:32,882 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 179.2ms TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2021-06-05 12:23:33,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19277 states. [2021-06-05 12:23:33,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19277 to 18715. [2021-06-05 12:23:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18715 states, 18713 states have (on average 2.8169721583925615) internal successors, (52714), 18714 states have internal predecessors, (52714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18715 states to 18715 states and 52714 transitions. [2021-06-05 12:23:33,247 INFO L78 Accepts]: Start accepts. Automaton has 18715 states and 52714 transitions. Word has length 127 [2021-06-05 12:23:33,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:33,248 INFO L482 AbstractCegarLoop]: Abstraction has 18715 states and 52714 transitions. [2021-06-05 12:23:33,248 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:33,248 INFO L276 IsEmpty]: Start isEmpty. Operand 18715 states and 52714 transitions. [2021-06-05 12:23:33,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-06-05 12:23:33,264 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:33,265 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:23:33,468 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-06-05 12:23:33,469 INFO L430 AbstractCegarLoop]: === Iteration 17 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:33,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:33,469 INFO L82 PathProgramCache]: Analyzing trace with hash 628647336, now seen corresponding path program 1 times [2021-06-05 12:23:33,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:33,469 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393179215] [2021-06-05 12:23:33,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-06-05 12:23:33,497 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:33,497 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393179215] [2021-06-05 12:23:33,497 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393179215] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:23:33,497 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:23:33,497 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:23:33,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221477987] [2021-06-05 12:23:33,498 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:23:33,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:33,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:23:33,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:23:33,498 INFO L87 Difference]: Start difference. First operand 18715 states and 52714 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:33,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:33,580 INFO L93 Difference]: Finished difference Result 17307 states and 48156 transitions. [2021-06-05 12:23:33,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:23:33,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2021-06-05 12:23:33,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:33,599 INFO L225 Difference]: With dead ends: 17307 [2021-06-05 12:23:33,599 INFO L226 Difference]: Without dead ends: 16451 [2021-06-05 12:23:33,599 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:23:33,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16451 states. [2021-06-05 12:23:33,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16451 to 15923. [2021-06-05 12:23:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15923 states, 15919 states have (on average 2.791255732143979) internal successors, (44434), 15922 states have internal predecessors, (44434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15923 states to 15923 states and 44434 transitions. [2021-06-05 12:23:33,937 INFO L78 Accepts]: Start accepts. Automaton has 15923 states and 44434 transitions. Word has length 141 [2021-06-05 12:23:33,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:33,938 INFO L482 AbstractCegarLoop]: Abstraction has 15923 states and 44434 transitions. [2021-06-05 12:23:33,938 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:33,938 INFO L276 IsEmpty]: Start isEmpty. Operand 15923 states and 44434 transitions. [2021-06-05 12:23:33,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-06-05 12:23:33,954 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:33,954 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:23:33,954 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 12:23:33,954 INFO L430 AbstractCegarLoop]: === Iteration 18 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:33,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:33,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1556709807, now seen corresponding path program 1 times [2021-06-05 12:23:33,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:33,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301969747] [2021-06-05 12:23:33,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:35,949 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 26 [2021-06-05 12:23:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:23:37,362 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:37,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301969747] [2021-06-05 12:23:37,362 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301969747] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:37,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389769896] [2021-06-05 12:23:37,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:37,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 19 conjunts are in the unsatisfiable core [2021-06-05 12:23:37,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:37,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:23:37,469 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:37,470 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:37,471 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:37,471 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:23:37,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:23:37,488 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:37,491 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:37,492 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:37,492 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:23:37,605 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:23:37,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:23:37,607 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:37,611 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:37,611 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:37,612 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:23:37,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:23:37,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:23:37,656 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:37,659 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:37,660 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:37,665 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:37,666 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:37,666 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:23:37,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:23:37,719 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:37,725 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:37,726 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:37,726 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-06-05 12:23:37,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:23:37,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:23:37,794 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:37,798 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:37,799 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:37,807 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:37,808 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:37,809 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-06-05 12:23:37,903 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-06-05 12:23:37,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 12:23:37,905 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:37,909 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:37,910 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:37,910 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:14 [2021-06-05 12:23:37,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-05 12:23:37,971 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:37,975 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:37,978 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:23:37,978 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2021-06-05 12:23:39,998 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~p~0.offset Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (store ((as const (Array Int Int)) 0) t_funThread2of2ForFork0_~p~0.offset (+ |t_funThread2of2ForFork0_#t~post39| 1)) (select |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base)) (not (= t_funThread2of2ForFork0_~p~0.offset c_t_funThread1of2ForFork0_~p~0.offset)))) is different from true [2021-06-05 12:23:40,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 12:23:40,076 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:40,080 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:40,083 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 12:23:40,083 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:23, output treesize:16 [2021-06-05 12:23:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:23:41,088 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389769896] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:41,088 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:41,089 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 14] total 52 [2021-06-05 12:23:41,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644196063] [2021-06-05 12:23:41,089 INFO L462 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-06-05 12:23:41,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:41,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-06-05 12:23:41,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2304, Unknown=2, NotChecked=98, Total=2652 [2021-06-05 12:23:41,090 INFO L87 Difference]: Start difference. First operand 15923 states and 44434 transitions. Second operand has 52 states, 52 states have (on average 4.519230769230769) internal successors, (235), 52 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:45,481 WARN L205 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2021-06-05 12:23:46,927 WARN L205 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-06-05 12:23:48,767 WARN L205 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2021-06-05 12:23:51,520 WARN L205 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2021-06-05 12:26:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:26:28,973 INFO L93 Difference]: Finished difference Result 20795 states and 57837 transitions. [2021-06-05 12:26:28,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-06-05 12:26:28,974 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.519230769230769) internal successors, (235), 52 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-06-05 12:26:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:26:28,994 INFO L225 Difference]: With dead ends: 20795 [2021-06-05 12:26:28,994 INFO L226 Difference]: Without dead ends: 19639 [2021-06-05 12:26:28,996 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2876 ImplicationChecksByTransitivity, 52979.4ms TimeCoverageRelationStatistics Valid=933, Invalid=8930, Unknown=41, NotChecked=196, Total=10100 [2021-06-05 12:26:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19639 states. [2021-06-05 12:26:29,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19639 to 18509. [2021-06-05 12:26:29,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18509 states, 18505 states have (on average 2.7949202918130234) internal successors, (51720), 18508 states have internal predecessors, (51720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:26:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18509 states to 18509 states and 51720 transitions. [2021-06-05 12:26:29,308 INFO L78 Accepts]: Start accepts. Automaton has 18509 states and 51720 transitions. Word has length 144 [2021-06-05 12:26:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:26:29,309 INFO L482 AbstractCegarLoop]: Abstraction has 18509 states and 51720 transitions. [2021-06-05 12:26:29,309 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 52 states, 52 states have (on average 4.519230769230769) internal successors, (235), 52 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:26:29,309 INFO L276 IsEmpty]: Start isEmpty. Operand 18509 states and 51720 transitions. [2021-06-05 12:26:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-06-05 12:26:29,325 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:26:29,325 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:26:29,526 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-06-05 12:26:29,526 INFO L430 AbstractCegarLoop]: === Iteration 19 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:26:29,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:26:29,526 INFO L82 PathProgramCache]: Analyzing trace with hash -494349308, now seen corresponding path program 1 times [2021-06-05 12:26:29,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:26:29,526 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541893856] [2021-06-05 12:26:29,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:26:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:26:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:26:29,801 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:26:29,801 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541893856] [2021-06-05 12:26:29,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541893856] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:26:29,801 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641628059] [2021-06-05 12:26:29,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:26:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:26:29,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 19 conjunts are in the unsatisfiable core [2021-06-05 12:26:29,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:26:29,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:26:29,927 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:29,928 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:29,929 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:29,929 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:26:29,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:26:29,936 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:29,940 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:29,940 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:29,940 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:26:30,037 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:26:30,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:26:30,039 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:30,043 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:30,044 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:30,044 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:26:30,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:26:30,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:26:30,067 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:30,071 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:30,072 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:30,077 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:30,079 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:30,079 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:26:30,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:26:30,104 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:30,111 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:30,111 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:30,112 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-06-05 12:26:30,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:26:30,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:26:30,147 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:30,151 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:30,152 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:30,161 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:30,162 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:30,162 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-06-05 12:26:30,216 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-06-05 12:26:30,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 12:26:30,218 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:30,223 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:30,223 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:30,224 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:14 [2021-06-05 12:26:30,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-05 12:26:30,278 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:30,282 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:30,284 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:26:30,284 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2021-06-05 12:26:32,310 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread1of2ForFork0_~p~0.offset Int) (|t_funThread1of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| c_t_funThread2of2ForFork0_~p~0.base) (store ((as const (Array Int Int)) 0) t_funThread1of2ForFork0_~p~0.offset (+ |t_funThread1of2ForFork0_#t~post39| 1))) (not (= c_t_funThread2of2ForFork0_~p~0.offset t_funThread1of2ForFork0_~p~0.offset)))) is different from true [2021-06-05 12:26:32,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 12:26:32,378 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:32,382 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:32,385 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 12:26:32,385 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:23, output treesize:16 [2021-06-05 12:26:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:26:33,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641628059] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:26:33,269 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:26:33,269 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2021-06-05 12:26:33,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560554911] [2021-06-05 12:26:33,269 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 12:26:33,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:26:33,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 12:26:33,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=291, Unknown=2, NotChecked=34, Total=380 [2021-06-05 12:26:33,270 INFO L87 Difference]: Start difference. First operand 18509 states and 51720 transitions. Second operand has 20 states, 20 states have (on average 6.4) internal successors, (128), 20 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:26:34,146 WARN L205 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2021-06-05 12:29:27,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:29:27,556 INFO L93 Difference]: Finished difference Result 22836 states and 63242 transitions. [2021-06-05 12:29:27,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 12:29:27,558 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.4) internal successors, (128), 20 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-06-05 12:29:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:29:27,579 INFO L225 Difference]: With dead ends: 22836 [2021-06-05 12:29:27,579 INFO L226 Difference]: Without dead ends: 21652 [2021-06-05 12:29:27,580 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 43560.5ms TimeCoverageRelationStatistics Valid=302, Invalid=1309, Unknown=33, NotChecked=78, Total=1722 [2021-06-05 12:29:27,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21652 states. [2021-06-05 12:29:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21652 to 20656. [2021-06-05 12:29:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20656 states, 20652 states have (on average 2.792175092000775) internal successors, (57664), 20655 states have internal predecessors, (57664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:29:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20656 states to 20656 states and 57664 transitions. [2021-06-05 12:29:27,982 INFO L78 Accepts]: Start accepts. Automaton has 20656 states and 57664 transitions. Word has length 144 [2021-06-05 12:29:27,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:29:27,983 INFO L482 AbstractCegarLoop]: Abstraction has 20656 states and 57664 transitions. [2021-06-05 12:29:27,983 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 6.4) internal successors, (128), 20 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:29:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 20656 states and 57664 transitions. [2021-06-05 12:29:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-06-05 12:29:28,000 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:29:28,000 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:29:28,201 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:29:28,201 INFO L430 AbstractCegarLoop]: === Iteration 20 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:29:28,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:29:28,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1350016790, now seen corresponding path program 2 times [2021-06-05 12:29:28,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:29:28,202 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384445602] [2021-06-05 12:29:28,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:29:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:29:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:29:28,491 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:29:28,491 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384445602] [2021-06-05 12:29:28,491 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384445602] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:29:28,491 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459326822] [2021-06-05 12:29:28,491 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:29:28,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:29:28,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:29:28,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 12:29:28,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:29:28,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:29:28,634 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:28,635 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:28,636 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:28,636 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:29:28,661 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 12:29:28,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 12:29:28,663 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:28,668 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:28,669 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:28,669 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 12:29:28,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:29:28,697 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:28,704 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:28,705 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:28,705 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2021-06-05 12:29:28,840 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 12:29:28,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 12:29:28,843 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:28,849 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:28,850 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:28,850 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2021-06-05 12:29:28,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:29:28,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:29:28,887 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:28,890 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:28,890 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:28,897 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:28,898 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:28,898 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:19 [2021-06-05 12:29:28,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:29:28,957 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:28,966 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:28,967 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:28,967 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2021-06-05 12:29:29,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:29:29,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:29:29,022 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:29,026 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:29,026 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:29,036 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:29,037 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:29,038 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:23 [2021-06-05 12:29:29,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 12:29:29,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 12:29:29,263 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:29,273 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:29,275 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:29:29,275 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2021-06-05 12:29:29,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-05 12:29:29,344 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:29,352 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:29,355 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-06-05 12:29:29,355 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:40, output treesize:32 [2021-06-05 12:29:29,933 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-06-05 12:29:29,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2021-06-05 12:29:29,935 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:29,939 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:29,942 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:29:29,942 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:16 [2021-06-05 12:29:31,962 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread1of2ForFork0_~p~0.offset Int) (|t_funThread1of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| c_t_funThread2of2ForFork0_~p~0.base) (store ((as const (Array Int Int)) 0) t_funThread1of2ForFork0_~p~0.offset (+ |t_funThread1of2ForFork0_#t~post39| 1))) (not (= c_t_funThread2of2ForFork0_~p~0.offset t_funThread1of2ForFork0_~p~0.offset)))) is different from true [2021-06-05 12:29:32,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 12:29:32,047 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:32,051 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:32,053 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 12:29:32,053 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:23, output treesize:16 [2021-06-05 12:29:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:29:32,889 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459326822] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:29:32,889 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:29:32,889 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2021-06-05 12:29:32,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841476401] [2021-06-05 12:29:32,889 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 12:29:32,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:29:32,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 12:29:32,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=614, Unknown=3, NotChecked=50, Total=756 [2021-06-05 12:29:32,890 INFO L87 Difference]: Start difference. First operand 20656 states and 57664 transitions. Second operand has 28 states, 28 states have (on average 6.214285714285714) internal successors, (174), 28 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:29:35,574 WARN L205 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2021-06-05 12:29:38,788 WARN L205 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 12:30:32,872 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 Received shutdown request... [2021-06-05 12:34:36,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-05 12:34:36,349 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-06-05 12:34:36,349 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 12:34:36,350 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT (1/2) [2021-06-05 12:34:36,351 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 12:34:36,352 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:34:36,352 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:34:36,352 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:34:36,352 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:34:36,352 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:34:36,352 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:34:36,352 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:34:36,352 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 12:34:36,353 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 217 places, 257 transitions, 532 flow [2021-06-05 12:34:36,353 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 12:34:36,354 INFO L315 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2021-06-05 12:34:36,354 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2021-06-05 12:34:36,356 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 12:34:36,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 12:34:36 BasicIcfg [2021-06-05 12:34:36,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 12:34:36,356 INFO L168 Benchmark]: Toolchain (without parser) took 835504.91 ms. Allocated memory was 371.2 MB in the beginning and 15.6 GB in the end (delta: 15.2 GB). Free memory was 333.2 MB in the beginning and 13.9 GB in the end (delta: -13.6 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.0 GB. [2021-06-05 12:34:36,357 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 371.2 MB. Free memory was 352.0 MB in the beginning and 352.0 MB in the end (delta: 70.5 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 12:34:36,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 627.59 ms. Allocated memory is still 371.2 MB. Free memory was 333.0 MB in the beginning and 307.6 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 16.0 GB. [2021-06-05 12:34:36,357 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.05 ms. Allocated memory is still 371.2 MB. Free memory was 307.6 MB in the beginning and 305.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:34:36,357 INFO L168 Benchmark]: Boogie Preprocessor took 28.67 ms. Allocated memory is still 371.2 MB. Free memory was 305.5 MB in the beginning and 303.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:34:36,357 INFO L168 Benchmark]: RCFGBuilder took 690.20 ms. Allocated memory is still 371.2 MB. Free memory was 303.4 MB in the beginning and 266.7 MB in the end (delta: 36.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.0 GB. [2021-06-05 12:34:36,357 INFO L168 Benchmark]: TraceAbstraction took 834091.42 ms. Allocated memory was 371.2 MB in the beginning and 15.6 GB in the end (delta: 15.2 GB). Free memory was 265.7 MB in the beginning and 13.9 GB in the end (delta: -13.6 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.0 GB. [2021-06-05 12:34:36,357 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 371.2 MB. Free memory was 352.0 MB in the beginning and 352.0 MB in the end (delta: 70.5 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 627.59 ms. Allocated memory is still 371.2 MB. Free memory was 333.0 MB in the beginning and 307.6 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 61.05 ms. Allocated memory is still 371.2 MB. Free memory was 307.6 MB in the beginning and 305.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 28.67 ms. Allocated memory is still 371.2 MB. Free memory was 305.5 MB in the beginning and 303.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 690.20 ms. Allocated memory is still 371.2 MB. Free memory was 303.4 MB in the beginning and 266.7 MB in the end (delta: 36.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 834091.42 ms. Allocated memory was 371.2 MB in the beginning and 15.6 GB in the end (delta: 15.2 GB). Free memory was 265.7 MB in the beginning and 13.9 GB in the end (delta: -13.6 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (20656states) and FLOYD_HOARE automaton (currently 39 states, 28 states before enhancement),while ReachableStatesComputation was computing reachable states (29689 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (20656states) and FLOYD_HOARE automaton (currently 39 states, 28 states before enhancement),while ReachableStatesComputation was computing reachable states (29689 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 947]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 217 places, 257 transitions, 532 flow. Already constructed 2 states. Currently 1 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 213 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7087.9ms, OverallIterations: 10, TraceHistogramMax: 5, EmptinessCheckTime: 43.8ms, AutomataDifference: 1302.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 142.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1109 SDtfs, 926 SDslu, 3260 SDs, 0 SdLazy, 522 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 290.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 680 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1089.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3627occurred in iteration=0, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 351.0ms AutomataMinimizationTime, 10 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 152.9ms SsaConstructionTime, 391.6ms SatisfiabilityAnalysisTime, 2263.5ms InterpolantComputationTime, 1220 NumberOfCodeBlocks, 1185 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1202 ConstructedInterpolants, 2 QuantifiedInterpolants, 2758 SizeOfPredicates, 44 NumberOfNonLiveVariables, 1222 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 113/310 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 270 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 820355.2ms, OverallIterations: 20, TraceHistogramMax: 10, EmptinessCheckTime: 427.7ms, AutomataDifference: 662591.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 44817.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5564 SDtfs, 10422 SDslu, 39397 SDs, 0 SdLazy, 8496 SolverSat, 522 SolverUnsat, 260 SolverUnknown, 0 SolverNotchecked, 482363.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2152 GetRequests, 1592 SyntacticMatches, 27 SemanticMatches, 533 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6527 ImplicationChecksByTransitivity, 178573.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=205977occurred in iteration=0, InterpolantAutomatonStates: 345, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 86113.2ms AutomataMinimizationTime, 19 MinimizatonAttempts, 91442 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 288.9ms SsaConstructionTime, 739.2ms SatisfiabilityAnalysisTime, 20671.3ms InterpolantComputationTime, 3523 NumberOfCodeBlocks, 3418 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 3486 ConstructedInterpolants, 45 QuantifiedInterpolants, 23131 SizeOfPredicates, 176 NumberOfNonLiveVariables, 3263 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 37 InterpolantComputations, 5 PerfectInterpolantSequences, 2743/4118 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 213 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6431.6ms, OverallIterations: 12, TraceHistogramMax: 10, EmptinessCheckTime: 10.0ms, AutomataDifference: 1400.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 63.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1118 SDtfs, 174 SDslu, 8791 SDs, 0 SdLazy, 648 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 356.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 815 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 1580.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3627occurred in iteration=0, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 113.0ms AutomataMinimizationTime, 11 MinimizatonAttempts, 27 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 131.5ms SsaConstructionTime, 338.1ms SatisfiabilityAnalysisTime, 1865.1ms InterpolantComputationTime, 1403 NumberOfCodeBlocks, 1389 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1290 ConstructedInterpolants, 0 QuantifiedInterpolants, 2228 SizeOfPredicates, 90 NumberOfNonLiveVariables, 1232 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 100/1390 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 270 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 2.0ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown