/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_77-tricky_address4_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 12:22:55,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 12:22:55,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 12:22:55,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 12:22:55,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 12:22:55,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 12:22:55,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 12:22:55,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 12:22:55,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 12:22:55,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 12:22:55,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 12:22:55,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 12:22:55,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 12:22:55,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 12:22:55,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 12:22:55,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 12:22:55,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 12:22:55,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 12:22:55,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 12:22:55,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 12:22:55,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 12:22:55,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 12:22:55,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 12:22:55,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 12:22:55,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 12:22:55,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 12:22:55,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 12:22:55,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 12:22:55,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 12:22:55,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 12:22:55,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 12:22:55,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 12:22:55,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 12:22:55,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 12:22:55,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 12:22:55,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 12:22:55,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 12:22:55,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 12:22:55,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 12:22:55,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 12:22:55,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 12:22:55,290 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:22:55,308 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 12:22:55,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 12:22:55,309 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 12:22:55,309 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 12:22:55,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 12:22:55,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 12:22:55,310 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 12:22:55,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 12:22:55,310 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 12:22:55,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 12:22:55,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 12:22:55,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 12:22:55,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 12:22:55,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 12:22:55,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 12:22:55,310 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 12:22:55,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 12:22:55,310 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 12:22:55,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 12:22:55,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 12:22:55,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 12:22:55,311 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 12:22:55,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 12:22:55,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 12:22:55,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 12:22:55,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 12:22:55,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 12:22:55,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 12:22:55,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 12:22:55,312 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 12:22:55,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 12:22:55,312 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 12:22:55,312 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:22:55,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 12:22:55,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 12:22:55,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 12:22:55,540 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 12:22:55,545 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 12:22:55,545 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2021-06-05 12:22:55,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ecd9fec/83c9e46bd104429490ebfb33d8f9dd30/FLAG514c61fe7 [2021-06-05 12:22:56,013 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 12:22:56,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2021-06-05 12:22:56,024 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ecd9fec/83c9e46bd104429490ebfb33d8f9dd30/FLAG514c61fe7 [2021-06-05 12:22:56,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ecd9fec/83c9e46bd104429490ebfb33d8f9dd30 [2021-06-05 12:22:56,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 12:22:56,387 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 12:22:56,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 12:22:56,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 12:22:56,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 12:22:56,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:22:56" (1/1) ... [2021-06-05 12:22:56,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e0d0775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:22:56, skipping insertion in model container [2021-06-05 12:22:56,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:22:56" (1/1) ... [2021-06-05 12:22:56,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 12:22:56,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 12:22:56,756 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_77-tricky_address4_racing.i[41060,41073] [2021-06-05 12:22:56,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:22:56,798 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 12:22:56,816 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_77-tricky_address4_racing.i[41060,41073] [2021-06-05 12:22:56,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:22:56,924 INFO L208 MainTranslator]: Completed translation [2021-06-05 12:22:56,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:22:56 WrapperNode [2021-06-05 12:22:56,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 12:22:56,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 12:22:56,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 12:22:56,926 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 12:22:56,930 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:22:56" (1/1) ... [2021-06-05 12:22:56,957 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:22:56" (1/1) ... [2021-06-05 12:22:56,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 12:22:56,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 12:22:56,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 12:22:56,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 12:22:56,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:22:56" (1/1) ... [2021-06-05 12:22:56,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:22:56" (1/1) ... [2021-06-05 12:22:57,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:22:56" (1/1) ... [2021-06-05 12:22:57,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:22:56" (1/1) ... [2021-06-05 12:22:57,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:22:56" (1/1) ... [2021-06-05 12:22:57,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:22:56" (1/1) ... [2021-06-05 12:22:57,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:22:56" (1/1) ... [2021-06-05 12:22:57,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 12:22:57,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 12:22:57,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 12:22:57,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 12:22:57,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:22:56" (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:22:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 12:22:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 12:22:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 12:22:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 12:22:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-05 12:22:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-06-05 12:22:57,170 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-06-05 12:22:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 12:22:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 12:22:57,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 12:22:57,171 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:22:57,661 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 12:22:57,661 INFO L299 CfgBuilder]: Removed 35 assume(true) statements. [2021-06-05 12:22:57,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:22:57 BoogieIcfgContainer [2021-06-05 12:22:57,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 12:22:57,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 12:22:57,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 12:22:57,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 12:22:57,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 12:22:56" (1/3) ... [2021-06-05 12:22:57,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eaa8282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:22:57, skipping insertion in model container [2021-06-05 12:22:57,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:22:56" (2/3) ... [2021-06-05 12:22:57,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eaa8282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:22:57, skipping insertion in model container [2021-06-05 12:22:57,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:22:57" (3/3) ... [2021-06-05 12:22:57,667 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_77-tricky_address4_racing.i [2021-06-05 12:22:57,671 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 12:22:57,671 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 12:22:57,671 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 12:22:57,671 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 12:22:57,716 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,716 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,716 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,716 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,717 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,717 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,717 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,717 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,717 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,717 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,717 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,717 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,718 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,718 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,718 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,718 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,718 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,718 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:22:57,718 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,718 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:22:57,718 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:22:57,719 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:22:57,719 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:22:57,719 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:22:57,719 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:22:57,719 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:22:57,719 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:22:57,719 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:22:57,719 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:22:57,720 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:22:57,720 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,720 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,720 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,720 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,720 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,720 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,720 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,721 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,721 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,721 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,721 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,721 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,721 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,721 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,721 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,722 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,722 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,722 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,722 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,722 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,722 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,722 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,722 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,722 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,723 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,723 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,723 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,723 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,723 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,723 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,723 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,723 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,724 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,724 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,724 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,724 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,724 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,724 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,724 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,724 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,724 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,725 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,725 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,725 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,725 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,725 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,725 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,726 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,726 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,726 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,726 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,726 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,726 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,736 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,737 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,737 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,737 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,737 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,737 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,737 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,738 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,738 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,738 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,738 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:22:57,738 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,738 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:22:57,738 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,738 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,739 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,739 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,739 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,739 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,739 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,739 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,739 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,739 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,740 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,740 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,740 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,740 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,740 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,740 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,740 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,740 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,741 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:22:57,741 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,741 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:22:57,741 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,741 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,741 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,741 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,741 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,741 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,742 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,742 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,742 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,742 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,742 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,742 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,742 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,742 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,743 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,743 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,743 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,743 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,743 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,745 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,745 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:22:57,745 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,745 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:22:57,746 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,746 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,746 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,746 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,746 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,746 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,746 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,746 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,746 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,747 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:22:57,747 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,747 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,747 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,747 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,747 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,747 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,747 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,747 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,748 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:22:57,760 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-06-05 12:22:57,775 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 12:22:57,787 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:22:57,787 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:22:57,787 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:22:57,787 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:22:57,788 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:22:57,788 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:22:57,788 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:22:57,788 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 12:22:57,796 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158 places, 186 transitions, 380 flow [2021-06-05 12:22:57,894 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:22:57,904 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:22:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:22:57,917 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:57,918 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:22:57,918 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:57,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:57,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1144879738, now seen corresponding path program 1 times [2021-06-05 12:22:57,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:57,927 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666394717] [2021-06-05 12:22:57,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:58,048 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:22:58,048 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:58,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666394717] [2021-06-05 12:22:58,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666394717] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:58,049 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:22:58,049 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:22:58,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768309196] [2021-06-05 12:22:58,052 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:22:58,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:58,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:22:58,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:22:58,072 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:22:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:58,115 INFO L93 Difference]: Finished difference Result 3508 states and 6927 transitions. [2021-06-05 12:22:58,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:22:58,116 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:22:58,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:58,135 INFO L225 Difference]: With dead ends: 3508 [2021-06-05 12:22:58,135 INFO L226 Difference]: Without dead ends: 2237 [2021-06-05 12:22:58,136 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:22:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2237 states. [2021-06-05 12:22:58,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2237 to 2237. [2021-06-05 12:22:58,243 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:22:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 4353 transitions. [2021-06-05 12:22:58,248 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 4353 transitions. Word has length 42 [2021-06-05 12:22:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:58,249 INFO L482 AbstractCegarLoop]: Abstraction has 2237 states and 4353 transitions. [2021-06-05 12:22:58,249 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:22:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 4353 transitions. [2021-06-05 12:22:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:22:58,253 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:58,253 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:22:58,253 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 12:22:58,253 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:58,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:58,256 INFO L82 PathProgramCache]: Analyzing trace with hash 572314360, now seen corresponding path program 1 times [2021-06-05 12:22:58,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:58,256 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611860282] [2021-06-05 12:22:58,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:58,333 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:22:58,333 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:58,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611860282] [2021-06-05 12:22:58,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611860282] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:58,334 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:22:58,334 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:22:58,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280666193] [2021-06-05 12:22:58,335 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:22:58,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:58,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:22:58,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:22:58,336 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:22:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:58,384 INFO L93 Difference]: Finished difference Result 2241 states and 4357 transitions. [2021-06-05 12:22:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:22:58,387 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:22:58,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:58,393 INFO L225 Difference]: With dead ends: 2241 [2021-06-05 12:22:58,394 INFO L226 Difference]: Without dead ends: 2241 [2021-06-05 12:22:58,395 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:22:58,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2021-06-05 12:22:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2238. [2021-06-05 12:22:58,429 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:22:58,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 4354 transitions. [2021-06-05 12:22:58,436 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 4354 transitions. Word has length 42 [2021-06-05 12:22:58,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:58,436 INFO L482 AbstractCegarLoop]: Abstraction has 2238 states and 4354 transitions. [2021-06-05 12:22:58,436 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:58,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 4354 transitions. [2021-06-05 12:22:58,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 12:22:58,445 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:58,445 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:58,445 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 12:22:58,445 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:58,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:58,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1507642114, now seen corresponding path program 1 times [2021-06-05 12:22:58,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:58,446 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104569488] [2021-06-05 12:22:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:58,500 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:58,501 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:58,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104569488] [2021-06-05 12:22:58,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104569488] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:58,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855529028] [2021-06-05 12:22:58,501 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:22:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:58,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:22:58,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:58,697 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:58,697 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855529028] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:58,697 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:22:58,697 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:22:58,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98347043] [2021-06-05 12:22:58,698 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:22:58,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:58,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:22:58,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:22:58,699 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:22:58,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:58,725 INFO L93 Difference]: Finished difference Result 2224 states and 4340 transitions. [2021-06-05 12:22:58,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:22:58,726 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:58,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:58,732 INFO L225 Difference]: With dead ends: 2224 [2021-06-05 12:22:58,732 INFO L226 Difference]: Without dead ends: 2224 [2021-06-05 12:22:58,732 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 17.0ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:22:58,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2021-06-05 12:22:58,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 2224. [2021-06-05 12:22:58,762 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:22:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 4340 transitions. [2021-06-05 12:22:58,767 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 4340 transitions. Word has length 47 [2021-06-05 12:22:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:58,768 INFO L482 AbstractCegarLoop]: Abstraction has 2224 states and 4340 transitions. [2021-06-05 12:22:58,770 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:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 4340 transitions. [2021-06-05 12:22:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:22:58,772 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:58,772 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:58,989 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-06-05 12:22:58,989 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:58,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:58,990 INFO L82 PathProgramCache]: Analyzing trace with hash -284217623, now seen corresponding path program 1 times [2021-06-05 12:22:58,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:58,990 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923151781] [2021-06-05 12:22:58,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:59,035 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:59,035 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:59,035 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923151781] [2021-06-05 12:22:59,036 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923151781] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:59,036 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438189099] [2021-06-05 12:22:59,036 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:22:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:59,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:22:59,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:59,244 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:59,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438189099] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:59,244 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:22:59,244 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:22:59,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689560596] [2021-06-05 12:22:59,245 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:22:59,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:59,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:22:59,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:22:59,245 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:22:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:59,297 INFO L93 Difference]: Finished difference Result 2232 states and 4348 transitions. [2021-06-05 12:22:59,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:22:59,298 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:59,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:59,304 INFO L225 Difference]: With dead ends: 2232 [2021-06-05 12:22:59,304 INFO L226 Difference]: Without dead ends: 2232 [2021-06-05 12:22:59,305 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 36.0ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:22:59,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2021-06-05 12:22:59,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2229. [2021-06-05 12:22:59,348 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:22:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 4345 transitions. [2021-06-05 12:22:59,354 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 4345 transitions. Word has length 57 [2021-06-05 12:22:59,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:59,354 INFO L482 AbstractCegarLoop]: Abstraction has 2229 states and 4345 transitions. [2021-06-05 12:22:59,354 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:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 4345 transitions. [2021-06-05 12:22:59,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 12:22:59,355 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:59,356 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:59,572 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:59,573 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:59,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:59,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1050918947, now seen corresponding path program 2 times [2021-06-05 12:22:59,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:59,574 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982873681] [2021-06-05 12:22:59,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:59,624 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:59,624 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:59,625 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982873681] [2021-06-05 12:22:59,625 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982873681] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:59,625 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171261754] [2021-06-05 12:22:59,625 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:22:59,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:22:59,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:22:59,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:22:59,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:59,883 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:59,883 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171261754] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:59,883 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:22:59,883 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:22:59,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092232297] [2021-06-05 12:22:59,885 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:22:59,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:59,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:22:59,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:22:59,886 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:22:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:59,913 INFO L93 Difference]: Finished difference Result 509 states and 915 transitions. [2021-06-05 12:22:59,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:22:59,914 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:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:59,915 INFO L225 Difference]: With dead ends: 509 [2021-06-05 12:22:59,915 INFO L226 Difference]: Without dead ends: 329 [2021-06-05 12:22:59,915 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 29.2ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:22:59,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-06-05 12:22:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2021-06-05 12:22:59,924 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:22:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 579 transitions. [2021-06-05 12:22:59,925 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 579 transitions. Word has length 62 [2021-06-05 12:22:59,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:59,926 INFO L482 AbstractCegarLoop]: Abstraction has 329 states and 579 transitions. [2021-06-05 12:22:59,927 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:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 579 transitions. [2021-06-05 12:22:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 12:22:59,929 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:59,929 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:23:00,147 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:00,147 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:00,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:00,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1616667064, now seen corresponding path program 1 times [2021-06-05 12:23:00,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:00,148 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663960912] [2021-06-05 12:23:00,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:00,194 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:23:00,194 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:00,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663960912] [2021-06-05 12:23:00,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663960912] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:00,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179442994] [2021-06-05 12:23:00,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 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:23:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:00,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:23:00,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:00,352 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:23:00,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179442994] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:00,352 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:00,352 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 12:23:00,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268671104] [2021-06-05 12:23:00,353 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:23:00,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:00,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:23:00,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:23:00,353 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:23:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:00,397 INFO L93 Difference]: Finished difference Result 337 states and 587 transitions. [2021-06-05 12:23:00,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 12:23:00,398 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:23:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:00,399 INFO L225 Difference]: With dead ends: 337 [2021-06-05 12:23:00,399 INFO L226 Difference]: Without dead ends: 337 [2021-06-05 12:23:00,399 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 44.4ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:23:00,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-06-05 12:23:00,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 334. [2021-06-05 12:23:00,402 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:23:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 584 transitions. [2021-06-05 12:23:00,403 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 584 transitions. Word has length 68 [2021-06-05 12:23:00,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:00,403 INFO L482 AbstractCegarLoop]: Abstraction has 334 states and 584 transitions. [2021-06-05 12:23:00,403 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:23:00,403 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 584 transitions. [2021-06-05 12:23:00,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 12:23:00,404 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:00,404 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:23:00,624 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:00,625 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:00,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:00,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1456297922, now seen corresponding path program 2 times [2021-06-05 12:23:00,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:00,625 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587988206] [2021-06-05 12:23:00,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:00,709 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:23:00,709 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:00,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587988206] [2021-06-05 12:23:00,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587988206] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:00,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617299186] [2021-06-05 12:23:00,709 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:23:00,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 12:23:00,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:23:00,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:23:00,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:00,844 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:00,845 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:00,846 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:00,847 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:00,847 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:23:00,865 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:00,866 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:00,869 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:00,870 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:00,870 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:23:00,967 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:23:00,967 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:00,969 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:00,972 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:00,972 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:00,972 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:23:01,013 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:01,018 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:01,019 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:01,022 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:01,023 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:01,027 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:01,029 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:01,029 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:23:01,076 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 18 treesize of output 14 [2021-06-05 12:23:01,077 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:01,078 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:01,081 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:23:01,081 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:18, output treesize:10 [2021-06-05 12:23:01,129 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:23:01,129 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617299186] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:23:01,130 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:23:01,130 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2021-06-05 12:23:01,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504831872] [2021-06-05 12:23:01,130 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:23:01,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:01,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:23:01,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:23:01,131 INFO L87 Difference]: Start difference. First operand 334 states and 584 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 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:23:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:01,217 INFO L93 Difference]: Finished difference Result 312 states and 542 transitions. [2021-06-05 12:23:01,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 12:23:01,217 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 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:23:01,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:01,217 INFO L225 Difference]: With dead ends: 312 [2021-06-05 12:23:01,218 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 12:23:01,218 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 132.0ms TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2021-06-05 12:23:01,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 12:23:01,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 12:23:01,218 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:23:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 12:23:01,218 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2021-06-05 12:23:01,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:01,218 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 12:23:01,218 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 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:23:01,218 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 12:23:01,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 12:23:01,432 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-06-05 12:23:01,433 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 12:23:01,434 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 12:23:01,435 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:23:01,435 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:23:01,435 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:23:01,435 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:23:01,435 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:23:01,435 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:23:01,435 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:23:01,435 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 12:23:01,437 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158 places, 186 transitions, 380 flow [2021-06-05 12:23:01,482 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:23:01,485 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:23:01,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-06-05 12:23:01,486 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:01,486 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:23:01,486 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:23:01,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:01,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1178213848, now seen corresponding path program 1 times [2021-06-05 12:23:01,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:01,487 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453726834] [2021-06-05 12:23:01,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:01,497 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:23:01,497 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:01,498 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453726834] [2021-06-05 12:23:01,498 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453726834] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:23:01,498 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:23:01,498 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:23:01,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383988591] [2021-06-05 12:23:01,498 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:23:01,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:01,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:23:01,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:23:01,503 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:23:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:01,531 INFO L93 Difference]: Finished difference Result 3508 states and 6927 transitions. [2021-06-05 12:23:01,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:23:01,531 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:23:01,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:01,534 INFO L225 Difference]: With dead ends: 3508 [2021-06-05 12:23:01,534 INFO L226 Difference]: Without dead ends: 653 [2021-06-05 12:23:01,534 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:23:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2021-06-05 12:23:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2021-06-05 12:23:01,544 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:23:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1214 transitions. [2021-06-05 12:23:01,545 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1214 transitions. Word has length 43 [2021-06-05 12:23:01,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:01,545 INFO L482 AbstractCegarLoop]: Abstraction has 653 states and 1214 transitions. [2021-06-05 12:23:01,545 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:23:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1214 transitions. [2021-06-05 12:23:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-06-05 12:23:01,545 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:01,546 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:23:01,546 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 12:23:01,546 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:23:01,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:01,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1039544105, now seen corresponding path program 1 times [2021-06-05 12:23:01,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:01,546 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147871080] [2021-06-05 12:23:01,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:01,575 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:23:01,575 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:01,575 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147871080] [2021-06-05 12:23:01,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147871080] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:23:01,575 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:23:01,575 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:23:01,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496672070] [2021-06-05 12:23:01,576 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:23:01,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:01,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:23:01,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:23:01,576 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:23:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:01,585 INFO L93 Difference]: Finished difference Result 657 states and 1218 transitions. [2021-06-05 12:23:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:23:01,585 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:23:01,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:01,587 INFO L225 Difference]: With dead ends: 657 [2021-06-05 12:23:01,587 INFO L226 Difference]: Without dead ends: 657 [2021-06-05 12:23:01,587 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:23:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2021-06-05 12:23:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 654. [2021-06-05 12:23:01,594 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:23:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1215 transitions. [2021-06-05 12:23:01,596 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1215 transitions. Word has length 43 [2021-06-05 12:23:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:01,596 INFO L482 AbstractCegarLoop]: Abstraction has 654 states and 1215 transitions. [2021-06-05 12:23:01,596 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:23:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1215 transitions. [2021-06-05 12:23:01,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 12:23:01,596 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:01,596 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:23:01,596 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 12:23:01,597 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:23:01,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:01,597 INFO L82 PathProgramCache]: Analyzing trace with hash 985402851, now seen corresponding path program 1 times [2021-06-05 12:23:01,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:01,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169381764] [2021-06-05 12:23:01,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:01,633 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:23:01,633 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:01,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169381764] [2021-06-05 12:23:01,633 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169381764] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:01,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752751710] [2021-06-05 12:23:01,634 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:23:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:01,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:23:01,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:01,777 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:23:01,778 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752751710] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:01,778 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:01,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:23:01,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931747828] [2021-06-05 12:23:01,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:23:01,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:01,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:23:01,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:23:01,779 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:23:01,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:01,807 INFO L93 Difference]: Finished difference Result 662 states and 1223 transitions. [2021-06-05 12:23:01,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:23:01,807 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:23:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:01,809 INFO L225 Difference]: With dead ends: 662 [2021-06-05 12:23:01,809 INFO L226 Difference]: Without dead ends: 662 [2021-06-05 12:23:01,809 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 21.0ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:23:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2021-06-05 12:23:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 659. [2021-06-05 12:23:01,817 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:23:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1220 transitions. [2021-06-05 12:23:01,818 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1220 transitions. Word has length 48 [2021-06-05 12:23:01,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:01,818 INFO L482 AbstractCegarLoop]: Abstraction has 659 states and 1220 transitions. [2021-06-05 12:23:01,819 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:23:01,819 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1220 transitions. [2021-06-05 12:23:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 12:23:01,819 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:01,819 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:23:02,037 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:02,037 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:23:02,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:02,038 INFO L82 PathProgramCache]: Analyzing trace with hash -2108271767, now seen corresponding path program 2 times [2021-06-05 12:23:02,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:02,038 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975946023] [2021-06-05 12:23:02,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:02,072 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:23:02,072 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:02,072 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975946023] [2021-06-05 12:23:02,072 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975946023] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:02,072 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317282694] [2021-06-05 12:23:02,072 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:23:02,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:23:02,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:23:02,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:23:02,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:02,203 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:23:02,203 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317282694] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:02,204 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:02,204 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 12:23:02,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002652517] [2021-06-05 12:23:02,204 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:23:02,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:02,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:23:02,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:23:02,204 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:23:02,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:02,244 INFO L93 Difference]: Finished difference Result 667 states and 1228 transitions. [2021-06-05 12:23:02,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 12:23:02,245 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:23:02,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:02,246 INFO L225 Difference]: With dead ends: 667 [2021-06-05 12:23:02,246 INFO L226 Difference]: Without dead ends: 667 [2021-06-05 12:23:02,246 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 39.0ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:23:02,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2021-06-05 12:23:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 664. [2021-06-05 12:23:02,254 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:23:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1225 transitions. [2021-06-05 12:23:02,255 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1225 transitions. Word has length 53 [2021-06-05 12:23:02,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:02,255 INFO L482 AbstractCegarLoop]: Abstraction has 664 states and 1225 transitions. [2021-06-05 12:23:02,255 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:23:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1225 transitions. [2021-06-05 12:23:02,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-06-05 12:23:02,256 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:02,256 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:23:02,468 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:02,469 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:23:02,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:02,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1912041053, now seen corresponding path program 3 times [2021-06-05 12:23:02,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:02,469 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21318258] [2021-06-05 12:23:02,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:02,508 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:23:02,508 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:02,508 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21318258] [2021-06-05 12:23:02,508 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21318258] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:02,508 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322905920] [2021-06-05 12:23:02,509 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:23:02,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 12:23:02,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:23:02,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:23:02,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:02,652 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:23:02,652 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322905920] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:02,652 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:02,652 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:23:02,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822350749] [2021-06-05 12:23:02,653 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:23:02,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:02,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:23:02,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:23:02,653 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:23:02,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:02,726 INFO L93 Difference]: Finished difference Result 672 states and 1233 transitions. [2021-06-05 12:23:02,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:23:02,731 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:23:02,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:02,736 INFO L225 Difference]: With dead ends: 672 [2021-06-05 12:23:02,736 INFO L226 Difference]: Without dead ends: 672 [2021-06-05 12:23:02,737 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 60.1ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:23:02,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-06-05 12:23:02,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 669. [2021-06-05 12:23:02,753 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:23:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1230 transitions. [2021-06-05 12:23:02,754 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1230 transitions. Word has length 58 [2021-06-05 12:23:02,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:02,755 INFO L482 AbstractCegarLoop]: Abstraction has 669 states and 1230 transitions. [2021-06-05 12:23:02,755 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:23:02,755 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1230 transitions. [2021-06-05 12:23:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 12:23:02,755 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:02,755 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:23:02,955 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-06-05 12:23:02,958 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:23:02,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:02,958 INFO L82 PathProgramCache]: Analyzing trace with hash 822486953, now seen corresponding path program 4 times [2021-06-05 12:23:02,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:02,958 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113280445] [2021-06-05 12:23:02,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:03,009 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:23:03,009 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:03,009 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113280445] [2021-06-05 12:23:03,009 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113280445] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:03,009 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941877733] [2021-06-05 12:23:03,009 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 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:23:03,070 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 12:23:03,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:23:03,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:23:03,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:03,168 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:23:03,168 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941877733] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:03,168 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:03,168 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:23:03,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187100990] [2021-06-05 12:23:03,169 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:23:03,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:03,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:23:03,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:23:03,169 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:23:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:03,252 INFO L93 Difference]: Finished difference Result 677 states and 1238 transitions. [2021-06-05 12:23:03,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:23:03,252 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:23:03,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:03,254 INFO L225 Difference]: With dead ends: 677 [2021-06-05 12:23:03,254 INFO L226 Difference]: Without dead ends: 677 [2021-06-05 12:23:03,254 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 86.0ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:23:03,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2021-06-05 12:23:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 674. [2021-06-05 12:23:03,262 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:23:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1235 transitions. [2021-06-05 12:23:03,264 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1235 transitions. Word has length 63 [2021-06-05 12:23:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:03,264 INFO L482 AbstractCegarLoop]: Abstraction has 674 states and 1235 transitions. [2021-06-05 12:23:03,264 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:23:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1235 transitions. [2021-06-05 12:23:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 12:23:03,264 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:03,264 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:23:03,482 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:03,483 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:23:03,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:03,483 INFO L82 PathProgramCache]: Analyzing trace with hash -447519389, now seen corresponding path program 5 times [2021-06-05 12:23:03,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:03,483 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119860406] [2021-06-05 12:23:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:03,562 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:23:03,562 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:03,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119860406] [2021-06-05 12:23:03,562 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119860406] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:03,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892501393] [2021-06-05 12:23:03,562 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 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:23:03,633 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-06-05 12:23:03,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:23:03,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 12:23:03,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:03,720 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:23:03,720 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892501393] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:03,721 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:03,721 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2021-06-05 12:23:03,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721789546] [2021-06-05 12:23:03,721 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 12:23:03,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:03,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 12:23:03,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 12:23:03,722 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:23:03,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:03,830 INFO L93 Difference]: Finished difference Result 682 states and 1243 transitions. [2021-06-05 12:23:03,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 12:23:03,831 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:23:03,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:03,833 INFO L225 Difference]: With dead ends: 682 [2021-06-05 12:23:03,833 INFO L226 Difference]: Without dead ends: 682 [2021-06-05 12:23:03,833 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 117.5ms TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2021-06-05 12:23:03,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2021-06-05 12:23:03,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 679. [2021-06-05 12:23:03,840 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:23:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1240 transitions. [2021-06-05 12:23:03,842 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1240 transitions. Word has length 68 [2021-06-05 12:23:03,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:03,842 INFO L482 AbstractCegarLoop]: Abstraction has 679 states and 1240 transitions. [2021-06-05 12:23:03,842 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:23:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1240 transitions. [2021-06-05 12:23:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 12:23:03,842 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:03,842 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:23:04,056 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:04,059 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:23:04,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:04,059 INFO L82 PathProgramCache]: Analyzing trace with hash 774482921, now seen corresponding path program 6 times [2021-06-05 12:23:04,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:04,059 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849866623] [2021-06-05 12:23:04,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:04,136 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:23:04,136 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:04,136 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849866623] [2021-06-05 12:23:04,136 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849866623] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:04,136 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790540445] [2021-06-05 12:23:04,136 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 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:23:04,208 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-06-05 12:23:04,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:23:04,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:23:04,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:04,313 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:23:04,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790540445] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:04,313 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:04,313 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:23:04,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127287821] [2021-06-05 12:23:04,313 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:23:04,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:04,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:23:04,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:23:04,314 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:23:04,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:04,467 INFO L93 Difference]: Finished difference Result 687 states and 1248 transitions. [2021-06-05 12:23:04,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:23:04,468 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:23:04,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:04,469 INFO L225 Difference]: With dead ends: 687 [2021-06-05 12:23:04,469 INFO L226 Difference]: Without dead ends: 687 [2021-06-05 12:23:04,471 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 147.2ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:23:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2021-06-05 12:23:04,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 684. [2021-06-05 12:23:04,478 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:23:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1245 transitions. [2021-06-05 12:23:04,479 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1245 transitions. Word has length 73 [2021-06-05 12:23:04,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:04,479 INFO L482 AbstractCegarLoop]: Abstraction has 684 states and 1245 transitions. [2021-06-05 12:23:04,480 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:23:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1245 transitions. [2021-06-05 12:23:04,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-05 12:23:04,480 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:04,480 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:23:04,696 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 12:23:04,696 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:23:04,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:04,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1392019747, now seen corresponding path program 7 times [2021-06-05 12:23:04,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:04,697 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128264247] [2021-06-05 12:23:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:04,804 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:23:04,804 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:04,804 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128264247] [2021-06-05 12:23:04,805 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128264247] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:04,805 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748506436] [2021-06-05 12:23:04,805 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 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:23:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:04,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:23:04,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:04,983 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:23:04,983 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748506436] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:04,983 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:04,983 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:23:04,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686019597] [2021-06-05 12:23:04,984 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:23:04,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:04,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:23:04,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:23:04,985 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:23:05,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:05,150 INFO L93 Difference]: Finished difference Result 692 states and 1253 transitions. [2021-06-05 12:23:05,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:23:05,151 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:23:05,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:05,152 INFO L225 Difference]: With dead ends: 692 [2021-06-05 12:23:05,152 INFO L226 Difference]: Without dead ends: 692 [2021-06-05 12:23:05,153 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 198.2ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:23:05,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-06-05 12:23:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 689. [2021-06-05 12:23:05,160 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:23:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1250 transitions. [2021-06-05 12:23:05,161 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1250 transitions. Word has length 78 [2021-06-05 12:23:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:05,161 INFO L482 AbstractCegarLoop]: Abstraction has 689 states and 1250 transitions. [2021-06-05 12:23:05,162 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:23:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1250 transitions. [2021-06-05 12:23:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 12:23:05,162 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:05,162 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:23:05,376 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-06-05 12:23:05,377 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:23:05,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:05,377 INFO L82 PathProgramCache]: Analyzing trace with hash -2132484055, now seen corresponding path program 8 times [2021-06-05 12:23:05,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:05,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539330440] [2021-06-05 12:23:05,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:05,510 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:23:05,510 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:05,510 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539330440] [2021-06-05 12:23:05,510 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539330440] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:05,510 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890977820] [2021-06-05 12:23:05,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:05,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:23:05,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:23:05,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 12:23:05,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:05,703 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:23:05,703 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890977820] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:05,703 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:05,703 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2021-06-05 12:23:05,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640139857] [2021-06-05 12:23:05,703 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 12:23:05,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:05,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 12:23:05,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:23:05,706 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:23:05,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:05,917 INFO L93 Difference]: Finished difference Result 697 states and 1258 transitions. [2021-06-05 12:23:05,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 12:23:05,917 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:23:05,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:05,919 INFO L225 Difference]: With dead ends: 697 [2021-06-05 12:23:05,919 INFO L226 Difference]: Without dead ends: 697 [2021-06-05 12:23:05,919 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 238.2ms TimeCoverageRelationStatistics Valid=427, Invalid=905, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 12:23:05,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-06-05 12:23:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 694. [2021-06-05 12:23:05,927 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:23:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1255 transitions. [2021-06-05 12:23:05,928 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1255 transitions. Word has length 83 [2021-06-05 12:23:05,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:05,928 INFO L482 AbstractCegarLoop]: Abstraction has 694 states and 1255 transitions. [2021-06-05 12:23:05,928 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:23:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1255 transitions. [2021-06-05 12:23:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-05 12:23:05,928 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:05,928 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:23:06,140 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-06-05 12:23:06,141 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:23:06,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:06,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1504445213, now seen corresponding path program 9 times [2021-06-05 12:23:06,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:06,141 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329516120] [2021-06-05 12:23:06,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:06,293 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:06,293 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:06,293 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329516120] [2021-06-05 12:23:06,293 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329516120] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:06,293 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086926594] [2021-06-05 12:23:06,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:06,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-06-05 12:23:06,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:23:06,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:23:06,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:06,532 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:06,532 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086926594] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:06,532 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:06,532 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:23:06,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604167813] [2021-06-05 12:23:06,533 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:23:06,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:06,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:23:06,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:23:06,534 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:23:06,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:06,759 INFO L93 Difference]: Finished difference Result 699 states and 1260 transitions. [2021-06-05 12:23:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:23:06,760 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:23:06,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:06,761 INFO L225 Difference]: With dead ends: 699 [2021-06-05 12:23:06,761 INFO L226 Difference]: Without dead ends: 699 [2021-06-05 12:23:06,762 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 288.1ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:23:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-06-05 12:23:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2021-06-05 12:23:06,775 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:23:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1260 transitions. [2021-06-05 12:23:06,776 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1260 transitions. Word has length 88 [2021-06-05 12:23:06,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:06,776 INFO L482 AbstractCegarLoop]: Abstraction has 699 states and 1260 transitions. [2021-06-05 12:23:06,776 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:23:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1260 transitions. [2021-06-05 12:23:06,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-05 12:23:06,777 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:06,777 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:23:06,992 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:06,993 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:23:06,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:06,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1822702487, now seen corresponding path program 10 times [2021-06-05 12:23:06,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:06,993 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317156220] [2021-06-05 12:23:06,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 12:23:07,017 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 12:23:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 12:23:07,032 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 12:23:07,051 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 12:23:07,051 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 12:23:07,051 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 12:23:07,051 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 12:23:07,051 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 12:23:07,051 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 12:23:07,067 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,067 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,067 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,067 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,068 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,068 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,068 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,068 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,068 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,068 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,068 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,068 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,068 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,068 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,068 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,068 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,068 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,068 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:23:07,068 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,069 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:23:07,069 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:23:07,069 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:23:07,069 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:23:07,069 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:23:07,069 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:23:07,069 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:23:07,069 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:23:07,069 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:23:07,069 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:23:07,069 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:23:07,069 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,069 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,069 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,069 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,069 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,069 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,069 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,070 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,070 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,070 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,070 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,070 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,070 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,070 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,070 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,071 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,071 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,071 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,071 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,071 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,072 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,072 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,073 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,073 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,073 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,073 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,073 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,073 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,073 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,073 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,073 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,074 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,074 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,074 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:23:07,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,074 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:23:07,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,074 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,075 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,075 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,075 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,075 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,075 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,075 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,075 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,075 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,075 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,075 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,075 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,075 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,075 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:23:07,075 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,075 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:23:07,075 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,075 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,075 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,076 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,076 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,076 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,076 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,076 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,076 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,076 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,077 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,077 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,077 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,077 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,077 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,077 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,077 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,080 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,080 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,081 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,081 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,081 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,081 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,081 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,081 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,081 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,081 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,081 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,081 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,082 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,082 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,082 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,082 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,082 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,082 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,082 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,082 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:23:07,082 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,082 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:23:07,082 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:23:07,082 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:23:07,082 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:23:07,082 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:23:07,082 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:23:07,082 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:23:07,082 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:23:07,082 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:23:07,082 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:23:07,083 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:23:07,083 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,086 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,086 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,086 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:23:07,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,086 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:23:07,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,086 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,086 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,086 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 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:23:07,087 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 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:23:07,087 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,087 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,088 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,088 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,088 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,088 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,088 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,088 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,088 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,088 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,089 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,089 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,089 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,089 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,090 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,090 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,090 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,090 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,090 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,090 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,090 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,090 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,090 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,090 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:23:07,090 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,090 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,090 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:23:07,090 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,090 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,090 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,090 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,091 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,091 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,091 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,091 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,091 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:23:07,092 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,092 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,092 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,092 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,092 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,092 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,092 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,092 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,092 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,093 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,093 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,093 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:23:07,093 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,093 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:23:07,093 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,093 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,093 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,093 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,093 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,093 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,093 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,093 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:23:07,093 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:23:07,096 INFO L149 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-06-05 12:23:07,097 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 12:23:07,097 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:23:07,098 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:23:07,098 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:23:07,098 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:23:07,098 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:23:07,098 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:23:07,098 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:23:07,098 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 12:23:07,101 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 217 places, 257 transitions, 532 flow [2021-06-05 12:23:50,001 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:23:50,455 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:23:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:23:50,455 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:50,455 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:23:50,492 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:23:50,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:50,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1772857671, now seen corresponding path program 1 times [2021-06-05 12:23:50,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:50,493 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664231284] [2021-06-05 12:23:50,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:50,500 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:23:50,500 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:50,500 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664231284] [2021-06-05 12:23:50,500 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664231284] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:23:50,501 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:23:50,501 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:23:50,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989518528] [2021-06-05 12:23:50,501 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:23:50,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:50,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:23:50,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:23:50,703 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:23:52,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:52,126 INFO L93 Difference]: Finished difference Result 195700 states and 582720 transitions. [2021-06-05 12:23:52,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:23:52,126 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:23:52,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:52,511 INFO L225 Difference]: With dead ends: 195700 [2021-06-05 12:23:52,512 INFO L226 Difference]: Without dead ends: 157169 [2021-06-05 12:23:52,512 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:23:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157169 states. [2021-06-05 12:23:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157169 to 157169. [2021-06-05 12:24:00,121 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:24:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157169 states to 157169 states and 465323 transitions. [2021-06-05 12:24:00,938 INFO L78 Accepts]: Start accepts. Automaton has 157169 states and 465323 transitions. Word has length 42 [2021-06-05 12:24:00,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:24:00,938 INFO L482 AbstractCegarLoop]: Abstraction has 157169 states and 465323 transitions. [2021-06-05 12:24:00,938 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:24:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 157169 states and 465323 transitions. [2021-06-05 12:24:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:24:00,939 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:24:00,939 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:24:00,939 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 12:24:00,939 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:24:00,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:24:00,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1839864424, now seen corresponding path program 1 times [2021-06-05 12:24:00,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:24:00,939 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66797773] [2021-06-05 12:24:00,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:24:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:24:00,954 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:24:00,955 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:24:00,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66797773] [2021-06-05 12:24:00,955 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66797773] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:24:00,955 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:24:00,955 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:24:00,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447667927] [2021-06-05 12:24:00,955 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:24:00,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:24:00,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:24:00,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:24:00,956 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:24:01,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:24:01,825 INFO L93 Difference]: Finished difference Result 157173 states and 465327 transitions. [2021-06-05 12:24:01,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:24:01,825 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:24:01,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:24:02,086 INFO L225 Difference]: With dead ends: 157173 [2021-06-05 12:24:02,087 INFO L226 Difference]: Without dead ends: 157173 [2021-06-05 12:24:02,087 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:24:07,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157173 states. [2021-06-05 12:24:09,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157173 to 157170. [2021-06-05 12:24:09,514 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:24:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157170 states to 157170 states and 465324 transitions. [2021-06-05 12:24:10,283 INFO L78 Accepts]: Start accepts. Automaton has 157170 states and 465324 transitions. Word has length 42 [2021-06-05 12:24:10,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:24:10,283 INFO L482 AbstractCegarLoop]: Abstraction has 157170 states and 465324 transitions. [2021-06-05 12:24:10,283 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:24:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 157170 states and 465324 transitions. [2021-06-05 12:24:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 12:24:10,284 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:24:10,284 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:24:10,284 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 12:24:10,284 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:24:10,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:24:10,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1214977823, now seen corresponding path program 1 times [2021-06-05 12:24:10,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:24:10,284 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418046809] [2021-06-05 12:24:10,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:24:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:24:10,301 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:24:10,301 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:24:10,301 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418046809] [2021-06-05 12:24:10,301 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418046809] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:24:10,301 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034934297] [2021-06-05 12:24:10,302 INFO L95 rtionOrderModulation]: Keeping assertion order 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:24:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:24:10,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:24:10,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:24:10,401 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:24:10,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034934297] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:24:10,402 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:24:10,402 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:24:10,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203554042] [2021-06-05 12:24:10,402 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:24:10,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:24:10,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:24:10,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:24:10,403 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:24:11,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:24:11,320 INFO L93 Difference]: Finished difference Result 157156 states and 465310 transitions. [2021-06-05 12:24:11,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:24:11,320 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:24:11,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:24:11,623 INFO L225 Difference]: With dead ends: 157156 [2021-06-05 12:24:11,623 INFO L226 Difference]: Without dead ends: 157156 [2021-06-05 12:24:11,623 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:24:17,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157156 states. [2021-06-05 12:24:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157156 to 157156. [2021-06-05 12:24:19,217 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:24:19,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157156 states to 157156 states and 465310 transitions. [2021-06-05 12:24:19,605 INFO L78 Accepts]: Start accepts. Automaton has 157156 states and 465310 transitions. Word has length 47 [2021-06-05 12:24:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:24:19,605 INFO L482 AbstractCegarLoop]: Abstraction has 157156 states and 465310 transitions. [2021-06-05 12:24:19,605 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:24:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 157156 states and 465310 transitions. [2021-06-05 12:24:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:24:19,606 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:24:19,607 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:24:19,815 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-06-05 12:24:19,815 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:24:19,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:24:19,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1783084037, now seen corresponding path program 1 times [2021-06-05 12:24:19,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:24:19,816 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352892595] [2021-06-05 12:24:19,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:24:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:24:19,839 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:24:19,839 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:24:19,839 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352892595] [2021-06-05 12:24:19,839 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352892595] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:24:19,839 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63838579] [2021-06-05 12:24:19,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:24:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:24:19,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:24:19,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:24:19,970 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:24:19,970 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63838579] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:24:19,970 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:24:19,971 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:24:19,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109097458] [2021-06-05 12:24:19,971 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:24:19,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:24:19,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:24:19,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:24:19,971 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:24:20,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:24:20,834 INFO L93 Difference]: Finished difference Result 157164 states and 465318 transitions. [2021-06-05 12:24:20,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:24:20,835 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:24:20,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:24:21,072 INFO L225 Difference]: With dead ends: 157164 [2021-06-05 12:24:21,072 INFO L226 Difference]: Without dead ends: 157164 [2021-06-05 12:24:21,072 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 19.2ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:24:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157164 states. [2021-06-05 12:24:28,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157164 to 157161. [2021-06-05 12:24:28,564 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:24:29,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157161 states to 157161 states and 465315 transitions. [2021-06-05 12:24:29,396 INFO L78 Accepts]: Start accepts. Automaton has 157161 states and 465315 transitions. Word has length 57 [2021-06-05 12:24:29,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:24:29,396 INFO L482 AbstractCegarLoop]: Abstraction has 157161 states and 465315 transitions. [2021-06-05 12:24:29,397 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:24:29,397 INFO L276 IsEmpty]: Start isEmpty. Operand 157161 states and 465315 transitions. [2021-06-05 12:24:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 12:24:29,398 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:24:29,398 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:24:29,614 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:24:29,614 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:24:29,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:24:29,615 INFO L82 PathProgramCache]: Analyzing trace with hash 116810654, now seen corresponding path program 2 times [2021-06-05 12:24:29,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:24:29,615 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934167467] [2021-06-05 12:24:29,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:24:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:24:29,638 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:24:29,638 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:24:29,638 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934167467] [2021-06-05 12:24:29,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934167467] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:24:29,638 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071793040] [2021-06-05 12:24:29,638 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 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:24:29,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:24:29,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:24:29,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:24:29,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:24:29,794 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:24:29,794 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071793040] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:24:29,794 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:24:29,795 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:24:29,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953676930] [2021-06-05 12:24:29,795 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:24:29,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:24:29,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:24:29,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:24:29,795 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:24:30,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:24:30,346 INFO L93 Difference]: Finished difference Result 155675 states and 462318 transitions. [2021-06-05 12:24:30,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:24:30,346 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:24:30,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:24:30,605 INFO L225 Difference]: With dead ends: 155675 [2021-06-05 12:24:30,606 INFO L226 Difference]: Without dead ends: 155675 [2021-06-05 12:24:30,606 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 22.7ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:24:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155675 states. [2021-06-05 12:24:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155675 to 155675. [2021-06-05 12:24:38,334 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:24:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155675 states to 155675 states and 462318 transitions. [2021-06-05 12:24:39,086 INFO L78 Accepts]: Start accepts. Automaton has 155675 states and 462318 transitions. Word has length 62 [2021-06-05 12:24:39,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:24:39,086 INFO L482 AbstractCegarLoop]: Abstraction has 155675 states and 462318 transitions. [2021-06-05 12:24:39,086 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:24:39,086 INFO L276 IsEmpty]: Start isEmpty. Operand 155675 states and 462318 transitions. [2021-06-05 12:24:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 12:24:39,089 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:24:39,089 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:24:39,289 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-06-05 12:24:39,290 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:24:39,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:24:39,290 INFO L82 PathProgramCache]: Analyzing trace with hash -357366445, now seen corresponding path program 1 times [2021-06-05 12:24:39,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:24:39,290 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687305205] [2021-06-05 12:24:39,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:24:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:24:39,321 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:24:39,321 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:24:39,321 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687305205] [2021-06-05 12:24:39,321 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687305205] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:24:39,321 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558084154] [2021-06-05 12:24:39,321 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:24:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:24:39,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:24:39,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:24:39,460 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:24:39,461 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558084154] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:24:39,461 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:24:39,461 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 12:24:39,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051507751] [2021-06-05 12:24:39,461 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:24:39,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:24:39,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:24:39,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:24:39,461 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:24:39,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:24:39,963 INFO L93 Difference]: Finished difference Result 155683 states and 462326 transitions. [2021-06-05 12:24:39,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 12:24:39,964 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:24:39,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:24:40,227 INFO L225 Difference]: With dead ends: 155683 [2021-06-05 12:24:40,227 INFO L226 Difference]: Without dead ends: 155683 [2021-06-05 12:24:40,227 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 37.3ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:24:46,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155683 states. [2021-06-05 12:24:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155683 to 155680. [2021-06-05 12:24:48,039 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:24:48,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155680 states to 155680 states and 462323 transitions. [2021-06-05 12:24:48,398 INFO L78 Accepts]: Start accepts. Automaton has 155680 states and 462323 transitions. Word has length 68 [2021-06-05 12:24:48,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:24:48,398 INFO L482 AbstractCegarLoop]: Abstraction has 155680 states and 462323 transitions. [2021-06-05 12:24:48,398 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:24:48,398 INFO L276 IsEmpty]: Start isEmpty. Operand 155680 states and 462323 transitions. [2021-06-05 12:24:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 12:24:48,401 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:24:48,401 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:24:48,601 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-06-05 12:24:48,602 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:24:48,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:24:48,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1048366106, now seen corresponding path program 2 times [2021-06-05 12:24:48,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:24:48,602 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405199003] [2021-06-05 12:24:48,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:24:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:24:48,703 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:24:48,703 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:24:48,703 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405199003] [2021-06-05 12:24:48,703 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405199003] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:24:48,703 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674278972] [2021-06-05 12:24:48,703 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 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:24:48,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 12:24:48,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:24:48,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:24:48,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:24:48,829 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:24:48,830 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:24:48,831 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:24:48,831 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:24:48,831 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:24:48,846 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:24:48,847 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:24:48,849 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:24:48,850 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:24:48,850 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:24:49,405 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:24:49,406 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:24:49,407 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:24:49,409 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:24:49,410 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:24:49,410 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:24:49,530 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:24:49,536 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:24:49,537 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:24:49,540 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:24:49,541 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:24:49,545 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:24:49,549 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:24:49,550 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:24:49,599 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 18 treesize of output 14 [2021-06-05 12:24:49,601 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:24:49,602 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:24:49,604 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:24:49,604 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:18, output treesize:10 [2021-06-05 12:24:49,642 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:24:49,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674278972] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:24:49,642 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:24:49,642 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2021-06-05 12:24:49,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344319056] [2021-06-05 12:24:49,643 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:24:49,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:24:49,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:24:49,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:24:49,643 INFO L87 Difference]: Start difference. First operand 155680 states and 462323 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 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:24:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:24:50,844 INFO L93 Difference]: Finished difference Result 203886 states and 596979 transitions. [2021-06-05 12:24:50,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:24:50,845 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 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:24:50,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:24:51,142 INFO L225 Difference]: With dead ends: 203886 [2021-06-05 12:24:51,142 INFO L226 Difference]: Without dead ends: 193630 [2021-06-05 12:24:51,143 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 775.1ms TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2021-06-05 12:24:57,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193630 states. [2021-06-05 12:24:59,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193630 to 166614. [2021-06-05 12:24:59,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166614 states, 166592 states have (on average 2.9636837303111796) internal successors, (493726), 166613 states have internal predecessors, (493726), 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:24:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166614 states to 166614 states and 493726 transitions. [2021-06-05 12:24:59,766 INFO L78 Accepts]: Start accepts. Automaton has 166614 states and 493726 transitions. Word has length 73 [2021-06-05 12:24:59,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:24:59,766 INFO L482 AbstractCegarLoop]: Abstraction has 166614 states and 493726 transitions. [2021-06-05 12:24:59,767 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 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:24:59,767 INFO L276 IsEmpty]: Start isEmpty. Operand 166614 states and 493726 transitions. [2021-06-05 12:24:59,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 12:24:59,772 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:24:59,772 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:24:59,987 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-06-05 12:24:59,988 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:24:59,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:24:59,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1717203094, now seen corresponding path program 1 times [2021-06-05 12:24:59,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:24:59,988 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533412618] [2021-06-05 12:24:59,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:25:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:25:00,032 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:25:00,032 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:25:00,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533412618] [2021-06-05 12:25:00,033 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533412618] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:00,033 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653296200] [2021-06-05 12:25:00,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:25:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:25:00,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:25:00,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:25:00,692 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:25:00,692 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653296200] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:00,692 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:25:00,693 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:25:00,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460707988] [2021-06-05 12:25:00,693 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:25:00,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:25:00,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:25:00,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:25:00,693 INFO L87 Difference]: Start difference. First operand 166614 states and 493726 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:25:01,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:25:01,243 INFO L93 Difference]: Finished difference Result 166622 states and 493734 transitions. [2021-06-05 12:25:01,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:25:01,244 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:25:01,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:25:01,497 INFO L225 Difference]: With dead ends: 166622 [2021-06-05 12:25:01,497 INFO L226 Difference]: Without dead ends: 166622 [2021-06-05 12:25:01,497 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 69.5ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:25:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166622 states. [2021-06-05 12:25:09,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166622 to 166619. [2021-06-05 12:25:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166619 states, 166597 states have (on average 2.9636247951643786) internal successors, (493731), 166618 states have internal predecessors, (493731), 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:25:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166619 states to 166619 states and 493731 transitions. [2021-06-05 12:25:10,331 INFO L78 Accepts]: Start accepts. Automaton has 166619 states and 493731 transitions. Word has length 77 [2021-06-05 12:25:10,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:25:10,331 INFO L482 AbstractCegarLoop]: Abstraction has 166619 states and 493731 transitions. [2021-06-05 12:25:10,331 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:25:10,331 INFO L276 IsEmpty]: Start isEmpty. Operand 166619 states and 493731 transitions. [2021-06-05 12:25:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 12:25:10,336 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:25:10,336 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:25:10,553 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-06-05 12:25:10,554 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:25:10,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:25:10,555 INFO L82 PathProgramCache]: Analyzing trace with hash 714176643, now seen corresponding path program 2 times [2021-06-05 12:25:10,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:25:10,555 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901240621] [2021-06-05 12:25:10,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:25:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:25:10,609 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:25:10,610 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:25:10,610 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901240621] [2021-06-05 12:25:10,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901240621] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:10,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2583680] [2021-06-05 12:25:10,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:25:10,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:25:10,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:25:10,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:25:10,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:25:10,789 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:25:10,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2583680] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:10,789 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:25:10,789 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:25:10,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283558269] [2021-06-05 12:25:10,790 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:25:10,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:25:10,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:25:10,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:25:10,790 INFO L87 Difference]: Start difference. First operand 166619 states and 493731 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:25:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:25:11,391 INFO L93 Difference]: Finished difference Result 166627 states and 493739 transitions. [2021-06-05 12:25:11,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:25:11,392 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:25:11,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:25:12,218 INFO L225 Difference]: With dead ends: 166627 [2021-06-05 12:25:12,218 INFO L226 Difference]: Without dead ends: 166627 [2021-06-05 12:25:12,219 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 102.0ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:25:18,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166627 states. [2021-06-05 12:25:20,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166627 to 166624. [2021-06-05 12:25:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166624 states, 166602 states have (on average 2.9635658635550595) internal successors, (493736), 166623 states have internal predecessors, (493736), 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:25:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166624 states to 166624 states and 493736 transitions. [2021-06-05 12:25:20,944 INFO L78 Accepts]: Start accepts. Automaton has 166624 states and 493736 transitions. Word has length 82 [2021-06-05 12:25:20,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:25:20,944 INFO L482 AbstractCegarLoop]: Abstraction has 166624 states and 493736 transitions. [2021-06-05 12:25:20,944 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:25:20,944 INFO L276 IsEmpty]: Start isEmpty. Operand 166624 states and 493736 transitions. [2021-06-05 12:25:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-05 12:25:20,962 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:25:20,962 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:25:21,162 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-06-05 12:25:21,163 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:25:21,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:25:21,163 INFO L82 PathProgramCache]: Analyzing trace with hash 945313546, now seen corresponding path program 3 times [2021-06-05 12:25:21,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:25:21,163 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705146238] [2021-06-05 12:25:21,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:25:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:25:21,245 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:25:21,245 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:25:21,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705146238] [2021-06-05 12:25:21,245 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705146238] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:21,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298246900] [2021-06-05 12:25:21,245 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 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:25:21,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 12:25:21,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:25:21,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:25:21,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:25:21,493 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:25:21,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298246900] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:21,493 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:25:21,494 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2021-06-05 12:25:21,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825391028] [2021-06-05 12:25:21,495 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 12:25:21,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:25:21,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 12:25:21,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-06-05 12:25:21,495 INFO L87 Difference]: Start difference. First operand 166624 states and 493736 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:25:21,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:25:21,840 INFO L93 Difference]: Finished difference Result 30224 states and 86237 transitions. [2021-06-05 12:25:21,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 12:25:21,853 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:25:21,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:25:21,886 INFO L225 Difference]: With dead ends: 30224 [2021-06-05 12:25:21,886 INFO L226 Difference]: Without dead ends: 23024 [2021-06-05 12:25:21,886 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 188.2ms TimeCoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2021-06-05 12:25:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23024 states. [2021-06-05 12:25:22,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23024 to 23021. [2021-06-05 12:25:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23021 states, 23018 states have (on average 2.8418628899122425) internal successors, (65414), 23020 states have internal predecessors, (65414), 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:25:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23021 states to 23021 states and 65414 transitions. [2021-06-05 12:25:22,877 INFO L78 Accepts]: Start accepts. Automaton has 23021 states and 65414 transitions. Word has length 87 [2021-06-05 12:25:22,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:25:22,877 INFO L482 AbstractCegarLoop]: Abstraction has 23021 states and 65414 transitions. [2021-06-05 12:25:22,877 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:25:22,877 INFO L276 IsEmpty]: Start isEmpty. Operand 23021 states and 65414 transitions. [2021-06-05 12:25:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-06-05 12:25:22,882 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:25:22,896 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, 1] [2021-06-05 12:25:23,099 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:25:23,100 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:25:23,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:25:23,100 INFO L82 PathProgramCache]: Analyzing trace with hash 951592861, now seen corresponding path program 1 times [2021-06-05 12:25:23,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:25:23,100 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371419960] [2021-06-05 12:25:23,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:25:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:25:23,202 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:25:23,202 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:25:23,202 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371419960] [2021-06-05 12:25:23,203 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371419960] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:23,203 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821845166] [2021-06-05 12:25:23,203 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:25:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:25:23,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:25:23,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:25:23,474 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:25:23,474 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821845166] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:23,474 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:25:23,475 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:25:23,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643027978] [2021-06-05 12:25:23,475 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:25:23,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:25:23,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:25:23,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:25:23,475 INFO L87 Difference]: Start difference. First operand 23021 states and 65414 transitions. Second operand has 17 states, 17 states have (on average 5.823529411764706) internal successors, (99), 17 states have internal predecessors, (99), 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:25:23,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:25:23,675 INFO L93 Difference]: Finished difference Result 23029 states and 65422 transitions. [2021-06-05 12:25:23,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:25:23,676 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.823529411764706) internal successors, (99), 17 states have internal predecessors, (99), 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 98 [2021-06-05 12:25:23,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:25:23,701 INFO L225 Difference]: With dead ends: 23029 [2021-06-05 12:25:23,701 INFO L226 Difference]: Without dead ends: 23029 [2021-06-05 12:25:23,701 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 159.7ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:25:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23029 states. [2021-06-05 12:25:24,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23029 to 23026. [2021-06-05 12:25:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23026 states, 23023 states have (on average 2.8414628849411456) internal successors, (65419), 23025 states have internal predecessors, (65419), 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:25:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23026 states to 23026 states and 65419 transitions. [2021-06-05 12:25:24,459 INFO L78 Accepts]: Start accepts. Automaton has 23026 states and 65419 transitions. Word has length 98 [2021-06-05 12:25:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:25:24,460 INFO L482 AbstractCegarLoop]: Abstraction has 23026 states and 65419 transitions. [2021-06-05 12:25:24,460 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 5.823529411764706) internal successors, (99), 17 states have internal predecessors, (99), 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:25:24,460 INFO L276 IsEmpty]: Start isEmpty. Operand 23026 states and 65419 transitions. [2021-06-05 12:25:24,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-06-05 12:25:24,464 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:25:24,464 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, 1] [2021-06-05 12:25:24,665 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:25:24,665 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:25:24,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:25:24,665 INFO L82 PathProgramCache]: Analyzing trace with hash -761849820, now seen corresponding path program 2 times [2021-06-05 12:25:24,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:25:24,666 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192623218] [2021-06-05 12:25:24,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:25:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:25:24,778 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:25:24,778 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:25:24,778 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192623218] [2021-06-05 12:25:24,779 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192623218] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:24,779 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809874985] [2021-06-05 12:25:24,779 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:25:24,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:25:24,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:25:24,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:25:24,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:25:24,965 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:25:24,966 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809874985] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:24,966 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:25:24,966 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:25:24,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667897774] [2021-06-05 12:25:24,966 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:25:24,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:25:24,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:25:24,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:25:24,967 INFO L87 Difference]: Start difference. First operand 23026 states and 65419 transitions. Second operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 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:25:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:25:25,162 INFO L93 Difference]: Finished difference Result 23034 states and 65427 transitions. [2021-06-05 12:25:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:25:25,163 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 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 103 [2021-06-05 12:25:25,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:25:25,189 INFO L225 Difference]: With dead ends: 23034 [2021-06-05 12:25:25,189 INFO L226 Difference]: Without dead ends: 23034 [2021-06-05 12:25:25,190 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 195.8ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:25:25,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23034 states. [2021-06-05 12:25:25,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23034 to 23031. [2021-06-05 12:25:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23031 states, 23028 states have (on average 2.8410630536737886) internal successors, (65424), 23030 states have internal predecessors, (65424), 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:25:25,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23031 states to 23031 states and 65424 transitions. [2021-06-05 12:25:25,645 INFO L78 Accepts]: Start accepts. Automaton has 23031 states and 65424 transitions. Word has length 103 [2021-06-05 12:25:25,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:25:25,645 INFO L482 AbstractCegarLoop]: Abstraction has 23031 states and 65424 transitions. [2021-06-05 12:25:25,645 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 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:25:25,645 INFO L276 IsEmpty]: Start isEmpty. Operand 23031 states and 65424 transitions. [2021-06-05 12:25:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-06-05 12:25:25,650 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:25:25,651 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, 1] [2021-06-05 12:25:25,856 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:25:25,857 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:25:25,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:25:25,857 INFO L82 PathProgramCache]: Analyzing trace with hash 619471869, now seen corresponding path program 3 times [2021-06-05 12:25:25,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:25:25,857 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434697488] [2021-06-05 12:25:25,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:25:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:25:25,973 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:25:25,973 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:25:25,973 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434697488] [2021-06-05 12:25:25,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434697488] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:25,973 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734492557] [2021-06-05 12:25:25,973 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:25:26,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:25:26,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:25:26,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-05 12:25:26,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:25:26,062 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:25:26,063 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:26,064 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:26,064 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:26,064 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:25:26,077 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:25:26,078 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:26,082 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:26,083 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:26,083 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:25:26,168 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:25:26,169 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:25:26,170 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:26,172 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:26,173 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:26,173 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:25:26,199 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:25:26,202 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:25:26,203 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:26,206 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:26,206 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:26,209 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:26,211 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:25:26,211 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:25:26,239 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:25:26,242 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:25:26,242 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:26,245 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:26,245 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:26,249 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:26,250 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:25:26,250 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:25:26,298 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 18 treesize of output 14 [2021-06-05 12:25:26,299 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:26,300 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:26,301 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:25:26,302 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:18, output treesize:10 [2021-06-05 12:25:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-06-05 12:25:26,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734492557] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:26,357 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:25:26,357 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 26 [2021-06-05 12:25:26,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724651170] [2021-06-05 12:25:26,357 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 12:25:26,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:25:26,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 12:25:26,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2021-06-05 12:25:26,358 INFO L87 Difference]: Start difference. First operand 23031 states and 65424 transitions. Second operand has 26 states, 26 states have (on average 6.153846153846154) internal successors, (160), 26 states have internal predecessors, (160), 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:25:27,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:25:27,344 INFO L93 Difference]: Finished difference Result 24475 states and 68960 transitions. [2021-06-05 12:25:27,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 12:25:27,344 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.153846153846154) internal successors, (160), 26 states have internal predecessors, (160), 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 108 [2021-06-05 12:25:27,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:25:27,365 INFO L225 Difference]: With dead ends: 24475 [2021-06-05 12:25:27,365 INFO L226 Difference]: Without dead ends: 18713 [2021-06-05 12:25:27,366 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 802.3ms TimeCoverageRelationStatistics Valid=734, Invalid=2572, Unknown=0, NotChecked=0, Total=3306 [2021-06-05 12:25:27,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18713 states. [2021-06-05 12:25:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18713 to 18710. [2021-06-05 12:25:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18710 states, 18708 states have (on average 2.8174577720761174) internal successors, (52709), 18709 states have internal predecessors, (52709), 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:25:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18710 states to 18710 states and 52709 transitions. [2021-06-05 12:25:27,719 INFO L78 Accepts]: Start accepts. Automaton has 18710 states and 52709 transitions. Word has length 108 [2021-06-05 12:25:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:25:27,719 INFO L482 AbstractCegarLoop]: Abstraction has 18710 states and 52709 transitions. [2021-06-05 12:25:27,719 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 6.153846153846154) internal successors, (160), 26 states have internal predecessors, (160), 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:25:27,719 INFO L276 IsEmpty]: Start isEmpty. Operand 18710 states and 52709 transitions. [2021-06-05 12:25:27,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-06-05 12:25:27,736 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:25:27,736 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, 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:25:27,936 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-06-05 12:25:27,936 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:25:27,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:25:27,937 INFO L82 PathProgramCache]: Analyzing trace with hash -87354783, now seen corresponding path program 1 times [2021-06-05 12:25:27,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:25:27,937 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622575696] [2021-06-05 12:25:27,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:25:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:25:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2021-06-05 12:25:27,960 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:25:27,960 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622575696] [2021-06-05 12:25:27,960 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622575696] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:25:27,960 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:25:27,961 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:25:27,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622808707] [2021-06-05 12:25:27,961 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:25:27,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:25:27,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:25:27,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:25:27,962 INFO L87 Difference]: Start difference. First operand 18710 states and 52709 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:25:28,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:25:28,026 INFO L93 Difference]: Finished difference Result 17302 states and 48151 transitions. [2021-06-05 12:25:28,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:25:28,026 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 136 [2021-06-05 12:25:28,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:25:28,045 INFO L225 Difference]: With dead ends: 17302 [2021-06-05 12:25:28,045 INFO L226 Difference]: Without dead ends: 16446 [2021-06-05 12:25:28,046 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:25:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16446 states. [2021-06-05 12:25:28,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16446 to 15918. [2021-06-05 12:25:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15918 states, 15914 states have (on average 2.7918185245695613) internal successors, (44429), 15917 states have internal predecessors, (44429), 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:25:28,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15918 states to 15918 states and 44429 transitions. [2021-06-05 12:25:28,330 INFO L78 Accepts]: Start accepts. Automaton has 15918 states and 44429 transitions. Word has length 136 [2021-06-05 12:25:28,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:25:28,331 INFO L482 AbstractCegarLoop]: Abstraction has 15918 states and 44429 transitions. [2021-06-05 12:25:28,331 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:25:28,331 INFO L276 IsEmpty]: Start isEmpty. Operand 15918 states and 44429 transitions. [2021-06-05 12:25:28,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-06-05 12:25:28,442 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:25:28,443 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, 1, 1, 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:25:28,443 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 12:25:28,443 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:25:28,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:25:28,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1126722296, now seen corresponding path program 1 times [2021-06-05 12:25:28,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:25:28,443 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539359691] [2021-06-05 12:25:28,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:25:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:25:28,609 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:25:28,609 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:25:28,609 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539359691] [2021-06-05 12:25:28,609 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539359691] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:28,609 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632111899] [2021-06-05 12:25:28,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:25:28,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:25:28,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:25:28,838 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:25:28,839 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632111899] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:28,839 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:25:28,839 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:25:28,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778685290] [2021-06-05 12:25:28,839 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:25:28,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:25:28,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:25:28,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:25:28,840 INFO L87 Difference]: Start difference. First operand 15918 states and 44429 transitions. Second operand has 23 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 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:25:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:25:29,087 INFO L93 Difference]: Finished difference Result 15923 states and 44434 transitions. [2021-06-05 12:25:29,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:25:29,088 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 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 139 [2021-06-05 12:25:29,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:25:29,104 INFO L225 Difference]: With dead ends: 15923 [2021-06-05 12:25:29,104 INFO L226 Difference]: Without dead ends: 15923 [2021-06-05 12:25:29,105 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 303.4ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:25:29,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15923 states. [2021-06-05 12:25:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15923 to 15923. [2021-06-05 12:25:29,350 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:25:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15923 states to 15923 states and 44434 transitions. [2021-06-05 12:25:29,374 INFO L78 Accepts]: Start accepts. Automaton has 15923 states and 44434 transitions. Word has length 139 [2021-06-05 12:25:29,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:25:29,374 INFO L482 AbstractCegarLoop]: Abstraction has 15923 states and 44434 transitions. [2021-06-05 12:25:29,374 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 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:25:29,374 INFO L276 IsEmpty]: Start isEmpty. Operand 15923 states and 44434 transitions. [2021-06-05 12:25:29,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-06-05 12:25:29,390 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:25:29,390 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:25:29,591 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-06-05 12:25:29,591 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:25:29,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:25:29,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1556709807, now seen corresponding path program 2 times [2021-06-05 12:25:29,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:25:29,591 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882948951] [2021-06-05 12:25:29,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:25:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:25:29,909 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:25:29,909 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:25:29,909 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882948951] [2021-06-05 12:25:29,909 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882948951] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:29,909 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957360108] [2021-06-05 12:25:29,909 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:25:30,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:25:30,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:25:30,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 12:25:30,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:25:30,025 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:25:30,026 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:30,027 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:30,027 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:30,027 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:25:30,033 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:25:30,034 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:30,037 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:30,037 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:30,037 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:25:30,123 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:25:30,123 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:25:30,125 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:30,127 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:30,128 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:30,128 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:25:30,142 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:25:30,145 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:25:30,146 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:30,149 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:30,150 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:30,153 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:30,154 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:25:30,154 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:25:30,188 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 13 treesize of output 9 [2021-06-05 12:25:30,189 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:30,195 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:30,198 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:25:30,198 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2021-06-05 12:25:30,230 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:25:30,234 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:25:30,235 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:30,238 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:30,238 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:30,243 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:30,244 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:25:30,245 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-06-05 12:25:30,288 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 12:25:30,289 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 25 treesize of output 21 [2021-06-05 12:25:30,290 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:30,293 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:30,293 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:30,293 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:17 [2021-06-05 12:25:30,367 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 24 treesize of output 19 [2021-06-05 12:25:30,368 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:30,371 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:30,373 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:25:30,373 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2021-06-05 12:25:32,400 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (not (= (* 28 c_t_funThread1of2ForFork0_~i~0) (* 28 t_funThread2of2ForFork0_~i~0))))) is different from true [2021-06-05 12:25:32,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 27 treesize of output 23 [2021-06-05 12:25:32,469 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:32,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:32,475 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-06-05 12:25:32,475 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:28 [2021-06-05 12:25:33,371 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:25:33,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957360108] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:33,372 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:25:33,372 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2021-06-05 12:25:33,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791221937] [2021-06-05 12:25:33,372 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 12:25:33,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:25:33,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 12:25:33,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=523, Unknown=2, NotChecked=46, Total=650 [2021-06-05 12:25:33,373 INFO L87 Difference]: Start difference. First operand 15923 states and 44434 transitions. Second operand has 26 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 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:25:35,241 WARN L205 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2021-06-05 12:28:54,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:28:54,227 INFO L93 Difference]: Finished difference Result 20167 states and 56071 transitions. [2021-06-05 12:28:54,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 12:28:54,235 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 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:28:54,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:28:54,255 INFO L225 Difference]: With dead ends: 20167 [2021-06-05 12:28:54,255 INFO L226 Difference]: Without dead ends: 19237 [2021-06-05 12:28:54,256 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 138 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 32246.7ms TimeCoverageRelationStatistics Valid=506, Invalid=2783, Unknown=21, NotChecked=112, Total=3422 [2021-06-05 12:28:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19237 states. [2021-06-05 12:28:54,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19237 to 17576. [2021-06-05 12:28:54,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17576 states, 17572 states have (on average 2.790519007511951) internal successors, (49035), 17575 states have internal predecessors, (49035), 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:28:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17576 states to 17576 states and 49035 transitions. [2021-06-05 12:28:54,556 INFO L78 Accepts]: Start accepts. Automaton has 17576 states and 49035 transitions. Word has length 144 [2021-06-05 12:28:54,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:28:54,557 INFO L482 AbstractCegarLoop]: Abstraction has 17576 states and 49035 transitions. [2021-06-05 12:28:54,557 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 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:28:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 17576 states and 49035 transitions. [2021-06-05 12:28:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-06-05 12:28:54,571 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:28:54,571 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:28:54,771 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-06-05 12:28:54,772 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:28:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:28:54,772 INFO L82 PathProgramCache]: Analyzing trace with hash -494349308, now seen corresponding path program 1 times [2021-06-05 12:28:54,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:28:54,772 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072207642] [2021-06-05 12:28:54,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:28:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:28:55,099 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:28:55,100 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:28:55,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072207642] [2021-06-05 12:28:55,100 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072207642] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:28:55,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513095133] [2021-06-05 12:28:55,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:28:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:28:55,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 12:28:55,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:28:55,200 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:28:55,200 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:55,202 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:55,202 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:28:55,202 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:28:55,207 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:28:55,207 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:55,210 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:55,211 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:28:55,211 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:28:55,357 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:28:55,357 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:28:55,358 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:55,361 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:55,362 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:28:55,362 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:28:55,374 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:28:55,377 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:28:55,378 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:55,381 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:55,382 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:28:55,386 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:55,387 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:28:55,387 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:28:55,415 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 13 treesize of output 9 [2021-06-05 12:28:55,416 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:55,422 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:55,424 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:28:55,424 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2021-06-05 12:28:55,458 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:28:55,462 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:28:55,463 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:55,466 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:55,467 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:28:55,472 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:55,473 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:28:55,474 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-06-05 12:28:55,520 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 12:28:55,521 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 25 treesize of output 21 [2021-06-05 12:28:55,522 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:55,526 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:55,526 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:28:55,526 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:17 [2021-06-05 12:28:55,611 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 24 treesize of output 19 [2021-06-05 12:28:55,612 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:55,616 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 24 treesize of output 19 [2021-06-05 12:28:55,617 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:55,625 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:55,630 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 12:28:55,630 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:43 [2021-06-05 12:28:56,358 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* v_prenex_1 28) |c_~#a~0.offset|) (+ v_prenex_2 1))) (<= (+ c_t_funThread2of2ForFork0_~i~0 1) v_prenex_1))) (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post39| Int)) (and (= (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post39| 1)) (select |c_#memory_int| |c_~#a~0.base|)) (<= (+ t_funThread1of2ForFork0_~i~0 1) c_t_funThread2of2ForFork0_~i~0)))) is different from true [2021-06-05 12:28:56,435 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 27 treesize of output 23 [2021-06-05 12:28:56,436 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:56,438 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 27 treesize of output 23 [2021-06-05 12:28:56,439 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:56,449 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:56,452 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2021-06-05 12:28:56,452 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:65, output treesize:51 [2021-06-05 12:28:56,522 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:28:56,523 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513095133] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:28:56,523 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:28:56,523 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 25 [2021-06-05 12:28:56,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084887111] [2021-06-05 12:28:56,523 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 12:28:56,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:28:56,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 12:28:56,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=480, Unknown=1, NotChecked=44, Total=600 [2021-06-05 12:28:56,524 INFO L87 Difference]: Start difference. First operand 17576 states and 49035 transitions. Second operand has 25 states, 25 states have (on average 5.04) internal successors, (126), 25 states have internal predecessors, (126), 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:02,667 WARN L205 SmtUtils]: Spent 4.85 s on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2021-06-05 12:29:05,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:29:05,696 INFO L93 Difference]: Finished difference Result 20048 states and 55877 transitions. [2021-06-05 12:29:05,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 12:29:05,697 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.04) internal successors, (126), 25 states have internal predecessors, (126), 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:05,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:29:05,717 INFO L225 Difference]: With dead ends: 20048 [2021-06-05 12:29:05,717 INFO L226 Difference]: Without dead ends: 19932 [2021-06-05 12:29:05,718 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 137 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 9419.9ms TimeCoverageRelationStatistics Valid=553, Invalid=2752, Unknown=5, NotChecked=112, Total=3422 [2021-06-05 12:29:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19932 states. [2021-06-05 12:29:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19932 to 18646. [2021-06-05 12:29:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18646 states, 18642 states have (on average 2.7876837249222186) internal successors, (51968), 18645 states have internal predecessors, (51968), 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:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18646 states to 18646 states and 51968 transitions. [2021-06-05 12:29:06,106 INFO L78 Accepts]: Start accepts. Automaton has 18646 states and 51968 transitions. Word has length 144 [2021-06-05 12:29:06,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:29:06,106 INFO L482 AbstractCegarLoop]: Abstraction has 18646 states and 51968 transitions. [2021-06-05 12:29:06,106 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 5.04) internal successors, (126), 25 states have internal predecessors, (126), 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:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 18646 states and 51968 transitions. [2021-06-05 12:29:06,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-06-05 12:29:06,122 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:29:06,122 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:06,322 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-06-05 12:29:06,322 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:29:06,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:29:06,323 INFO L82 PathProgramCache]: Analyzing trace with hash 139309612, now seen corresponding path program 2 times [2021-06-05 12:29:06,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:29:06,323 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106160562] [2021-06-05 12:29:06,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:29:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:29:06,669 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:06,669 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:29:06,669 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106160562] [2021-06-05 12:29:06,669 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106160562] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:29:06,670 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794373883] [2021-06-05 12:29:06,670 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 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:29:06,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:29:06,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:29:06,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 12:29:06,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:29:06,791 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:06,792 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:06,793 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:06,793 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:06,793 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:29:06,803 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:29:06,803 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:06,806 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:06,807 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:06,807 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:29:06,889 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:29:06,890 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:29:06,891 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:06,894 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:06,894 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:06,894 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:29:06,906 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:29:06,909 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:06,910 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:06,913 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:06,914 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:06,918 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:06,919 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:06,919 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:29:06,949 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 13 treesize of output 9 [2021-06-05 12:29:06,950 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:06,956 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:06,957 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:29:06,957 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2021-06-05 12:29:06,986 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:29:06,990 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:06,991 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:06,994 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:06,995 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:07,000 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:07,002 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:07,002 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-06-05 12:29:07,043 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 12:29:07,044 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 25 treesize of output 21 [2021-06-05 12:29:07,045 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:07,048 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:07,048 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:07,049 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:17 [2021-06-05 12:29:07,106 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 24 treesize of output 19 [2021-06-05 12:29:07,107 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:07,111 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 24 treesize of output 19 [2021-06-05 12:29:07,112 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:07,120 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:07,123 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 12:29:07,123 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:41 [2021-06-05 12:29:07,884 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (and (<= (+ |c_t_funThread2of2ForFork0_#t~post35| 2) v_prenex_5) (= (store ((as const (Array Int Int)) 0) (+ (* v_prenex_5 28) |c_~#a~0.offset|) (+ v_prenex_6 1)) (select |c_#memory_int| |c_~#a~0.base|)))) (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post39| Int)) (and (<= t_funThread1of2ForFork0_~i~0 |c_t_funThread2of2ForFork0_#t~post35|) (= (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post39| 1)) (select |c_#memory_int| |c_~#a~0.base|))))) is different from true [2021-06-05 12:29:08,636 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (and (<= (+ c_t_funThread2of2ForFork0_~i~0 1) v_prenex_5) (= (store ((as const (Array Int Int)) 0) (+ (* v_prenex_5 28) |c_~#a~0.offset|) (+ v_prenex_6 1)) (select |c_#memory_int| |c_~#a~0.base|)))) (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post39| Int)) (and (= (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post39| 1)) (select |c_#memory_int| |c_~#a~0.base|)) (<= (+ t_funThread1of2ForFork0_~i~0 1) c_t_funThread2of2ForFork0_~i~0)))) is different from true [2021-06-05 12:29:08,747 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 27 treesize of output 23 [2021-06-05 12:29:08,748 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:08,751 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 27 treesize of output 23 [2021-06-05 12:29:08,752 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:08,761 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:08,765 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2021-06-05 12:29:08,765 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:65, output treesize:51 [2021-06-05 12:29:08,831 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:08,832 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794373883] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:29:08,832 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:29:08,832 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 25 [2021-06-05 12:29:08,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305899058] [2021-06-05 12:29:08,832 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 12:29:08,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:29:08,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 12:29:08,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=427, Unknown=2, NotChecked=86, Total=600 [2021-06-05 12:29:08,833 INFO L87 Difference]: Start difference. First operand 18646 states and 51968 transitions. Second operand has 25 states, 25 states have (on average 4.76) internal successors, (119), 25 states have internal predecessors, (119), 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:14,806 WARN L205 SmtUtils]: Spent 4.93 s on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2021-06-05 12:29:23,555 WARN L205 SmtUtils]: Spent 7.57 s on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-06-05 12:29:31,992 WARN L205 SmtUtils]: Spent 4.69 s on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2021-06-05 12:29:35,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:29:35,290 INFO L93 Difference]: Finished difference Result 20470 states and 57058 transitions. [2021-06-05 12:29:35,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-06-05 12:29:35,290 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.76) internal successors, (119), 25 states have internal predecessors, (119), 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:35,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:29:35,307 INFO L225 Difference]: With dead ends: 20470 [2021-06-05 12:29:35,307 INFO L226 Difference]: Without dead ends: 20354 [2021-06-05 12:29:35,308 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 137 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 27511.1ms TimeCoverageRelationStatistics Valid=686, Invalid=2733, Unknown=11, NotChecked=230, Total=3660 [2021-06-05 12:29:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20354 states. [2021-06-05 12:29:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20354 to 18701. [2021-06-05 12:29:35,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18701 states, 18697 states have (on average 2.788040862170402) internal successors, (52128), 18700 states have internal predecessors, (52128), 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,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18701 states to 18701 states and 52128 transitions. [2021-06-05 12:29:35,612 INFO L78 Accepts]: Start accepts. Automaton has 18701 states and 52128 transitions. Word has length 144 [2021-06-05 12:29:35,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:29:35,612 INFO L482 AbstractCegarLoop]: Abstraction has 18701 states and 52128 transitions. [2021-06-05 12:29:35,612 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 4.76) internal successors, (119), 25 states have internal predecessors, (119), 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,612 INFO L276 IsEmpty]: Start isEmpty. Operand 18701 states and 52128 transitions. [2021-06-05 12:29:35,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-06-05 12:29:35,628 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:29:35,629 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:35,844 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-06-05 12:29:35,845 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:29:35,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:29:35,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1159773654, now seen corresponding path program 3 times [2021-06-05 12:29:35,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:29:35,845 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457393592] [2021-06-05 12:29:35,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:29:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:29:36,153 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:36,153 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:29:36,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457393592] [2021-06-05 12:29:36,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457393592] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:29:36,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181938029] [2021-06-05 12:29:36,153 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 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:29:36,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:29:36,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:29:36,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 12:29:36,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:29:36,263 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:36,264 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:36,265 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:36,265 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:36,266 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:29:36,270 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:29:36,271 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:36,274 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:36,274 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:36,275 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:29:36,352 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:29:36,352 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:29:36,354 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:36,357 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:36,357 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:36,357 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:29:36,369 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:29:36,372 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:36,373 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:36,376 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:36,377 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:36,381 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:36,382 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:36,382 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:29:36,409 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 13 treesize of output 9 [2021-06-05 12:29:36,410 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:36,417 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:36,418 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:29:36,419 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2021-06-05 12:29:36,451 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:29:36,456 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:36,457 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:36,460 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:36,461 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:36,467 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:36,468 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:36,468 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-06-05 12:29:36,510 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 12:29:36,511 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 25 treesize of output 21 [2021-06-05 12:29:36,512 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:36,516 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:36,516 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:36,516 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:17 [2021-06-05 12:29:36,568 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 24 treesize of output 19 [2021-06-05 12:29:36,569 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:36,572 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 24 treesize of output 19 [2021-06-05 12:29:36,573 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:36,583 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:36,587 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 12:29:36,587 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:41 [2021-06-05 12:29:37,368 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_10 Int) (v_prenex_9 Int)) (and (<= (+ c_t_funThread2of2ForFork0_~i~0 2) v_prenex_9) (= (store ((as const (Array Int Int)) 0) (+ |c_~#a~0.offset| (* v_prenex_9 28)) (+ v_prenex_10 1)) (select |c_#memory_int| |c_~#a~0.base|)))) (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post39| Int)) (and (= (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post39| 1)) (select |c_#memory_int| |c_~#a~0.base|)) (<= t_funThread1of2ForFork0_~i~0 c_t_funThread2of2ForFork0_~i~0)))) is different from true [2021-06-05 12:29:38,163 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_10 Int) (v_prenex_9 Int)) (and (<= (+ |c_t_funThread2of2ForFork0_#t~post35| 2) v_prenex_9) (= (store ((as const (Array Int Int)) 0) (+ |c_~#a~0.offset| (* v_prenex_9 28)) (+ v_prenex_10 1)) (select |c_#memory_int| |c_~#a~0.base|)))) (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post39| Int)) (and (<= t_funThread1of2ForFork0_~i~0 |c_t_funThread2of2ForFork0_#t~post35|) (= (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post39| 1)) (select |c_#memory_int| |c_~#a~0.base|))))) is different from true [2021-06-05 12:29:38,876 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post39| Int)) (and (= (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post39| 1)) (select |c_#memory_int| |c_~#a~0.base|)) (<= (+ t_funThread1of2ForFork0_~i~0 1) c_t_funThread2of2ForFork0_~i~0))) (exists ((v_prenex_10 Int) (v_prenex_9 Int)) (and (<= (+ c_t_funThread2of2ForFork0_~i~0 1) v_prenex_9) (= (store ((as const (Array Int Int)) 0) (+ |c_~#a~0.offset| (* v_prenex_9 28)) (+ v_prenex_10 1)) (select |c_#memory_int| |c_~#a~0.base|))))) is different from true [2021-06-05 12:29:38,967 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 27 treesize of output 23 [2021-06-05 12:29:38,968 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:38,970 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 27 treesize of output 23 [2021-06-05 12:29:38,971 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:38,981 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:38,984 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2021-06-05 12:29:38,985 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:65, output treesize:51 [2021-06-05 12:29:39,052 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:39,052 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181938029] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:29:39,052 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:29:39,052 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2021-06-05 12:29:39,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278948824] [2021-06-05 12:29:39,053 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 12:29:39,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:29:39,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 12:29:39,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=344, Unknown=3, NotChecked=120, Total=552 [2021-06-05 12:29:39,053 INFO L87 Difference]: Start difference. First operand 18701 states and 52128 transitions. Second operand has 24 states, 24 states have (on average 4.916666666666667) internal successors, (118), 24 states have internal predecessors, (118), 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:47,419 WARN L205 SmtUtils]: Spent 6.74 s on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2021-06-05 12:29:55,851 WARN L205 SmtUtils]: Spent 7.28 s on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2021-06-05 12:30:05,664 WARN L205 SmtUtils]: Spent 7.98 s on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-06-05 12:30:14,060 WARN L205 SmtUtils]: Spent 6.33 s on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2021-06-05 12:30:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:30:17,229 INFO L93 Difference]: Finished difference Result 21089 states and 58678 transitions. [2021-06-05 12:30:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 12:30:17,229 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.916666666666667) internal successors, (118), 24 states have internal predecessors, (118), 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:30:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:30:17,252 INFO L225 Difference]: With dead ends: 21089 [2021-06-05 12:30:17,252 INFO L226 Difference]: Without dead ends: 20973 [2021-06-05 12:30:17,253 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 138 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 39976.3ms TimeCoverageRelationStatistics Valid=552, Invalid=1997, Unknown=13, NotChecked=300, Total=2862 [2021-06-05 12:30:17,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20973 states. [2021-06-05 12:30:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20973 to 18811. [2021-06-05 12:30:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18811 states, 18807 states have (on average 2.788748870101558) internal successors, (52448), 18810 states have internal predecessors, (52448), 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:30:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18811 states to 18811 states and 52448 transitions. [2021-06-05 12:30:17,579 INFO L78 Accepts]: Start accepts. Automaton has 18811 states and 52448 transitions. Word has length 144 [2021-06-05 12:30:17,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:30:17,580 INFO L482 AbstractCegarLoop]: Abstraction has 18811 states and 52448 transitions. [2021-06-05 12:30:17,580 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 4.916666666666667) internal successors, (118), 24 states have internal predecessors, (118), 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:30:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 18811 states and 52448 transitions. [2021-06-05 12:30:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-06-05 12:30:17,596 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:30:17,596 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:30:17,806 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:30:17,807 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:30:17,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:30:17,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1350016790, now seen corresponding path program 4 times [2021-06-05 12:30:17,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:30:17,807 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017849027] [2021-06-05 12:30:17,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:30:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:30:21,294 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 39 [2021-06-05 12:30:21,859 WARN L205 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 38 [2021-06-05 12:30:22,189 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 2339 DAG size of output: 1133 [2021-06-05 12:30:25,298 WARN L205 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 1133 DAG size of output: 46 [2021-06-05 12:30:25,622 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 2340 DAG size of output: 1134 [2021-06-05 12:30:29,469 WARN L205 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 1134 DAG size of output: 47 [2021-06-05 12:30:30,711 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 237 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 12:30:30,712 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:30:30,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017849027] [2021-06-05 12:30:30,712 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017849027] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:30:30,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429506758] [2021-06-05 12:30:30,712 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 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:30:30,802 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 12:30:30,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:30:30,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 35 conjunts are in the unsatisfiable core [2021-06-05 12:30:30,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:30:30,818 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:30:30,819 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:30:30,820 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:30:30,820 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:30:30,820 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:30:30,880 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 12:30:30,880 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:30:30,881 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:30:30,885 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:30:30,885 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:30:30,885 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 12:30:30,966 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:30:30,967 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:30:30,972 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:30:30,973 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:30:30,973 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2021-06-05 12:30:31,122 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 12:30:31,123 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:30:31,125 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:30:31,130 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:30:31,130 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:30:31,130 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2021-06-05 12:30:31,183 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:30:31,186 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:30:31,187 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:30:31,191 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:30:31,191 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:30:31,198 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:30:31,199 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:30:31,200 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:19 [2021-06-05 12:30:31,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 12:30:31,295 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:30:31,301 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:30:31,302 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:30:31,302 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2021-06-05 12:30:31,413 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:30:31,417 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:30:31,418 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:30:31,422 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:30:31,422 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:30:31,431 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:30:31,432 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:30:31,432 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:23 [2021-06-05 12:30:31,618 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 24 treesize of output 23 [2021-06-05 12:30:31,620 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:30:31,628 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:30:31,630 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:30:31,631 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2021-06-05 12:30:31,727 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 24 treesize of output 19 [2021-06-05 12:30:31,729 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:30:31,739 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:30:31,742 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:30:31,742 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:49 [2021-06-05 12:30:31,829 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 12:30:31,829 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 32 treesize of output 24 [2021-06-05 12:30:31,831 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:30:31,836 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:30:31,838 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:30:31,838 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:51, output treesize:26 [2021-06-05 12:30:32,322 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post39| Int)) (and (= (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post39| 1)) (select |c_#memory_int| |c_~#a~0.base|)) (not (= (* 28 t_funThread1of2ForFork0_~i~0) (+ (* 28 c_t_funThread2of2ForFork0_~i~0) 28))))) is different from true [2021-06-05 12:30:32,820 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post39| Int)) (and (= (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post39| 1)) (select |c_#memory_int| |c_~#a~0.base|)) (not (= (* 28 t_funThread1of2ForFork0_~i~0) (+ (* 28 |c_t_funThread2of2ForFork0_#t~post35|) 28))))) is different from true [2021-06-05 12:30:34,848 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post39| Int)) (and (= (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post39| 1)) (select |c_#memory_int| |c_~#a~0.base|)) (not (= (* 28 t_funThread1of2ForFork0_~i~0) (* 28 c_t_funThread2of2ForFork0_~i~0))))) is different from true [2021-06-05 12:30:34,911 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 27 treesize of output 23 [2021-06-05 12:30:34,912 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:30:34,916 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:30:34,918 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-06-05 12:30:34,932 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:28 [2021-06-05 12:30:35,982 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:30:35,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429506758] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:30:35,983 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:30:35,983 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 20] total 59 [2021-06-05 12:30:35,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018074388] [2021-06-05 12:30:35,983 INFO L462 AbstractCegarLoop]: Interpolant automaton has 59 states [2021-06-05 12:30:35,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:30:35,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-06-05 12:30:35,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2848, Unknown=4, NotChecked=330, Total=3422 [2021-06-05 12:30:35,984 INFO L87 Difference]: Start difference. First operand 18811 states and 52448 transitions. Second operand has 59 states, 59 states have (on average 3.9491525423728815) internal successors, (233), 59 states have internal predecessors, (233), 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:30:39,748 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2021-06-05 12:30:40,064 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2021-06-05 12:30:40,234 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2021-06-05 12:30:40,965 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2021-06-05 12:30:41,418 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2021-06-05 12:30:44,480 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2021-06-05 12:30:46,222 WARN L205 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-06-05 12:30:50,688 WARN L205 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2021-06-05 12:30:52,850 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2021-06-05 12:30:58,370 WARN L205 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2021-06-05 12:31:02,027 WARN L205 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2021-06-05 12:32:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:32:06,032 INFO L93 Difference]: Finished difference Result 23853 states and 66719 transitions. [2021-06-05 12:32:06,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-05 12:32:06,039 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 3.9491525423728815) internal successors, (233), 59 states have internal predecessors, (233), 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:32:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:32:06,061 INFO L225 Difference]: With dead ends: 23853 [2021-06-05 12:32:06,061 INFO L226 Difference]: Without dead ends: 23688 [2021-06-05 12:32:06,064 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 131 SyntacticMatches, 7 SemanticMatches, 136 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5562 ImplicationChecksByTransitivity, 50474.4ms TimeCoverageRelationStatistics Valid=1901, Invalid=16170, Unknown=31, NotChecked=804, Total=18906 [2021-06-05 12:32:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23688 states. [2021-06-05 12:32:06,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23688 to 20154. [2021-06-05 12:32:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20154 states, 20150 states have (on average 2.7922580645161292) internal successors, (56264), 20153 states have internal predecessors, (56264), 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:32:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20154 states to 20154 states and 56264 transitions. [2021-06-05 12:32:06,396 INFO L78 Accepts]: Start accepts. Automaton has 20154 states and 56264 transitions. Word has length 144 [2021-06-05 12:32:06,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:32:06,397 INFO L482 AbstractCegarLoop]: Abstraction has 20154 states and 56264 transitions. [2021-06-05 12:32:06,397 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 59 states, 59 states have (on average 3.9491525423728815) internal successors, (233), 59 states have internal predecessors, (233), 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:32:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand 20154 states and 56264 transitions. [2021-06-05 12:32:06,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-06-05 12:32:06,413 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:32:06,414 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:32:06,614 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-06-05 12:32:06,614 INFO L430 AbstractCegarLoop]: === Iteration 21 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:32:06,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:32:06,615 INFO L82 PathProgramCache]: Analyzing trace with hash 347068610, now seen corresponding path program 5 times [2021-06-05 12:32:06,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:32:06,615 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131326159] [2021-06-05 12:32:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:32:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:32:07,356 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:32:07,356 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:32:07,356 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131326159] [2021-06-05 12:32:07,356 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131326159] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:32:07,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326145369] [2021-06-05 12:32:07,357 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 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:32:07,483 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-06-05 12:32:07,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:32:07,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 36 conjunts are in the unsatisfiable core [2021-06-05 12:32:07,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:32:07,498 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:32:07,499 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:32:07,500 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:32:07,500 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:32:07,500 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:32:07,520 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 12:32:07,520 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:32:07,521 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:32:07,525 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:32:07,525 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:32:07,525 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 12:32:07,553 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:32:07,554 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:32:07,559 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:32:07,559 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:32:07,559 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2021-06-05 12:32:07,669 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 12:32:07,670 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:32:07,671 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:32:07,676 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:32:07,676 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:32:07,677 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2021-06-05 12:32:07,711 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:32:07,714 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:32:07,715 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:32:07,718 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:32:07,719 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:32:07,725 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:32:07,726 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:32:07,726 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:19 [2021-06-05 12:32:07,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 12:32:07,775 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:32:07,782 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:32:07,782 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:32:07,782 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2021-06-05 12:32:07,855 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:32:07,860 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:32:07,860 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:32:07,864 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:32:07,864 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:32:07,872 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:32:07,873 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:32:07,874 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:23 [2021-06-05 12:32:07,943 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 24 treesize of output 23 [2021-06-05 12:32:07,951 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:32:07,956 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:32:07,957 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:32:07,957 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2021-06-05 12:32:07,996 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 24 treesize of output 19 [2021-06-05 12:32:07,997 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:32:08,002 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:32:08,008 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:32:08,008 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:39 [2021-06-05 12:32:08,082 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 31 treesize of output 26 [2021-06-05 12:32:08,083 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:32:08,089 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:32:08,092 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:32:08,092 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:39 [2021-06-05 12:32:08,222 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 12:32:08,223 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 32 treesize of output 24 [2021-06-05 12:32:08,224 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:32:08,229 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:32:08,232 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:32:08,232 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:51, output treesize:26 [2021-06-05 12:32:08,730 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post39| Int)) (and (= (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post39| 1)) (select |c_#memory_int| |c_~#a~0.base|)) (not (= (* 28 t_funThread1of2ForFork0_~i~0) (+ (* 28 c_t_funThread2of2ForFork0_~i~0) 28))))) is different from true [2021-06-05 12:32:09,234 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post39| Int)) (and (= (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post39| 1)) (select |c_#memory_int| |c_~#a~0.base|)) (not (= (* 28 t_funThread1of2ForFork0_~i~0) (+ (* 28 |c_t_funThread2of2ForFork0_#t~post35|) 28))))) is different from true [2021-06-05 12:32:11,254 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post39| Int)) (and (= (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post39| 1)) (select |c_#memory_int| |c_~#a~0.base|)) (not (= (* 28 t_funThread1of2ForFork0_~i~0) (* 28 c_t_funThread2of2ForFork0_~i~0))))) is different from true [2021-06-05 12:32:11,295 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 27 treesize of output 23 [2021-06-05 12:32:11,296 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:32:11,300 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:32:11,302 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-06-05 12:32:11,302 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:28 [2021-06-05 12:32:12,286 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:32:12,287 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326145369] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:32:12,287 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:32:12,287 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21] total 46 [2021-06-05 12:32:12,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797015914] [2021-06-05 12:32:12,287 INFO L462 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-06-05 12:32:12,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:32:12,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-06-05 12:32:12,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1557, Unknown=4, NotChecked=252, Total=2070 [2021-06-05 12:32:12,288 INFO L87 Difference]: Start difference. First operand 20154 states and 56264 transitions. Second operand has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 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:32:23,693 WARN L205 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2021-06-05 12:32:28,530 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2021-06-05 12:32:32,239 WARN L205 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2021-06-05 12:32:36,398 WARN L205 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2021-06-05 12:34:36,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:34:36,538 INFO L93 Difference]: Finished difference Result 25323 states and 70502 transitions. [2021-06-05 12:34:36,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 12:34:36,546 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 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:34:36,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:34:36,576 INFO L225 Difference]: With dead ends: 25323 [2021-06-05 12:34:36,576 INFO L226 Difference]: Without dead ends: 25111 [2021-06-05 12:34:36,577 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1937 ImplicationChecksByTransitivity, 55431.2ms TimeCoverageRelationStatistics Valid=997, Invalid=5304, Unknown=31, NotChecked=474, Total=6806 [2021-06-05 12:34:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25111 states. [2021-06-05 12:34:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25111 to 20708. [2021-06-05 12:34:36,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20708 states, 20704 states have (on average 2.795208655332303) internal successors, (57872), 20707 states have internal predecessors, (57872), 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:34:36,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20708 states to 20708 states and 57872 transitions. [2021-06-05 12:34:36,966 INFO L78 Accepts]: Start accepts. Automaton has 20708 states and 57872 transitions. Word has length 144 [2021-06-05 12:34:36,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:34:36,966 INFO L482 AbstractCegarLoop]: Abstraction has 20708 states and 57872 transitions. [2021-06-05 12:34:36,966 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 4.0) internal successors, (184), 46 states have internal predecessors, (184), 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:34:36,966 INFO L276 IsEmpty]: Start isEmpty. Operand 20708 states and 57872 transitions. [2021-06-05 12:34:36,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-06-05 12:34:36,984 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:34:36,989 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:34:37,205 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2021-06-05 12:34:37,205 INFO L430 AbstractCegarLoop]: === Iteration 22 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:34:37,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:34:37,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1766314184, now seen corresponding path program 6 times [2021-06-05 12:34:37,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:34:37,205 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064078900] [2021-06-05 12:34:37,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:34:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:34:38,356 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:34:38,357 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:34:38,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064078900] [2021-06-05 12:34:38,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064078900] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:34:38,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727531710] [2021-06-05 12:34:38,357 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 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:34:38,449 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 12:34:38,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:34:38,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 36 conjunts are in the unsatisfiable core [2021-06-05 12:34:38,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:34:38,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 6 treesize of output 5 [2021-06-05 12:34:38,489 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:34:38,491 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:34:38,491 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:34:38,491 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:34:38,510 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 12:34:38,510 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:34:38,512 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:34:38,516 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:34:38,516 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:34:38,516 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 12:34:38,553 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:34:38,553 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:34:38,559 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:34:38,559 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:34:38,559 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2021-06-05 12:34:38,669 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 12:34:38,669 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:34:38,671 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:34:38,676 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:34:38,676 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:34:38,677 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2021-06-05 12:34:38,711 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:34:38,714 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:34:38,715 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:34:38,718 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:34:38,719 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:34:38,726 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:34:38,727 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:34:38,727 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:19 [2021-06-05 12:34:38,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 12:34:38,784 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:34:38,793 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:34:38,794 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:34:38,794 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2021-06-05 12:34:38,877 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:34:38,882 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:34:38,883 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:34:38,887 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:34:38,887 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:34:38,897 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:34:38,898 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:34:38,898 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:23 [2021-06-05 12:34:38,966 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 24 treesize of output 23 [2021-06-05 12:34:38,969 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:34:38,975 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:34:38,976 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:34:38,976 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2021-06-05 12:34:39,016 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 24 treesize of output 19 [2021-06-05 12:34:39,017 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:34:39,024 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:34:39,026 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:34:39,026 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:39 [2021-06-05 12:34:39,164 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 31 treesize of output 26 [2021-06-05 12:34:39,165 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:34:39,175 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:34:39,177 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:34:39,178 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:49 [2021-06-05 12:34:39,259 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 12:34:39,259 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 32 treesize of output 24 [2021-06-05 12:34:39,262 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:34:39,272 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:34:39,274 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:34:39,274 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:51, output treesize:26 [2021-06-05 12:34:39,838 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post39| Int)) (and (= (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post39| 1)) (select |c_#memory_int| |c_~#a~0.base|)) (not (= (* 28 t_funThread1of2ForFork0_~i~0) (+ (* 28 c_t_funThread2of2ForFork0_~i~0) 28))))) is different from true [2021-06-05 12:34:40,405 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post39| Int)) (and (= (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post39| 1)) (select |c_#memory_int| |c_~#a~0.base|)) (not (= (* 28 t_funThread1of2ForFork0_~i~0) (+ (* 28 |c_t_funThread2of2ForFork0_#t~post35|) 28))))) is different from true [2021-06-05 12:34:42,428 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post39| Int)) (and (= (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post39| 1)) (select |c_#memory_int| |c_~#a~0.base|)) (not (= (* 28 t_funThread1of2ForFork0_~i~0) (* 28 c_t_funThread2of2ForFork0_~i~0))))) is different from true [2021-06-05 12:34:42,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 27 treesize of output 23 [2021-06-05 12:34:42,469 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:34:42,474 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:34:42,476 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-06-05 12:34:42,476 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:28 [2021-06-05 12:34:43,691 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:34:43,691 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727531710] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:34:43,692 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:34:43,692 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 45 [2021-06-05 12:34:43,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184141617] [2021-06-05 12:34:43,692 INFO L462 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-06-05 12:34:43,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:34:43,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-06-05 12:34:43,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1471, Unknown=4, NotChecked=246, Total=1980 [2021-06-05 12:34:43,693 INFO L87 Difference]: Start difference. First operand 20708 states and 57872 transitions. Second operand has 45 states, 45 states have (on average 4.088888888888889) internal successors, (184), 45 states have internal predecessors, (184), 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:34:47,410 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2021-06-05 12:35:03,554 WARN L205 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2021-06-05 12:35:09,260 WARN L205 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2021-06-05 12:35:13,473 WARN L205 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2021-06-05 12:35:19,431 WARN L205 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2021-06-05 12:36:38,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:36:38,540 INFO L93 Difference]: Finished difference Result 26895 states and 74906 transitions. [2021-06-05 12:36:38,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-06-05 12:36:38,548 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 4.088888888888889) internal successors, (184), 45 states have internal predecessors, (184), 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:36:38,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:36:38,583 INFO L225 Difference]: With dead ends: 26895 [2021-06-05 12:36:38,583 INFO L226 Difference]: Without dead ends: 26632 [2021-06-05 12:36:38,584 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2408 ImplicationChecksByTransitivity, 58189.4ms TimeCoverageRelationStatistics Valid=1180, Invalid=6285, Unknown=29, NotChecked=516, Total=8010 [2021-06-05 12:36:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26632 states. [2021-06-05 12:36:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26632 to 20677. [2021-06-05 12:36:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20677 states, 20673 states have (on average 2.7949015624244185) internal successors, (57779), 20676 states have internal predecessors, (57779), 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:36:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20677 states to 20677 states and 57779 transitions. [2021-06-05 12:36:38,983 INFO L78 Accepts]: Start accepts. Automaton has 20677 states and 57779 transitions. Word has length 144 [2021-06-05 12:36:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:36:38,983 INFO L482 AbstractCegarLoop]: Abstraction has 20677 states and 57779 transitions. [2021-06-05 12:36:38,983 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 4.088888888888889) internal successors, (184), 45 states have internal predecessors, (184), 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:36:38,983 INFO L276 IsEmpty]: Start isEmpty. Operand 20677 states and 57779 transitions. [2021-06-05 12:36:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-06-05 12:36:39,003 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:36:39,003 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:36:39,216 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:36:39,217 INFO L430 AbstractCegarLoop]: === Iteration 23 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:36:39,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:36:39,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1109691617, now seen corresponding path program 3 times [2021-06-05 12:36:39,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:36:39,217 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700958251] [2021-06-05 12:36:39,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:36:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:36:39,641 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:36:39,641 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:36:39,641 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700958251] [2021-06-05 12:36:39,641 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700958251] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:36:39,641 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854306701] [2021-06-05 12:36:39,641 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 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:36:39,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:36:39,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:36:39,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 12:36:39,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:36:39,743 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:36:39,744 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:36:39,746 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:36:39,746 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:36:39,746 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:36:39,751 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:36:39,752 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:36:39,755 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:36:39,756 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:36:39,756 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:36:39,832 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:36:39,833 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:36:39,834 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:36:39,838 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:36:39,838 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:36:39,838 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:36:39,850 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:36:39,853 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:36:39,854 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:36:39,858 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:36:39,858 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:36:39,863 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:36:39,864 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:36:39,864 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:36:39,892 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 13 treesize of output 9 [2021-06-05 12:36:39,893 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:36:39,900 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:36:39,902 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:36:39,902 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2021-06-05 12:36:39,933 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:36:39,937 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:36:39,938 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:36:39,942 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:36:39,942 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:36:39,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:36:39,950 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:36:39,950 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:19 [2021-06-05 12:36:39,996 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 12:36:39,996 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 25 treesize of output 21 [2021-06-05 12:36:39,998 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:36:40,001 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:36:40,002 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:36:40,002 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2021-06-05 12:36:40,054 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 24 treesize of output 19 [2021-06-05 12:36:40,055 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:36:40,059 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 24 treesize of output 19 [2021-06-05 12:36:40,059 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:36:40,070 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:36:40,073 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 12:36:40,073 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:41 [2021-06-05 12:36:40,952 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (<= (+ |c_t_funThread1of2ForFork0_#t~post35| 2) t_funThread2of2ForFork0_~i~0))) (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (<= v_prenex_13 |c_t_funThread1of2ForFork0_#t~post35|) (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* v_prenex_13 28) |c_~#a~0.offset|) (+ v_prenex_14 1)))))) is different from true [2021-06-05 12:36:41,820 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post39| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post39| 1))) (<= (+ c_t_funThread1of2ForFork0_~i~0 1) t_funThread2of2ForFork0_~i~0))) (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* v_prenex_13 28) |c_~#a~0.offset|) (+ v_prenex_14 1))) (<= (+ v_prenex_13 1) c_t_funThread1of2ForFork0_~i~0)))) is different from true [2021-06-05 12:36:41,897 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 27 treesize of output 23 [2021-06-05 12:36:41,898 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:36:41,901 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 27 treesize of output 23 [2021-06-05 12:36:41,902 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:36:41,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:36:41,916 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2021-06-05 12:36:41,916 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:65, output treesize:51 [2021-06-05 12:36:41,999 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:36:41,999 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854306701] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:36:41,999 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:36:41,999 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 25 [2021-06-05 12:36:41,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015996199] [2021-06-05 12:36:41,999 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 12:36:41,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:36:42,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 12:36:42,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=427, Unknown=2, NotChecked=86, Total=600 [2021-06-05 12:36:42,000 INFO L87 Difference]: Start difference. First operand 20677 states and 57779 transitions. Second operand has 25 states, 25 states have (on average 4.76) internal successors, (119), 25 states have internal predecessors, (119), 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:36:50,828 WARN L205 SmtUtils]: Spent 7.58 s on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2021-06-05 12:37:02,515 WARN L205 SmtUtils]: Spent 9.03 s on a formula simplification. DAG size of input: 61 DAG size of output: 49 Received shutdown request... [2021-06-05 12:37:03,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 12:37:03,867 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2021-06-05 12:37:03,867 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 12:37:03,867 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT (1/2) [2021-06-05 12:37:03,868 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 12:37:03,868 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:37:03,868 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:37:03,868 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:37:03,868 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:37:03,868 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:37:03,868 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:37:03,868 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:37:03,868 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 12:37:03,869 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 217 places, 257 transitions, 532 flow [2021-06-05 12:37:03,870 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 12:37:03,870 INFO L315 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2021-06-05 12:37:03,870 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2021-06-05 12:37:03,871 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 12:37:03,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 12:37:03 BasicIcfg [2021-06-05 12:37:03,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 12:37:03,872 INFO L168 Benchmark]: Toolchain (without parser) took 847485.20 ms. Allocated memory was 379.6 MB in the beginning and 15.2 GB in the end (delta: 14.8 GB). Free memory was 341.7 MB in the beginning and 9.8 GB in the end (delta: -9.5 GB). Peak memory consumption was 5.4 GB. Max. memory is 16.0 GB. [2021-06-05 12:37:03,872 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 379.6 MB. Free memory was 360.6 MB in the beginning and 360.6 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 12:37:03,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 535.45 ms. Allocated memory is still 379.6 MB. Free memory was 341.5 MB in the beginning and 319.0 MB in the end (delta: 22.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:37:03,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.03 ms. Allocated memory is still 379.6 MB. Free memory was 319.0 MB in the beginning and 315.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-05 12:37:03,872 INFO L168 Benchmark]: Boogie Preprocessor took 42.06 ms. Allocated memory is still 379.6 MB. Free memory was 315.9 MB in the beginning and 313.8 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:37:03,873 INFO L168 Benchmark]: RCFGBuilder took 633.74 ms. Allocated memory is still 379.6 MB. Free memory was 313.8 MB in the beginning and 277.1 MB in the end (delta: 36.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.0 GB. [2021-06-05 12:37:03,873 INFO L168 Benchmark]: TraceAbstraction took 846208.61 ms. Allocated memory was 379.6 MB in the beginning and 15.2 GB in the end (delta: 14.8 GB). Free memory was 276.0 MB in the beginning and 9.8 GB in the end (delta: -9.5 GB). Peak memory consumption was 5.3 GB. Max. memory is 16.0 GB. [2021-06-05 12:37:03,873 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.11 ms. Allocated memory is still 379.6 MB. Free memory was 360.6 MB in the beginning and 360.6 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 535.45 ms. Allocated memory is still 379.6 MB. Free memory was 341.5 MB in the beginning and 319.0 MB in the end (delta: 22.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 60.03 ms. Allocated memory is still 379.6 MB. Free memory was 319.0 MB in the beginning and 315.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 42.06 ms. Allocated memory is still 379.6 MB. Free memory was 315.9 MB in the beginning and 313.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 633.74 ms. Allocated memory is still 379.6 MB. Free memory was 313.8 MB in the beginning and 277.1 MB in the end (delta: 36.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 846208.61 ms. Allocated memory was 379.6 MB in the beginning and 15.2 GB in the end (delta: 14.8 GB). Free memory was 276.0 MB in the beginning and 9.8 GB in the end (delta: -9.5 GB). Peak memory consumption was 5.3 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 (20677states) and FLOYD_HOARE automaton (currently 31 states, 25 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 52 known predicates. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (20677states) and FLOYD_HOARE automaton (currently 31 states, 25 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 52 known predicates. - 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: 3647.3ms, OverallIterations: 7, TraceHistogramMax: 3, EmptinessCheckTime: 40.3ms, AutomataDifference: 401.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 106.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 903 SDtfs, 652 SDslu, 1688 SDs, 0 SdLazy, 161 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 96.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 350 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 266.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3627occurred in iteration=0, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 241.6ms AutomataMinimizationTime, 7 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 115.0ms SsaConstructionTime, 182.6ms SatisfiabilityAnalysisTime, 1058.7ms InterpolantComputationTime, 698 NumberOfCodeBlocks, 683 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 686 ConstructedInterpolants, 1 QuantifiedInterpolants, 1318 SizeOfPredicates, 18 NumberOfNonLiveVariables, 695 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 35/72 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: 836769.6ms, OverallIterations: 23, TraceHistogramMax: 10, EmptinessCheckTime: 765.3ms, AutomataDifference: 658649.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 42903.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6675 SDtfs, 15007 SDslu, 66069 SDs, 0 SdLazy, 18131 SolverSat, 1084 SolverUnsat, 202 SolverUnknown, 0 SolverNotchecked, 380819.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2959 GetRequests, 2061 SyntacticMatches, 39 SemanticMatches, 858 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 15949 ImplicationChecksByTransitivity, 297973.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=205977occurred in iteration=0, InterpolantAutomatonStates: 539, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 81306.2ms AutomataMinimizationTime, 22 MinimizatonAttempts, 48225 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 303.5ms SsaConstructionTime, 1001.6ms SatisfiabilityAnalysisTime, 46219.6ms InterpolantComputationTime, 4526 NumberOfCodeBlocks, 4331 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 4483 ConstructedInterpolants, 104 QuantifiedInterpolants, 44150 SizeOfPredicates, 274 NumberOfNonLiveVariables, 4135 ConjunctsInSsa, 373 ConjunctsInUnsatCore, 43 InterpolantComputations, 5 PerfectInterpolantSequences, 4119/5492 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: 5616.3ms, OverallIterations: 12, TraceHistogramMax: 10, EmptinessCheckTime: 7.6ms, AutomataDifference: 1170.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 46.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1118 SDtfs, 174 SDslu, 8791 SDs, 0 SdLazy, 648 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 303.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 815 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 1197.3ms 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: 110.5ms AutomataMinimizationTime, 11 MinimizatonAttempts, 27 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 94.6ms SsaConstructionTime, 305.1ms SatisfiabilityAnalysisTime, 1509.0ms 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: 1.9ms, 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