./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_lazy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_lazy.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 06:19:54,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 06:19:54,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 06:19:54,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 06:19:54,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 06:19:54,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 06:19:54,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 06:19:54,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 06:19:54,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 06:19:54,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 06:19:54,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 06:19:54,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 06:19:54,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 06:19:54,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 06:19:54,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 06:19:54,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 06:19:54,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 06:19:54,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 06:19:54,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 06:19:54,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 06:19:54,152 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 06:19:54,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 06:19:54,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 06:19:54,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 06:19:54,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 06:19:54,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 06:19:54,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 06:19:54,168 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 06:19:54,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 06:19:54,169 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 06:19:54,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 06:19:54,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 06:19:54,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 06:19:54,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 06:19:54,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 06:19:54,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 06:19:54,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 06:19:54,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 06:19:54,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 06:19:54,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 06:19:54,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 06:19:54,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 06:19:54,180 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 06:19:54,218 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 06:19:54,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 06:19:54,219 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 06:19:54,219 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 06:19:54,220 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 06:19:54,220 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 06:19:54,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 06:19:54,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 06:19:54,221 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 06:19:54,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 06:19:54,222 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 06:19:54,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 06:19:54,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 06:19:54,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 06:19:54,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 06:19:54,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 06:19:54,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 06:19:54,223 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 06:19:54,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 06:19:54,224 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 06:19:54,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 06:19:54,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 06:19:54,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 06:19:54,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 06:19:54,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 06:19:54,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 06:19:54,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 06:19:54,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 06:19:54,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 06:19:54,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 06:19:54,226 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 06:19:54,226 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 06:19:54,226 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 06:19:54,227 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f [2022-07-21 06:19:54,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 06:19:54,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 06:19:54,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 06:19:54,594 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 06:19:54,595 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 06:19:54,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lazy.i [2022-07-21 06:19:54,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/544e7dbbe/5d652df48e894eb9a4264d3379084c53/FLAG896745fcb [2022-07-21 06:19:55,235 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 06:19:55,236 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2022-07-21 06:19:55,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/544e7dbbe/5d652df48e894eb9a4264d3379084c53/FLAG896745fcb [2022-07-21 06:19:55,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/544e7dbbe/5d652df48e894eb9a4264d3379084c53 [2022-07-21 06:19:55,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 06:19:55,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 06:19:55,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 06:19:55,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 06:19:55,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 06:19:55,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 06:19:55" (1/1) ... [2022-07-21 06:19:55,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a81f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:19:55, skipping insertion in model container [2022-07-21 06:19:55,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 06:19:55" (1/1) ... [2022-07-21 06:19:55,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 06:19:55,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 06:19:55,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2022-07-21 06:19:56,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 06:19:56,064 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 06:19:56,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2022-07-21 06:19:56,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 06:19:56,197 INFO L208 MainTranslator]: Completed translation [2022-07-21 06:19:56,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:19:56 WrapperNode [2022-07-21 06:19:56,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 06:19:56,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 06:19:56,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 06:19:56,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 06:19:56,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:19:56" (1/1) ... [2022-07-21 06:19:56,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:19:56" (1/1) ... [2022-07-21 06:19:56,314 INFO L137 Inliner]: procedures = 145, calls = 212, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 514 [2022-07-21 06:19:56,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 06:19:56,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 06:19:56,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 06:19:56,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 06:19:56,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:19:56" (1/1) ... [2022-07-21 06:19:56,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:19:56" (1/1) ... [2022-07-21 06:19:56,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:19:56" (1/1) ... [2022-07-21 06:19:56,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:19:56" (1/1) ... [2022-07-21 06:19:56,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:19:56" (1/1) ... [2022-07-21 06:19:56,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:19:56" (1/1) ... [2022-07-21 06:19:56,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:19:56" (1/1) ... [2022-07-21 06:19:56,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 06:19:56,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 06:19:56,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 06:19:56,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 06:19:56,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:19:56" (1/1) ... [2022-07-21 06:19:56,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 06:19:56,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:19:56,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 06:19:56,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 06:19:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 06:19:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 06:19:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 06:19:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 06:19:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 06:19:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-21 06:19:56,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-21 06:19:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-21 06:19:56,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-21 06:19:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 06:19:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-21 06:19:56,490 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-21 06:19:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-21 06:19:56,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-21 06:19:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 06:19:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 06:19:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-21 06:19:56,490 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-21 06:19:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 06:19:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-21 06:19:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-21 06:19:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 06:19:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 06:19:56,684 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 06:19:56,685 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 06:19:57,066 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2022-07-21 06:19:57,067 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != ~__CS_ret~0 % 256); [2022-07-21 06:19:57,067 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2022-07-21 06:19:57,067 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !(0 != ~__CS_ret~0 % 256); [2022-07-21 06:19:57,067 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: SUMMARY for call __CS_cs(); srcloc: null [2022-07-21 06:19:57,067 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2022-07-21 06:19:57,068 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume !(0 != ~__CS_ret~0 % 256); [2022-07-21 06:19:57,795 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 06:19:57,802 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 06:19:57,802 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-21 06:19:57,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 06:19:57 BoogieIcfgContainer [2022-07-21 06:19:57,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 06:19:57,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 06:19:57,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 06:19:57,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 06:19:57,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 06:19:55" (1/3) ... [2022-07-21 06:19:57,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642b6530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 06:19:57, skipping insertion in model container [2022-07-21 06:19:57,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:19:56" (2/3) ... [2022-07-21 06:19:57,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642b6530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 06:19:57, skipping insertion in model container [2022-07-21 06:19:57,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 06:19:57" (3/3) ... [2022-07-21 06:19:57,811 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2022-07-21 06:19:57,827 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 06:19:57,828 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 06:19:57,888 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 06:19:57,894 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7559feb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@573bb8 [2022-07-21 06:19:57,895 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 06:19:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 119 states have (on average 1.495798319327731) internal successors, (178), 120 states have internal predecessors, (178), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-21 06:19:57,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 06:19:57,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:19:57,916 INFO L195 NwaCegarLoop]: 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] [2022-07-21 06:19:57,917 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:19:57,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:19:57,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1643557001, now seen corresponding path program 1 times [2022-07-21 06:19:57,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:19:57,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131000451] [2022-07-21 06:19:57,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:19:57,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:19:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:19:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 06:19:58,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:19:58,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131000451] [2022-07-21 06:19:58,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131000451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:19:58,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:19:58,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 06:19:58,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569028335] [2022-07-21 06:19:58,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:19:58,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 06:19:58,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:19:58,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 06:19:58,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 06:19:58,403 INFO L87 Difference]: Start difference. First operand has 164 states, 119 states have (on average 1.495798319327731) internal successors, (178), 120 states have internal predecessors, (178), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 06:19:58,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:19:58,512 INFO L93 Difference]: Finished difference Result 331 states and 539 transitions. [2022-07-21 06:19:58,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 06:19:58,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-07-21 06:19:58,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:19:58,524 INFO L225 Difference]: With dead ends: 331 [2022-07-21 06:19:58,525 INFO L226 Difference]: Without dead ends: 165 [2022-07-21 06:19:58,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 06:19:58,536 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 5 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:19:58,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 464 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:19:58,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-21 06:19:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2022-07-21 06:19:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 117 states have internal predecessors, (160), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-21 06:19:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 234 transitions. [2022-07-21 06:19:58,591 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 234 transitions. Word has length 34 [2022-07-21 06:19:58,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:19:58,591 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 234 transitions. [2022-07-21 06:19:58,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 06:19:58,591 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2022-07-21 06:19:58,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 06:19:58,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:19:58,596 INFO L195 NwaCegarLoop]: 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] [2022-07-21 06:19:58,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 06:19:58,596 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:19:58,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:19:58,597 INFO L85 PathProgramCache]: Analyzing trace with hash -883018881, now seen corresponding path program 1 times [2022-07-21 06:19:58,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:19:58,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419968297] [2022-07-21 06:19:58,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:19:58,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:19:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:19:58,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 06:19:58,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:19:58,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419968297] [2022-07-21 06:19:58,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419968297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:19:58,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:19:58,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 06:19:58,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021585630] [2022-07-21 06:19:58,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:19:58,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 06:19:58,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:19:58,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 06:19:58,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 06:19:58,695 INFO L87 Difference]: Start difference. First operand 161 states and 234 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 06:19:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:19:58,751 INFO L93 Difference]: Finished difference Result 321 states and 468 transitions. [2022-07-21 06:19:58,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 06:19:58,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-07-21 06:19:58,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:19:58,755 INFO L225 Difference]: With dead ends: 321 [2022-07-21 06:19:58,755 INFO L226 Difference]: Without dead ends: 163 [2022-07-21 06:19:58,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 06:19:58,757 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 1 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:19:58,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 459 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:19:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-21 06:19:58,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2022-07-21 06:19:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 118 states have (on average 1.3644067796610169) internal successors, (161), 118 states have internal predecessors, (161), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-21 06:19:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 235 transitions. [2022-07-21 06:19:58,772 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 235 transitions. Word has length 38 [2022-07-21 06:19:58,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:19:58,773 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 235 transitions. [2022-07-21 06:19:58,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 06:19:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 235 transitions. [2022-07-21 06:19:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-21 06:19:58,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:19:58,776 INFO L195 NwaCegarLoop]: 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] [2022-07-21 06:19:58,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 06:19:58,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:19:58,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:19:58,777 INFO L85 PathProgramCache]: Analyzing trace with hash -786448707, now seen corresponding path program 1 times [2022-07-21 06:19:58,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:19:58,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333490947] [2022-07-21 06:19:58,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:19:58,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:19:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:19:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 06:19:58,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:19:58,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333490947] [2022-07-21 06:19:58,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333490947] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:19:58,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178334554] [2022-07-21 06:19:58,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:19:58,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:19:58,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:19:58,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:19:58,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 06:19:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:19:59,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 06:19:59,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:19:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 06:19:59,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:19:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 06:19:59,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178334554] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:19:59,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 06:19:59,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-21 06:19:59,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102043894] [2022-07-21 06:19:59,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 06:19:59,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 06:19:59,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:19:59,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 06:19:59,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-21 06:19:59,412 INFO L87 Difference]: Start difference. First operand 162 states and 235 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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) [2022-07-21 06:19:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:19:59,461 INFO L93 Difference]: Finished difference Result 327 states and 476 transitions. [2022-07-21 06:19:59,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 06:19:59,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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 40 [2022-07-21 06:19:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:19:59,473 INFO L225 Difference]: With dead ends: 327 [2022-07-21 06:19:59,473 INFO L226 Difference]: Without dead ends: 168 [2022-07-21 06:19:59,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-21 06:19:59,479 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 6 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:19:59,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 687 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:19:59,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-21 06:19:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-21 06:19:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 124 states have (on average 1.346774193548387) internal successors, (167), 124 states have internal predecessors, (167), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-21 06:19:59,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 241 transitions. [2022-07-21 06:19:59,509 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 241 transitions. Word has length 40 [2022-07-21 06:19:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:19:59,509 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 241 transitions. [2022-07-21 06:19:59,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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) [2022-07-21 06:19:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 241 transitions. [2022-07-21 06:19:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 06:19:59,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:19:59,515 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:19:59,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 06:19:59,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:19:59,733 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:19:59,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:19:59,734 INFO L85 PathProgramCache]: Analyzing trace with hash 386454391, now seen corresponding path program 2 times [2022-07-21 06:19:59,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:19:59,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73118359] [2022-07-21 06:19:59,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:19:59,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:19:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:19:59,944 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 06:19:59,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:19:59,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73118359] [2022-07-21 06:19:59,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73118359] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:19:59,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841668464] [2022-07-21 06:19:59,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 06:19:59,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:19:59,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:19:59,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:19:59,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 06:20:00,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 06:20:00,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 06:20:00,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 06:20:00,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:20:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 06:20:00,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:20:00,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841668464] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:20:00,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 06:20:00,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-21 06:20:00,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065419298] [2022-07-21 06:20:00,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:20:00,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 06:20:00,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:20:00,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 06:20:00,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 06:20:00,495 INFO L87 Difference]: Start difference. First operand 168 states and 241 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 06:20:00,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:20:00,528 INFO L93 Difference]: Finished difference Result 318 states and 470 transitions. [2022-07-21 06:20:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 06:20:00,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 46 [2022-07-21 06:20:00,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:20:00,534 INFO L225 Difference]: With dead ends: 318 [2022-07-21 06:20:00,534 INFO L226 Difference]: Without dead ends: 292 [2022-07-21 06:20:00,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 06:20:00,537 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 190 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:20:00,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 807 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:20:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-07-21 06:20:00,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2022-07-21 06:20:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 205 states have (on average 1.395121951219512) internal successors, (286), 205 states have internal predecessors, (286), 73 states have call successors, (73), 12 states have call predecessors, (73), 12 states have return successors, (82), 73 states have call predecessors, (82), 73 states have call successors, (82) [2022-07-21 06:20:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 441 transitions. [2022-07-21 06:20:00,587 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 441 transitions. Word has length 46 [2022-07-21 06:20:00,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:20:00,588 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 441 transitions. [2022-07-21 06:20:00,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 06:20:00,591 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 441 transitions. [2022-07-21 06:20:00,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-21 06:20:00,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:00,595 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:00,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 06:20:00,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-21 06:20:00,808 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:00,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:00,808 INFO L85 PathProgramCache]: Analyzing trace with hash -413357882, now seen corresponding path program 1 times [2022-07-21 06:20:00,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:00,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731612457] [2022-07-21 06:20:00,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:00,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:20:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:00,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 06:20:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:01,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:20:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:01,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 06:20:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:01,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 06:20:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:01,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 06:20:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-21 06:20:01,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:20:01,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731612457] [2022-07-21 06:20:01,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731612457] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:20:01,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862884970] [2022-07-21 06:20:01,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:01,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:20:01,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:20:01,071 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:20:01,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 06:20:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:01,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 06:20:01,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:20:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-21 06:20:01,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:20:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-21 06:20:01,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862884970] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:20:01,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 06:20:01,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 8 [2022-07-21 06:20:01,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746876300] [2022-07-21 06:20:01,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 06:20:01,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 06:20:01,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:20:01,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 06:20:01,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-21 06:20:01,589 INFO L87 Difference]: Start difference. First operand 291 states and 441 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 06:20:03,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:20:05,656 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:20:06,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:20:06,170 INFO L93 Difference]: Finished difference Result 589 states and 899 transitions. [2022-07-21 06:20:06,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 06:20:06,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 91 [2022-07-21 06:20:06,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:20:06,176 INFO L225 Difference]: With dead ends: 589 [2022-07-21 06:20:06,176 INFO L226 Difference]: Without dead ends: 313 [2022-07-21 06:20:06,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-21 06:20:06,179 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 79 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 114 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-21 06:20:06,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 762 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 303 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-07-21 06:20:06,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-21 06:20:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 307. [2022-07-21 06:20:06,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 219 states have (on average 1.3744292237442923) internal successors, (301), 221 states have internal predecessors, (301), 73 states have call successors, (73), 12 states have call predecessors, (73), 14 states have return successors, (88), 73 states have call predecessors, (88), 73 states have call successors, (88) [2022-07-21 06:20:06,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 462 transitions. [2022-07-21 06:20:06,235 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 462 transitions. Word has length 91 [2022-07-21 06:20:06,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:20:06,237 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 462 transitions. [2022-07-21 06:20:06,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 06:20:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 462 transitions. [2022-07-21 06:20:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-21 06:20:06,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:06,242 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:06,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 06:20:06,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:20:06,457 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:06,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:06,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1310826886, now seen corresponding path program 2 times [2022-07-21 06:20:06,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:06,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942393223] [2022-07-21 06:20:06,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:06,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:20:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:06,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 06:20:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:06,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:20:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:06,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 06:20:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:06,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 06:20:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:06,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 06:20:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-21 06:20:06,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:20:06,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942393223] [2022-07-21 06:20:06,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942393223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:20:06,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:20:06,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 06:20:06,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173561400] [2022-07-21 06:20:06,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:20:06,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 06:20:06,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:20:06,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 06:20:06,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 06:20:06,826 INFO L87 Difference]: Start difference. First operand 307 states and 462 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 06:20:08,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:20:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:20:09,640 INFO L93 Difference]: Finished difference Result 634 states and 980 transitions. [2022-07-21 06:20:09,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 06:20:09,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2022-07-21 06:20:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:20:09,646 INFO L225 Difference]: With dead ends: 634 [2022-07-21 06:20:09,647 INFO L226 Difference]: Without dead ends: 608 [2022-07-21 06:20:09,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-21 06:20:09,648 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 331 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 205 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-21 06:20:09,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 762 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 487 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-07-21 06:20:09,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-21 06:20:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 567. [2022-07-21 06:20:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 390 states have (on average 1.4076923076923078) internal successors, (549), 397 states have internal predecessors, (549), 145 states have call successors, (145), 24 states have call predecessors, (145), 31 states have return successors, (201), 145 states have call predecessors, (201), 145 states have call successors, (201) [2022-07-21 06:20:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 895 transitions. [2022-07-21 06:20:09,696 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 895 transitions. Word has length 103 [2022-07-21 06:20:09,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:20:09,696 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 895 transitions. [2022-07-21 06:20:09,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 06:20:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 895 transitions. [2022-07-21 06:20:09,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-21 06:20:09,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:09,700 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:09,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 06:20:09,700 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:09,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:09,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2058851120, now seen corresponding path program 1 times [2022-07-21 06:20:09,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:09,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457501423] [2022-07-21 06:20:09,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:09,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:20:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:09,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 06:20:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:10,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:20:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:10,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 06:20:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:10,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 06:20:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:10,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 06:20:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:10,033 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-21 06:20:10,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:20:10,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457501423] [2022-07-21 06:20:10,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457501423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:20:10,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:20:10,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 06:20:10,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46193990] [2022-07-21 06:20:10,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:20:10,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 06:20:10,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:20:10,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 06:20:10,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 06:20:10,036 INFO L87 Difference]: Start difference. First operand 567 states and 895 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 06:20:12,052 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:20:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:20:12,843 INFO L93 Difference]: Finished difference Result 1105 states and 1722 transitions. [2022-07-21 06:20:12,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 06:20:12,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2022-07-21 06:20:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:20:12,848 INFO L225 Difference]: With dead ends: 1105 [2022-07-21 06:20:12,848 INFO L226 Difference]: Without dead ends: 608 [2022-07-21 06:20:12,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-21 06:20:12,852 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 366 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 265 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-21 06:20:12,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 762 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 470 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-07-21 06:20:12,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-21 06:20:12,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 570. [2022-07-21 06:20:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 392 states have (on average 1.405612244897959) internal successors, (551), 400 states have internal predecessors, (551), 145 states have call successors, (145), 24 states have call predecessors, (145), 32 states have return successors, (198), 145 states have call predecessors, (198), 145 states have call successors, (198) [2022-07-21 06:20:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 894 transitions. [2022-07-21 06:20:12,909 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 894 transitions. Word has length 103 [2022-07-21 06:20:12,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:20:12,911 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 894 transitions. [2022-07-21 06:20:12,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 06:20:12,911 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 894 transitions. [2022-07-21 06:20:12,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-21 06:20:12,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:12,914 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:12,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 06:20:12,915 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:12,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:12,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1861347046, now seen corresponding path program 1 times [2022-07-21 06:20:12,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:12,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795993850] [2022-07-21 06:20:12,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:12,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:20:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:13,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 06:20:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:13,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:20:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:13,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 06:20:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:13,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 06:20:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:13,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 06:20:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-21 06:20:13,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:20:13,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795993850] [2022-07-21 06:20:13,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795993850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:20:13,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:20:13,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 06:20:13,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585025045] [2022-07-21 06:20:13,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:20:13,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 06:20:13,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:20:13,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 06:20:13,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 06:20:13,259 INFO L87 Difference]: Start difference. First operand 570 states and 894 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 06:20:15,281 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:20:16,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:20:16,237 INFO L93 Difference]: Finished difference Result 1128 states and 1755 transitions. [2022-07-21 06:20:16,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 06:20:16,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2022-07-21 06:20:16,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:20:16,242 INFO L225 Difference]: With dead ends: 1128 [2022-07-21 06:20:16,242 INFO L226 Difference]: Without dead ends: 565 [2022-07-21 06:20:16,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-21 06:20:16,249 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 302 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 149 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-21 06:20:16,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 836 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 632 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-07-21 06:20:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-07-21 06:20:16,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 527. [2022-07-21 06:20:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 370 states have (on average 1.3837837837837839) internal successors, (512), 375 states have internal predecessors, (512), 125 states have call successors, (125), 23 states have call predecessors, (125), 31 states have return successors, (166), 128 states have call predecessors, (166), 125 states have call successors, (166) [2022-07-21 06:20:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 803 transitions. [2022-07-21 06:20:16,282 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 803 transitions. Word has length 103 [2022-07-21 06:20:16,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:20:16,282 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 803 transitions. [2022-07-21 06:20:16,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 06:20:16,283 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 803 transitions. [2022-07-21 06:20:16,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-21 06:20:16,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:16,287 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:16,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 06:20:16,287 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:16,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash 544197250, now seen corresponding path program 1 times [2022-07-21 06:20:16,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:16,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687547934] [2022-07-21 06:20:16,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:16,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:20:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:16,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:20:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:16,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:20:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:16,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 06:20:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:16,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 06:20:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:16,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 06:20:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:16,623 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-21 06:20:16,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:20:16,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687547934] [2022-07-21 06:20:16,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687547934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:20:16,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:20:16,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 06:20:16,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236352684] [2022-07-21 06:20:16,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:20:16,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 06:20:16,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:20:16,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 06:20:16,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 06:20:16,627 INFO L87 Difference]: Start difference. First operand 527 states and 803 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 06:20:18,651 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:20:19,794 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:20:21,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:20:22,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:20:22,755 INFO L93 Difference]: Finished difference Result 897 states and 1333 transitions. [2022-07-21 06:20:22,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 06:20:22,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2022-07-21 06:20:22,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:20:22,760 INFO L225 Difference]: With dead ends: 897 [2022-07-21 06:20:22,760 INFO L226 Difference]: Without dead ends: 533 [2022-07-21 06:20:22,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-21 06:20:22,763 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 284 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 113 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:20:22,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 936 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 616 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2022-07-21 06:20:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-07-21 06:20:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 489. [2022-07-21 06:20:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 347 states have (on average 1.3688760806916427) internal successors, (475), 354 states have internal predecessors, (475), 110 states have call successors, (110), 23 states have call predecessors, (110), 31 states have return successors, (149), 111 states have call predecessors, (149), 110 states have call successors, (149) [2022-07-21 06:20:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 734 transitions. [2022-07-21 06:20:22,792 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 734 transitions. Word has length 103 [2022-07-21 06:20:22,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:20:22,792 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 734 transitions. [2022-07-21 06:20:22,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 06:20:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 734 transitions. [2022-07-21 06:20:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-21 06:20:22,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:22,796 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:22,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 06:20:22,796 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:22,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:22,797 INFO L85 PathProgramCache]: Analyzing trace with hash -689449485, now seen corresponding path program 1 times [2022-07-21 06:20:22,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:22,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672121727] [2022-07-21 06:20:22,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:22,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:20:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:25,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 06:20:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:25,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 06:20:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:25,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 06:20:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:25,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 06:20:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:25,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 06:20:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:25,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 06:20:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:25,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 06:20:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 06:20:25,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:20:25,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672121727] [2022-07-21 06:20:25,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672121727] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:20:25,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:20:25,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 06:20:25,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340467357] [2022-07-21 06:20:25,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:20:25,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 06:20:25,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:20:25,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 06:20:25,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-21 06:20:25,216 INFO L87 Difference]: Start difference. First operand 489 states and 734 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 06:20:27,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:20:27,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:20:27,881 INFO L93 Difference]: Finished difference Result 740 states and 1085 transitions. [2022-07-21 06:20:27,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 06:20:27,882 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 117 [2022-07-21 06:20:27,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:20:27,885 INFO L225 Difference]: With dead ends: 740 [2022-07-21 06:20:27,885 INFO L226 Difference]: Without dead ends: 507 [2022-07-21 06:20:27,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-21 06:20:27,887 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 106 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 162 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-21 06:20:27,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 853 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 457 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-07-21 06:20:27,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-07-21 06:20:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 493. [2022-07-21 06:20:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 351 states have (on average 1.3675213675213675) internal successors, (480), 358 states have internal predecessors, (480), 110 states have call successors, (110), 23 states have call predecessors, (110), 31 states have return successors, (149), 111 states have call predecessors, (149), 110 states have call successors, (149) [2022-07-21 06:20:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 739 transitions. [2022-07-21 06:20:27,915 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 739 transitions. Word has length 117 [2022-07-21 06:20:27,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:20:27,916 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 739 transitions. [2022-07-21 06:20:27,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 06:20:27,916 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 739 transitions. [2022-07-21 06:20:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-21 06:20:27,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:27,920 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:27,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 06:20:27,920 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:27,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:27,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1402171026, now seen corresponding path program 1 times [2022-07-21 06:20:27,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:27,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984674785] [2022-07-21 06:20:27,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:27,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:20:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:30,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 06:20:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:30,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 06:20:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:30,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 06:20:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:30,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 06:20:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:30,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 06:20:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:30,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 06:20:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:30,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 06:20:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:30,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 06:20:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:30,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 06:20:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:30,344 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2022-07-21 06:20:30,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:20:30,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984674785] [2022-07-21 06:20:30,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984674785] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:20:30,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:20:30,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 06:20:30,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533513522] [2022-07-21 06:20:30,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:20:30,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 06:20:30,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:20:30,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 06:20:30,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-21 06:20:30,348 INFO L87 Difference]: Start difference. First operand 493 states and 739 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 06:20:32,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:20:33,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:20:33,143 INFO L93 Difference]: Finished difference Result 769 states and 1126 transitions. [2022-07-21 06:20:33,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 06:20:33,145 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-07-21 06:20:33,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:20:33,148 INFO L225 Difference]: With dead ends: 769 [2022-07-21 06:20:33,149 INFO L226 Difference]: Without dead ends: 504 [2022-07-21 06:20:33,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-21 06:20:33,151 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 40 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-21 06:20:33,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 984 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 678 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-07-21 06:20:33,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-07-21 06:20:33,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 491. [2022-07-21 06:20:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 349 states have (on average 1.3667621776504297) internal successors, (477), 356 states have internal predecessors, (477), 110 states have call successors, (110), 23 states have call predecessors, (110), 31 states have return successors, (149), 111 states have call predecessors, (149), 110 states have call successors, (149) [2022-07-21 06:20:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 736 transitions. [2022-07-21 06:20:33,178 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 736 transitions. Word has length 137 [2022-07-21 06:20:33,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:20:33,179 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 736 transitions. [2022-07-21 06:20:33,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 06:20:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 736 transitions. [2022-07-21 06:20:33,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-21 06:20:33,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:33,182 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:33,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 06:20:33,183 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:33,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:33,183 INFO L85 PathProgramCache]: Analyzing trace with hash 359767575, now seen corresponding path program 1 times [2022-07-21 06:20:33,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:33,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736163205] [2022-07-21 06:20:33,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:33,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:20:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:33,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:20:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:33,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:20:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:33,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 06:20:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:33,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 06:20:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:33,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 06:20:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:33,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 06:20:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:33,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 06:20:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:33,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 06:20:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:33,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 06:20:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:33,638 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-07-21 06:20:33,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:20:33,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736163205] [2022-07-21 06:20:33,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736163205] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:20:33,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818347686] [2022-07-21 06:20:33,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:33,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:20:33,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:20:33,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:20:33,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 06:20:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:34,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 1480 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 06:20:34,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:20:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-21 06:20:34,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:20:34,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818347686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:20:34,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 06:20:34,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2022-07-21 06:20:34,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692348915] [2022-07-21 06:20:34,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:20:34,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 06:20:34,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:20:34,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 06:20:34,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-07-21 06:20:34,473 INFO L87 Difference]: Start difference. First operand 491 states and 736 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 06:20:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:20:34,970 INFO L93 Difference]: Finished difference Result 1207 states and 1913 transitions. [2022-07-21 06:20:34,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 06:20:34,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 135 [2022-07-21 06:20:34,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:20:34,979 INFO L225 Difference]: With dead ends: 1207 [2022-07-21 06:20:34,980 INFO L226 Difference]: Without dead ends: 746 [2022-07-21 06:20:34,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-07-21 06:20:34,985 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 322 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 06:20:34,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 563 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 06:20:34,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-07-21 06:20:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 694. [2022-07-21 06:20:35,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 513 states have (on average 1.2553606237816763) internal successors, (644), 462 states have internal predecessors, (644), 129 states have call successors, (129), 27 states have call predecessors, (129), 51 states have return successors, (278), 204 states have call predecessors, (278), 129 states have call successors, (278) [2022-07-21 06:20:35,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1051 transitions. [2022-07-21 06:20:35,029 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1051 transitions. Word has length 135 [2022-07-21 06:20:35,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:20:35,029 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 1051 transitions. [2022-07-21 06:20:35,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 06:20:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1051 transitions. [2022-07-21 06:20:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-21 06:20:35,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:35,034 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:35,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 06:20:35,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:20:35,254 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:35,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:35,254 INFO L85 PathProgramCache]: Analyzing trace with hash -462837888, now seen corresponding path program 1 times [2022-07-21 06:20:35,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:35,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359539364] [2022-07-21 06:20:35,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:35,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:20:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:37,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:20:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:37,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:20:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:37,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 06:20:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:37,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 06:20:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:37,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 06:20:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:37,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 06:20:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:37,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:20:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:37,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 06:20:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:37,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 06:20:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-21 06:20:37,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:20:37,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359539364] [2022-07-21 06:20:37,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359539364] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:20:37,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670898768] [2022-07-21 06:20:37,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:37,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:20:37,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:20:37,124 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:20:37,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 06:20:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:37,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 99 conjunts are in the unsatisfiable core [2022-07-21 06:20:37,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:20:37,984 INFO L356 Elim1Store]: treesize reduction 80, result has 29.2 percent of original size [2022-07-21 06:20:37,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 55 treesize of output 75 [2022-07-21 06:20:38,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:20:38,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:20:38,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:20:38,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:20:38,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:20:39,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:20:39,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:20:39,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:20:39,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2022-07-21 06:20:39,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 06:20:40,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-21 06:20:40,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 06:20:40,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:40,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:40,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:40,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:40,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:40,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:40,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:40,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:40,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:40,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:40,232 INFO L356 Elim1Store]: treesize reduction 114, result has 31.3 percent of original size [2022-07-21 06:20:40,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1248 treesize of output 478 [2022-07-21 06:20:40,260 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-21 06:20:40,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-21 06:20:40,453 INFO L390 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 9 treesize of output 3 [2022-07-21 06:20:40,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 06:20:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 33 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-21 06:20:40,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:20:40,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7135 (Array Int Int)) (|~#mutex~0.offset| Int) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7132 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:20:40,897 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7122 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (|~#mutex~0.offset| Int) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7132 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |c_ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|)) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:20:40,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7122 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7128 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|)) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:20:41,003 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7122 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7128 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7112))) (store .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:20:41,064 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7110 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7122 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7109 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (let ((.cse2 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7110) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7112))) (store .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:20:41,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7110 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7122 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (v_ArrVal_7107 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7109 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (let ((.cse2 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7107) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7110) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7112))) (store .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:20:41,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7110 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_7122 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7107 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7106 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7109 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (let ((.cse2 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7107) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7110) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7112))) (store .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:20:41,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (v_ArrVal_7110 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7122 (Array Int Int)) (v_ArrVal_7103 (Array Int Int)) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7104 (Array Int Int)) (v_ArrVal_7107 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7106 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7109 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (let ((.cse2 (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7104) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7107) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7110) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7112))) (store .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:20:41,427 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (v_ArrVal_7110 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7101 (Array Int Int)) (v_ArrVal_7122 (Array Int Int)) (v_ArrVal_7103 (Array Int Int)) (v_ArrVal_7102 (Array Int Int)) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7104 (Array Int Int)) (v_ArrVal_7107 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7106 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7109 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (let ((.cse2 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7104) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7107) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7110) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7112))) (store .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:20:41,513 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (v_ArrVal_7099 (Array Int Int)) (v_ArrVal_7110 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7101 (Array Int Int)) (v_ArrVal_7100 (Array Int Int)) (v_ArrVal_7122 (Array Int Int)) (v_ArrVal_7103 (Array Int Int)) (v_ArrVal_7102 (Array Int Int)) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7104 (Array Int Int)) (v_ArrVal_7107 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7106 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7109 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (let ((.cse2 (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7100) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7099) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7104) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7107) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7110) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7112))) (store .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:20:41,593 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~2#1| Int) (v_ArrVal_7097 (Array Int Int)) (v_ArrVal_7099 (Array Int Int)) (v_ArrVal_7110 (Array Int Int)) (v_ArrVal_7132 (Array Int Int)) (v_ArrVal_7098 (Array Int Int)) (v_ArrVal_7112 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet46#1| Int) (v_ArrVal_7111 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_#t~nondet44#1| Int) (v_ArrVal_7113 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| Int) (v_ArrVal_7135 (Array Int Int)) (|~#mutex~0.offset| Int) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| Int) (v_ArrVal_7141 (Array Int Int)) (v_ArrVal_7101 (Array Int Int)) (v_ArrVal_7100 (Array Int Int)) (v_ArrVal_7122 (Array Int Int)) (v_ArrVal_7103 (Array Int Int)) (v_ArrVal_7102 (Array Int Int)) (v_ArrVal_7105 (Array Int Int)) (v_ArrVal_7104 (Array Int Int)) (v_ArrVal_7107 (Array Int Int)) (v_ArrVal_7129 (Array Int Int)) (v_ArrVal_7106 (Array Int Int)) (v_ArrVal_7128 (Array Int Int)) (v_ArrVal_7109 (Array Int Int)) (v_ArrVal_7108 (Array Int Int))) (not (= (mod (select (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (let ((.cse2 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7098) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7097) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7100) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7099) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7104) |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| v_ArrVal_7105) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7107) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7110) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7112))) (store .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (+ |ULTIMATE.start_main_~j~2#1| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet44#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_7113))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~nondet46#1|))) |c_ULTIMATE.start_main_~#__CS_cp_data~0#1.base| v_ArrVal_7122) |c_~#__CS_thread_status~0.base| v_ArrVal_7132) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_7141))) (store .cse0 |c_~#mutex~0.base| (store (select .cse0 |c_~#mutex~0.base|) (+ |~#mutex~0.offset| 1) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_mutex~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_mutex~0#1.offset| 1))))) |c_~#data~0.base| v_ArrVal_7135) |c_~#__CS_thread_born_round~0.base| v_ArrVal_7129) |c_~#__CS_thread_status~0.base| v_ArrVal_7128) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:20:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 70 trivial. 78 not checked. [2022-07-21 06:20:41,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670898768] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:20:41,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 06:20:41,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 17] total 34 [2022-07-21 06:20:41,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453899076] [2022-07-21 06:20:41,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 06:20:41,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-21 06:20:41,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:20:41,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-21 06:20:41,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=423, Unknown=12, NotChecked=572, Total=1122 [2022-07-21 06:20:41,823 INFO L87 Difference]: Start difference. First operand 694 states and 1051 transitions. Second operand has 34 states, 34 states have (on average 5.5) internal successors, (187), 30 states have internal predecessors, (187), 8 states have call successors, (27), 9 states have call predecessors, (27), 6 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2022-07-21 06:20:44,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:20:46,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:20:46,401 INFO L93 Difference]: Finished difference Result 1554 states and 2277 transitions. [2022-07-21 06:20:46,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 06:20:46,402 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.5) internal successors, (187), 30 states have internal predecessors, (187), 8 states have call successors, (27), 9 states have call predecessors, (27), 6 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) Word has length 136 [2022-07-21 06:20:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:20:46,409 INFO L225 Difference]: With dead ends: 1554 [2022-07-21 06:20:46,410 INFO L226 Difference]: Without dead ends: 1045 [2022-07-21 06:20:46,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 282 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=334, Invalid=1338, Unknown=12, NotChecked=968, Total=2652 [2022-07-21 06:20:46,415 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 591 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 408 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 6856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 4780 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-21 06:20:46,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1287 Invalid, 6856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1667 Invalid, 1 Unknown, 4780 Unchecked, 3.7s Time] [2022-07-21 06:20:46,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2022-07-21 06:20:46,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 976. [2022-07-21 06:20:46,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 727 states have (on average 1.2283356258596974) internal successors, (893), 658 states have internal predecessors, (893), 172 states have call successors, (172), 39 states have call predecessors, (172), 76 states have return successors, (405), 278 states have call predecessors, (405), 172 states have call successors, (405) [2022-07-21 06:20:46,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1470 transitions. [2022-07-21 06:20:46,480 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1470 transitions. Word has length 136 [2022-07-21 06:20:46,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:20:46,480 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1470 transitions. [2022-07-21 06:20:46,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.5) internal successors, (187), 30 states have internal predecessors, (187), 8 states have call successors, (27), 9 states have call predecessors, (27), 6 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2022-07-21 06:20:46,481 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1470 transitions. [2022-07-21 06:20:46,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-21 06:20:46,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:46,485 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:46,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-21 06:20:46,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 06:20:46,700 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:46,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:46,700 INFO L85 PathProgramCache]: Analyzing trace with hash -442404352, now seen corresponding path program 1 times [2022-07-21 06:20:46,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:46,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087983247] [2022-07-21 06:20:46,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:46,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:20:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:48,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:20:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:48,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:20:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:48,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 06:20:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:48,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 06:20:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:48,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 06:20:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:48,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 06:20:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:48,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:20:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:48,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 06:20:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:48,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 06:20:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-21 06:20:48,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:20:48,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087983247] [2022-07-21 06:20:48,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087983247] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:20:48,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843481167] [2022-07-21 06:20:48,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:48,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:20:48,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:20:48,856 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:20:48,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 06:20:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:20:49,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-21 06:20:49,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:20:49,804 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-07-21 06:20:49,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 56 [2022-07-21 06:20:50,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:20:50,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:20:50,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:20:50,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:20:50,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:20:50,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:20:51,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:20:51,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:20:51,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:20:51,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-21 06:20:51,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 06:20:51,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:51,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:51,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:51,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:51,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:51,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:51,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:51,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:51,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:51,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:51,808 INFO L356 Elim1Store]: treesize reduction 130, result has 29.7 percent of original size [2022-07-21 06:20:51,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1248 treesize of output 481 [2022-07-21 06:20:51,838 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-21 06:20:51,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-21 06:20:52,019 INFO L390 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 9 treesize of output 3 [2022-07-21 06:20:52,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:20:52,138 INFO L390 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 16 treesize of output 18 [2022-07-21 06:20:52,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 06:20:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 33 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-21 06:20:52,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:20:52,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8102 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_8102) |c_~#__CS_thread_allocated~0.base|) (+ 3 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:20:52,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843481167] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:20:52,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 06:20:52,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2022-07-21 06:20:52,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679571410] [2022-07-21 06:20:52,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 06:20:52,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 06:20:52,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:20:52,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 06:20:52,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=380, Unknown=1, NotChecked=40, Total=506 [2022-07-21 06:20:52,359 INFO L87 Difference]: Start difference. First operand 976 states and 1470 transitions. Second operand has 20 states, 20 states have (on average 7.0) internal successors, (140), 16 states have internal predecessors, (140), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-21 06:20:54,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:20:57,074 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:20:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:20:59,030 INFO L93 Difference]: Finished difference Result 1291 states and 1869 transitions. [2022-07-21 06:20:59,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 06:20:59,031 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.0) internal successors, (140), 16 states have internal predecessors, (140), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 136 [2022-07-21 06:20:59,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:20:59,038 INFO L225 Difference]: With dead ends: 1291 [2022-07-21 06:20:59,039 INFO L226 Difference]: Without dead ends: 1148 [2022-07-21 06:20:59,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=251, Invalid=942, Unknown=1, NotChecked=66, Total=1260 [2022-07-21 06:20:59,042 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 522 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 337 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:20:59,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1200 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 1581 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2022-07-21 06:20:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2022-07-21 06:20:59,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1035. [2022-07-21 06:20:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 774 states have (on average 1.223514211886305) internal successors, (947), 705 states have internal predecessors, (947), 177 states have call successors, (177), 43 states have call predecessors, (177), 83 states have return successors, (421), 286 states have call predecessors, (421), 177 states have call successors, (421) [2022-07-21 06:20:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1545 transitions. [2022-07-21 06:20:59,107 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1545 transitions. Word has length 136 [2022-07-21 06:20:59,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:20:59,108 INFO L495 AbstractCegarLoop]: Abstraction has 1035 states and 1545 transitions. [2022-07-21 06:20:59,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.0) internal successors, (140), 16 states have internal predecessors, (140), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-21 06:20:59,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1545 transitions. [2022-07-21 06:20:59,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-21 06:20:59,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:20:59,113 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:20:59,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-21 06:20:59,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:20:59,339 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:20:59,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:20:59,340 INFO L85 PathProgramCache]: Analyzing trace with hash 762367328, now seen corresponding path program 1 times [2022-07-21 06:20:59,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:20:59,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320379948] [2022-07-21 06:20:59,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:20:59,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:00,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:21:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:00,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:21:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:00,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 06:21:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:00,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 06:21:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:00,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 06:21:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:00,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 06:21:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:00,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:21:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:00,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 06:21:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:00,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 06:21:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-21 06:21:00,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:00,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320379948] [2022-07-21 06:21:00,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320379948] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:00,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306132044] [2022-07-21 06:21:00,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:00,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:00,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:00,744 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:21:00,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 06:21:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:01,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 81 conjunts are in the unsatisfiable core [2022-07-21 06:21:01,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:01,592 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-07-21 06:21:01,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 56 [2022-07-21 06:21:01,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:01,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:01,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:02,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:02,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:02,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:02,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:02,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:02,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:02,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:02,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:02,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:02,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:02,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:02,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:02,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:02,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:02,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:02,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:02,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:02,817 INFO L356 Elim1Store]: treesize reduction 130, result has 29.7 percent of original size [2022-07-21 06:21:02,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 624 treesize of output 273 [2022-07-21 06:21:02,835 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-21 06:21:02,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-21 06:21:02,973 INFO L390 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 9 treesize of output 3 [2022-07-21 06:21:03,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:03,067 INFO L390 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 16 treesize of output 18 [2022-07-21 06:21:03,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 06:21:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 33 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-21 06:21:03,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:21:03,221 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9061 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_9061) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:21:03,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306132044] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:03,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 06:21:03,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2022-07-21 06:21:03,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684876974] [2022-07-21 06:21:03,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 06:21:03,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 06:21:03,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:03,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 06:21:03,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=380, Unknown=1, NotChecked=40, Total=506 [2022-07-21 06:21:03,245 INFO L87 Difference]: Start difference. First operand 1035 states and 1545 transitions. Second operand has 20 states, 20 states have (on average 6.9) internal successors, (138), 16 states have internal predecessors, (138), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-21 06:21:05,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:21:07,858 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:21:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:11,167 INFO L93 Difference]: Finished difference Result 1622 states and 2291 transitions. [2022-07-21 06:21:11,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 06:21:11,176 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.9) internal successors, (138), 16 states have internal predecessors, (138), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 136 [2022-07-21 06:21:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:11,182 INFO L225 Difference]: With dead ends: 1622 [2022-07-21 06:21:11,182 INFO L226 Difference]: Without dead ends: 1038 [2022-07-21 06:21:11,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=251, Invalid=942, Unknown=1, NotChecked=66, Total=1260 [2022-07-21 06:21:11,187 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 440 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 286 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:11,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1214 Invalid, 1974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1686 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-07-21 06:21:11,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2022-07-21 06:21:11,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 994. [2022-07-21 06:21:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 742 states have (on average 1.2223719676549865) internal successors, (907), 672 states have internal predecessors, (907), 174 states have call successors, (174), 42 states have call predecessors, (174), 77 states have return successors, (404), 279 states have call predecessors, (404), 174 states have call successors, (404) [2022-07-21 06:21:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1485 transitions. [2022-07-21 06:21:11,250 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1485 transitions. Word has length 136 [2022-07-21 06:21:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:11,250 INFO L495 AbstractCegarLoop]: Abstraction has 994 states and 1485 transitions. [2022-07-21 06:21:11,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.9) internal successors, (138), 16 states have internal predecessors, (138), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-21 06:21:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1485 transitions. [2022-07-21 06:21:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-21 06:21:11,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:11,255 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:21:11,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 06:21:11,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:11,479 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:11,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:11,480 INFO L85 PathProgramCache]: Analyzing trace with hash 945379520, now seen corresponding path program 1 times [2022-07-21 06:21:11,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:11,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50184963] [2022-07-21 06:21:11,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:11,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:21:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:13,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:21:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:13,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 06:21:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:13,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 06:21:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:13,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 06:21:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:13,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 06:21:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:13,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:21:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:13,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 06:21:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:13,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 06:21:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:13,775 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-21 06:21:13,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:13,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50184963] [2022-07-21 06:21:13,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50184963] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:13,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115741022] [2022-07-21 06:21:13,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:13,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:13,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:13,780 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:21:13,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 06:21:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:14,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-21 06:21:14,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:14,706 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-07-21 06:21:14,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 56 [2022-07-21 06:21:14,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:14,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:15,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:15,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:15,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:15,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:15,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:15,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:15,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:15,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:21:16,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:16,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:16,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:16,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:16,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:16,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:16,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:16,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:16,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:16,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:16,153 INFO L356 Elim1Store]: treesize reduction 130, result has 29.7 percent of original size [2022-07-21 06:21:16,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 2496 treesize of output 897 [2022-07-21 06:21:16,181 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-21 06:21:16,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-21 06:21:16,371 INFO L390 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 9 treesize of output 3 [2022-07-21 06:21:16,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:16,458 INFO L390 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 16 treesize of output 18 [2022-07-21 06:21:16,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 06:21:16,502 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 33 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-21 06:21:16,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:21:16,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10019 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_10019) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-21 06:21:16,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115741022] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:16,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 06:21:16,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2022-07-21 06:21:16,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711715303] [2022-07-21 06:21:16,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 06:21:16,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 06:21:16,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:16,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 06:21:16,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=380, Unknown=1, NotChecked=40, Total=506 [2022-07-21 06:21:16,663 INFO L87 Difference]: Start difference. First operand 994 states and 1485 transitions. Second operand has 20 states, 20 states have (on average 6.8) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-21 06:21:18,812 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:21:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:19,969 INFO L93 Difference]: Finished difference Result 1506 states and 2156 transitions. [2022-07-21 06:21:19,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 06:21:19,970 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.8) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 136 [2022-07-21 06:21:19,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:19,976 INFO L225 Difference]: With dead ends: 1506 [2022-07-21 06:21:19,976 INFO L226 Difference]: Without dead ends: 950 [2022-07-21 06:21:19,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=809, Unknown=1, NotChecked=60, Total=1056 [2022-07-21 06:21:19,979 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 348 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 220 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:19,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1052 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1316 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-07-21 06:21:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-07-21 06:21:20,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 931. [2022-07-21 06:21:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 691 states have (on average 1.227206946454414) internal successors, (848), 623 states have internal predecessors, (848), 169 states have call successors, (169), 38 states have call predecessors, (169), 70 states have return successors, (385), 269 states have call predecessors, (385), 169 states have call successors, (385) [2022-07-21 06:21:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1402 transitions. [2022-07-21 06:21:20,034 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1402 transitions. Word has length 136 [2022-07-21 06:21:20,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:20,034 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 1402 transitions. [2022-07-21 06:21:20,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.8) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-21 06:21:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1402 transitions. [2022-07-21 06:21:20,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-21 06:21:20,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:20,039 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:21:20,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 06:21:20,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-21 06:21:20,256 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:20,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:20,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1167717052, now seen corresponding path program 1 times [2022-07-21 06:21:20,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:20,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900697003] [2022-07-21 06:21:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:20,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:21,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:21:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:21,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 06:21:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:21,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 06:21:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:21,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 06:21:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:21,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:21:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:21,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 06:21:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:21,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 06:21:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 06:21:21,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:21,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900697003] [2022-07-21 06:21:21,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900697003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:21:21,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:21:21,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 06:21:21,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808210509] [2022-07-21 06:21:21,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:21:21,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 06:21:21,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:21,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 06:21:21,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-21 06:21:21,959 INFO L87 Difference]: Start difference. First operand 931 states and 1402 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 06:21:23,979 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:21:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:24,729 INFO L93 Difference]: Finished difference Result 1169 states and 1714 transitions. [2022-07-21 06:21:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 06:21:24,731 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 118 [2022-07-21 06:21:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:24,737 INFO L225 Difference]: With dead ends: 1169 [2022-07-21 06:21:24,738 INFO L226 Difference]: Without dead ends: 962 [2022-07-21 06:21:24,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2022-07-21 06:21:24,740 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 513 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 227 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:24,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 748 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 583 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-07-21 06:21:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-07-21 06:21:24,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 916. [2022-07-21 06:21:24,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 678 states have (on average 1.2271386430678466) internal successors, (832), 614 states have internal predecessors, (832), 167 states have call successors, (167), 37 states have call predecessors, (167), 70 states have return successors, (379), 264 states have call predecessors, (379), 167 states have call successors, (379) [2022-07-21 06:21:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1378 transitions. [2022-07-21 06:21:24,797 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1378 transitions. Word has length 118 [2022-07-21 06:21:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:24,797 INFO L495 AbstractCegarLoop]: Abstraction has 916 states and 1378 transitions. [2022-07-21 06:21:24,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 06:21:24,797 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1378 transitions. [2022-07-21 06:21:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-21 06:21:24,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:24,802 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:21:24,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 06:21:24,803 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:24,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:24,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1474702243, now seen corresponding path program 1 times [2022-07-21 06:21:24,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:24,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990795312] [2022-07-21 06:21:24,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:24,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:25,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:21:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:25,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:21:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:25,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 06:21:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:25,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 06:21:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:25,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 06:21:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:25,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 06:21:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:25,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:21:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:25,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 06:21:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:25,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 06:21:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:25,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:21:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-07-21 06:21:25,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:25,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990795312] [2022-07-21 06:21:25,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990795312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:25,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741349831] [2022-07-21 06:21:25,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:25,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:25,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:25,382 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:21:25,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 06:21:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:26,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 1675 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-21 06:21:26,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:26,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-07-21 06:21:26,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-21 06:21:26,411 INFO L390 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 8 treesize of output 7 [2022-07-21 06:21:26,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-21 06:21:26,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-07-21 06:21:26,479 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-21 06:21:26,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:21:26,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 8 [2022-07-21 06:21:26,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741349831] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:26,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 06:21:26,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2022-07-21 06:21:26,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981321526] [2022-07-21 06:21:26,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 06:21:26,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 06:21:26,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:26,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 06:21:26,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-07-21 06:21:26,623 INFO L87 Difference]: Start difference. First operand 916 states and 1378 transitions. Second operand has 18 states, 17 states have (on average 6.823529411764706) internal successors, (116), 14 states have internal predecessors, (116), 9 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-07-21 06:21:28,651 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:21:31,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:31,732 INFO L93 Difference]: Finished difference Result 1983 states and 3071 transitions. [2022-07-21 06:21:31,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-21 06:21:31,733 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.823529411764706) internal successors, (116), 14 states have internal predecessors, (116), 9 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) Word has length 147 [2022-07-21 06:21:31,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:31,740 INFO L225 Difference]: With dead ends: 1983 [2022-07-21 06:21:31,741 INFO L226 Difference]: Without dead ends: 1112 [2022-07-21 06:21:31,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=550, Invalid=2206, Unknown=0, NotChecked=0, Total=2756 [2022-07-21 06:21:31,747 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 975 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 692 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 2164 SdHoareTripleChecker+Invalid, 3120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 692 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 319 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:31,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 2164 Invalid, 3120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [692 Valid, 2108 Invalid, 1 Unknown, 319 Unchecked, 3.9s Time] [2022-07-21 06:21:31,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2022-07-21 06:21:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 960. [2022-07-21 06:21:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 694 states have (on average 1.2507204610951008) internal successors, (868), 612 states have internal predecessors, (868), 199 states have call successors, (199), 33 states have call predecessors, (199), 66 states have return successors, (459), 314 states have call predecessors, (459), 199 states have call successors, (459) [2022-07-21 06:21:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1526 transitions. [2022-07-21 06:21:31,823 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1526 transitions. Word has length 147 [2022-07-21 06:21:31,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:31,824 INFO L495 AbstractCegarLoop]: Abstraction has 960 states and 1526 transitions. [2022-07-21 06:21:31,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.823529411764706) internal successors, (116), 14 states have internal predecessors, (116), 9 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-07-21 06:21:31,824 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1526 transitions. [2022-07-21 06:21:31,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-21 06:21:31,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:31,830 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:21:31,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 06:21:32,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-21 06:21:32,044 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:32,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:32,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1732460611, now seen corresponding path program 1 times [2022-07-21 06:21:32,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:32,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527464825] [2022-07-21 06:21:32,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:32,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:21:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:21:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 06:21:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 06:21:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 06:21:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 06:21:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:21:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 06:21:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 06:21:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:21:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,628 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-07-21 06:21:32,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:32,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527464825] [2022-07-21 06:21:32,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527464825] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:32,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129684265] [2022-07-21 06:21:32,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:32,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:32,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:32,632 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:21:32,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 06:21:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:33,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 1675 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-21 06:21:33,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:33,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-07-21 06:21:33,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-21 06:21:33,708 INFO L390 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 8 treesize of output 7 [2022-07-21 06:21:33,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-21 06:21:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-21 06:21:33,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:21:33,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 8 [2022-07-21 06:21:34,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129684265] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:34,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 06:21:34,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 17 [2022-07-21 06:21:34,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290710357] [2022-07-21 06:21:34,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 06:21:34,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 06:21:34,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:34,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 06:21:34,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-07-21 06:21:34,012 INFO L87 Difference]: Start difference. First operand 960 states and 1526 transitions. Second operand has 17 states, 16 states have (on average 6.5) internal successors, (104), 13 states have internal predecessors, (104), 8 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-07-21 06:21:36,041 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:21:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:39,104 INFO L93 Difference]: Finished difference Result 1744 states and 2635 transitions. [2022-07-21 06:21:39,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-21 06:21:39,105 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.5) internal successors, (104), 13 states have internal predecessors, (104), 8 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 147 [2022-07-21 06:21:39,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:39,112 INFO L225 Difference]: With dead ends: 1744 [2022-07-21 06:21:39,112 INFO L226 Difference]: Without dead ends: 1149 [2022-07-21 06:21:39,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=563, Invalid=2193, Unknown=0, NotChecked=0, Total=2756 [2022-07-21 06:21:39,116 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 946 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 751 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 2056 SdHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 751 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:39,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 2056 Invalid, 2997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [751 Valid, 1914 Invalid, 1 Unknown, 331 Unchecked, 3.8s Time] [2022-07-21 06:21:39,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2022-07-21 06:21:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1003. [2022-07-21 06:21:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 731 states have (on average 1.2462380300957592) internal successors, (911), 660 states have internal predecessors, (911), 192 states have call successors, (192), 39 states have call predecessors, (192), 79 states have return successors, (450), 303 states have call predecessors, (450), 192 states have call successors, (450) [2022-07-21 06:21:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1553 transitions. [2022-07-21 06:21:39,197 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1553 transitions. Word has length 147 [2022-07-21 06:21:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:39,198 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1553 transitions. [2022-07-21 06:21:39,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.5) internal successors, (104), 13 states have internal predecessors, (104), 8 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-07-21 06:21:39,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1553 transitions. [2022-07-21 06:21:39,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-21 06:21:39,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:39,205 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:21:39,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 06:21:39,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:39,428 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:39,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:39,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2098606569, now seen corresponding path program 1 times [2022-07-21 06:21:39,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:39,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624111303] [2022-07-21 06:21:39,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:39,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:39,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:21:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:39,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:21:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:39,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 06:21:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:39,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 06:21:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:39,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 06:21:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:39,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 06:21:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:39,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 06:21:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:39,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 06:21:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:39,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 06:21:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:39,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 06:21:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:39,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 06:21:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-07-21 06:21:39,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:39,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624111303] [2022-07-21 06:21:39,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624111303] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:39,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403759440] [2022-07-21 06:21:39,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:39,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:39,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:39,803 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:21:39,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 06:21:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:40,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 1701 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-21 06:21:40,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-07-21 06:21:40,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:21:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-21 06:21:41,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403759440] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:21:41,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 06:21:41,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 21 [2022-07-21 06:21:41,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822129734] [2022-07-21 06:21:41,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 06:21:41,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-21 06:21:41,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:41,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-21 06:21:41,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2022-07-21 06:21:41,314 INFO L87 Difference]: Start difference. First operand 1003 states and 1553 transitions. Second operand has 21 states, 20 states have (on average 5.55) internal successors, (111), 17 states have internal predecessors, (111), 9 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (26), 8 states have call predecessors, (26), 9 states have call successors, (26) [2022-07-21 06:21:43,335 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:21:45,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:21:48,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:48,959 INFO L93 Difference]: Finished difference Result 2865 states and 4529 transitions. [2022-07-21 06:21:48,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-21 06:21:48,959 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.55) internal successors, (111), 17 states have internal predecessors, (111), 9 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (26), 8 states have call predecessors, (26), 9 states have call successors, (26) Word has length 146 [2022-07-21 06:21:48,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:48,972 INFO L225 Difference]: With dead ends: 2865 [2022-07-21 06:21:48,972 INFO L226 Difference]: Without dead ends: 1918 [2022-07-21 06:21:48,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=535, Invalid=2221, Unknown=0, NotChecked=0, Total=2756 [2022-07-21 06:21:48,981 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 1490 mSDsluCounter, 2212 mSDsCounter, 0 mSdLazyCounter, 2943 mSolverCounterSat, 1217 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 4162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1217 IncrementalHoareTripleChecker+Valid, 2943 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:48,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 2651 Invalid, 4162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1217 Valid, 2943 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-07-21 06:21:48,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2022-07-21 06:21:49,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1768. [2022-07-21 06:21:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1293 states have (on average 1.2405259087393659) internal successors, (1604), 1173 states have internal predecessors, (1604), 325 states have call successors, (325), 75 states have call predecessors, (325), 149 states have return successors, (866), 519 states have call predecessors, (866), 325 states have call successors, (866) [2022-07-21 06:21:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2795 transitions. [2022-07-21 06:21:49,119 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2795 transitions. Word has length 146 [2022-07-21 06:21:49,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:49,120 INFO L495 AbstractCegarLoop]: Abstraction has 1768 states and 2795 transitions. [2022-07-21 06:21:49,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.55) internal successors, (111), 17 states have internal predecessors, (111), 9 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (26), 8 states have call predecessors, (26), 9 states have call successors, (26) [2022-07-21 06:21:49,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2795 transitions. [2022-07-21 06:21:49,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-21 06:21:49,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:49,129 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 5, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:21:49,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 06:21:49,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:49,343 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:49,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:49,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1887788041, now seen corresponding path program 1 times [2022-07-21 06:21:49,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:49,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075749338] [2022-07-21 06:21:49,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:49,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:50,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:21:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:51,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:21:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:51,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 06:21:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:51,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 06:21:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:51,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 06:21:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:51,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 06:21:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:51,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 06:21:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:51,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 06:21:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:52,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 06:21:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:52,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 06:21:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:52,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 06:21:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-07-21 06:21:52,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:52,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075749338] [2022-07-21 06:21:52,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075749338] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:52,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486770669] [2022-07-21 06:21:52,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:52,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:52,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:52,110 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:21:52,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 06:21:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:53,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 1847 conjuncts, 121 conjunts are in the unsatisfiable core [2022-07-21 06:21:53,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:53,408 INFO L356 Elim1Store]: treesize reduction 338, result has 14.0 percent of original size [2022-07-21 06:21:53,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 79 [2022-07-21 06:21:55,155 INFO L356 Elim1Store]: treesize reduction 156, result has 41.1 percent of original size [2022-07-21 06:21:55,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 894 treesize of output 805 [2022-07-21 06:21:55,183 INFO L390 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 8 treesize of output 7 [2022-07-21 06:21:55,206 INFO L390 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 8 treesize of output 7 [2022-07-21 06:21:55,231 INFO L390 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 8 treesize of output 7 [2022-07-21 06:21:55,251 INFO L390 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 8 treesize of output 7 [2022-07-21 06:21:55,538 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 06:21:55,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:55,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:55,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:55,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:55,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:55,591 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:55,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:55,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 275 [2022-07-21 06:21:55,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 06:21:55,691 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 06:21:55,707 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 06:21:55,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:55,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:55,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:55,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:55,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:55,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:55,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 280 [2022-07-21 06:21:55,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 06:21:55,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:55,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:55,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:55,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:55,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:55,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:55,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:55,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 265 [2022-07-21 06:21:56,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 06:21:56,100 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 06:21:56,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:56,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:56,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:56,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:56,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:56,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:56,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:56,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:56,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 285 [2022-07-21 06:21:56,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:56,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:56,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:56,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:56,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:56,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 104 [2022-07-21 06:21:56,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 06:21:56,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:56,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:21:56,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:56,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:56,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:56,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:21:56,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 99 [2022-07-21 06:21:56,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 06:22:00,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:00,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:00,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:22:00,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 16 [2022-07-21 06:22:00,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 06:22:06,849 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 06:22:06,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 22 [2022-07-21 06:22:07,621 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 06:22:07,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 22 [2022-07-21 06:22:07,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:07,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:07,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:07,651 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 06:22:07,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 326 treesize of output 328 [2022-07-21 06:22:08,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:08,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:08,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:08,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:08,126 INFO L356 Elim1Store]: treesize reduction 69, result has 49.3 percent of original size [2022-07-21 06:22:08,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 619 treesize of output 631 [2022-07-21 06:22:08,148 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 06:22:08,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-21 06:22:08,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-21 06:22:08,372 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 06:22:08,376 INFO L158 Benchmark]: Toolchain (without parser) took 132829.86ms. Allocated memory was 56.6MB in the beginning and 872.4MB in the end (delta: 815.8MB). Free memory was 34.2MB in the beginning and 349.3MB in the end (delta: -315.1MB). Peak memory consumption was 499.1MB. Max. memory is 16.1GB. [2022-07-21 06:22:08,376 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 56.6MB. Free memory is still 38.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 06:22:08,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 652.11ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 33.9MB in the beginning and 42.6MB in the end (delta: -8.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 06:22:08,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.45ms. Allocated memory is still 73.4MB. Free memory was 42.6MB in the beginning and 54.8MB in the end (delta: -12.2MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2022-07-21 06:22:08,376 INFO L158 Benchmark]: Boogie Preprocessor took 86.61ms. Allocated memory is still 73.4MB. Free memory was 54.8MB in the beginning and 51.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 06:22:08,377 INFO L158 Benchmark]: RCFGBuilder took 1395.90ms. Allocated memory is still 73.4MB. Free memory was 51.1MB in the beginning and 32.8MB in the end (delta: 18.3MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2022-07-21 06:22:08,377 INFO L158 Benchmark]: TraceAbstraction took 130569.89ms. Allocated memory was 73.4MB in the beginning and 872.4MB in the end (delta: 799.0MB). Free memory was 32.4MB in the beginning and 349.3MB in the end (delta: -316.9MB). Peak memory consumption was 481.6MB. Max. memory is 16.1GB. [2022-07-21 06:22:08,378 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.21ms. Allocated memory is still 56.6MB. Free memory is still 38.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 652.11ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 33.9MB in the beginning and 42.6MB in the end (delta: -8.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.45ms. Allocated memory is still 73.4MB. Free memory was 42.6MB in the beginning and 54.8MB in the end (delta: -12.2MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.61ms. Allocated memory is still 73.4MB. Free memory was 54.8MB in the beginning and 51.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1395.90ms. Allocated memory is still 73.4MB. Free memory was 51.1MB in the beginning and 32.8MB in the end (delta: 18.3MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * TraceAbstraction took 130569.89ms. Allocated memory was 73.4MB in the beginning and 872.4MB in the end (delta: 799.0MB). Free memory was 32.4MB in the beginning and 349.3MB in the end (delta: -316.9MB). Peak memory consumption was 481.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 06:22:08,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_lazy.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 06:22:10,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 06:22:10,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 06:22:10,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 06:22:10,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 06:22:10,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 06:22:10,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 06:22:10,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 06:22:10,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 06:22:10,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 06:22:10,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 06:22:10,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 06:22:10,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 06:22:10,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 06:22:10,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 06:22:10,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 06:22:10,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 06:22:10,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 06:22:10,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 06:22:10,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 06:22:10,479 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 06:22:10,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 06:22:10,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 06:22:10,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 06:22:10,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 06:22:10,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 06:22:10,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 06:22:10,487 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 06:22:10,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 06:22:10,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 06:22:10,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 06:22:10,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 06:22:10,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 06:22:10,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 06:22:10,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 06:22:10,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 06:22:10,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 06:22:10,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 06:22:10,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 06:22:10,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 06:22:10,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 06:22:10,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 06:22:10,500 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 06:22:10,531 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 06:22:10,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 06:22:10,532 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 06:22:10,532 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 06:22:10,533 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 06:22:10,533 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 06:22:10,534 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 06:22:10,534 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 06:22:10,534 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 06:22:10,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 06:22:10,535 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 06:22:10,535 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 06:22:10,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 06:22:10,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 06:22:10,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 06:22:10,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 06:22:10,536 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 06:22:10,537 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 06:22:10,537 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 06:22:10,537 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 06:22:10,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 06:22:10,537 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 06:22:10,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 06:22:10,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 06:22:10,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 06:22:10,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 06:22:10,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 06:22:10,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 06:22:10,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 06:22:10,539 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 06:22:10,539 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 06:22:10,539 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 06:22:10,539 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 06:22:10,540 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 06:22:10,540 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 06:22:10,540 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 06:22:10,540 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f [2022-07-21 06:22:10,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 06:22:10,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 06:22:10,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 06:22:10,886 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 06:22:10,887 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 06:22:10,888 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lazy.i [2022-07-21 06:22:10,941 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795069d46/91fe1b285acc45ce977b7e413354b5b0/FLAGfd4714ef6 [2022-07-21 06:22:11,471 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 06:22:11,475 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2022-07-21 06:22:11,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795069d46/91fe1b285acc45ce977b7e413354b5b0/FLAGfd4714ef6 [2022-07-21 06:22:11,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795069d46/91fe1b285acc45ce977b7e413354b5b0 [2022-07-21 06:22:11,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 06:22:11,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 06:22:11,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 06:22:11,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 06:22:11,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 06:22:11,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 06:22:11" (1/1) ... [2022-07-21 06:22:11,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d874acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:22:11, skipping insertion in model container [2022-07-21 06:22:11,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 06:22:11" (1/1) ... [2022-07-21 06:22:11,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 06:22:11,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 06:22:12,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2022-07-21 06:22:12,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 06:22:12,199 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 06:22:12,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i[23394,23407] [2022-07-21 06:22:12,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 06:22:12,296 INFO L208 MainTranslator]: Completed translation [2022-07-21 06:22:12,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:22:12 WrapperNode [2022-07-21 06:22:12,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 06:22:12,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 06:22:12,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 06:22:12,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 06:22:12,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:22:12" (1/1) ... [2022-07-21 06:22:12,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:22:12" (1/1) ... [2022-07-21 06:22:12,376 INFO L137 Inliner]: procedures = 149, calls = 212, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2022-07-21 06:22:12,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 06:22:12,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 06:22:12,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 06:22:12,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 06:22:12,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:22:12" (1/1) ... [2022-07-21 06:22:12,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:22:12" (1/1) ... [2022-07-21 06:22:12,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:22:12" (1/1) ... [2022-07-21 06:22:12,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:22:12" (1/1) ... [2022-07-21 06:22:12,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:22:12" (1/1) ... [2022-07-21 06:22:12,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:22:12" (1/1) ... [2022-07-21 06:22:12,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:22:12" (1/1) ... [2022-07-21 06:22:12,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 06:22:12,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 06:22:12,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 06:22:12,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 06:22:12,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:22:12" (1/1) ... [2022-07-21 06:22:12,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 06:22:12,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:22:12,469 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 06:22:12,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 06:22:12,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-21 06:22:12,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 06:22:12,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 06:22:12,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 06:22:12,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 06:22:12,508 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-21 06:22:12,508 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-21 06:22:12,508 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-21 06:22:12,508 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-21 06:22:12,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 06:22:12,509 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-21 06:22:12,509 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-21 06:22:12,509 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-21 06:22:12,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-21 06:22:12,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-21 06:22:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 06:22:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 06:22:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 06:22:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 06:22:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-21 06:22:12,510 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-21 06:22:12,511 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-21 06:22:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-21 06:22:12,511 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-21 06:22:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 06:22:12,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 06:22:12,687 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 06:22:12,689 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 06:22:13,037 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv32, 0bv32; [2022-07-21 06:22:13,038 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-07-21 06:22:13,038 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv32, 0bv32; [2022-07-21 06:22:13,038 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-07-21 06:22:13,038 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: SUMMARY for call __CS_cs(); srcloc: null [2022-07-21 06:22:13,038 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv32, 0bv32; [2022-07-21 06:22:13,038 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-07-21 06:22:15,531 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 06:22:15,544 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 06:22:15,544 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-21 06:22:15,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 06:22:15 BoogieIcfgContainer [2022-07-21 06:22:15,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 06:22:15,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 06:22:15,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 06:22:15,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 06:22:15,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 06:22:11" (1/3) ... [2022-07-21 06:22:15,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26235f43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 06:22:15, skipping insertion in model container [2022-07-21 06:22:15,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:22:12" (2/3) ... [2022-07-21 06:22:15,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26235f43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 06:22:15, skipping insertion in model container [2022-07-21 06:22:15,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 06:22:15" (3/3) ... [2022-07-21 06:22:15,556 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2022-07-21 06:22:15,569 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 06:22:15,569 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 06:22:15,623 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 06:22:15,630 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@11f13dcc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@a8d578f [2022-07-21 06:22:15,630 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 06:22:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 119 states have (on average 1.495798319327731) internal successors, (178), 120 states have internal predecessors, (178), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-21 06:22:15,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 06:22:15,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:22:15,660 INFO L195 NwaCegarLoop]: 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] [2022-07-21 06:22:15,661 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:22:15,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:22:15,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1643557001, now seen corresponding path program 1 times [2022-07-21 06:22:15,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 06:22:15,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249394036] [2022-07-21 06:22:15,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:15,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 06:22:15,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 06:22:15,688 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 06:22:15,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 06:22:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:16,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 06:22:16,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:22:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 06:22:16,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:22:16,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 06:22:16,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249394036] [2022-07-21 06:22:16,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249394036] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:22:16,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:22:16,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 06:22:16,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602047905] [2022-07-21 06:22:16,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:22:16,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 06:22:16,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 06:22:16,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 06:22:16,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 06:22:16,240 INFO L87 Difference]: Start difference. First operand has 164 states, 119 states have (on average 1.495798319327731) internal successors, (178), 120 states have internal predecessors, (178), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 06:22:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:22:16,275 INFO L93 Difference]: Finished difference Result 326 states and 530 transitions. [2022-07-21 06:22:16,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 06:22:16,278 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-07-21 06:22:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:22:16,288 INFO L225 Difference]: With dead ends: 326 [2022-07-21 06:22:16,288 INFO L226 Difference]: Without dead ends: 160 [2022-07-21 06:22:16,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 06:22:16,297 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:22:16,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:22:16,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-21 06:22:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-07-21 06:22:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-21 06:22:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 233 transitions. [2022-07-21 06:22:16,354 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 233 transitions. Word has length 34 [2022-07-21 06:22:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:22:16,355 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 233 transitions. [2022-07-21 06:22:16,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 06:22:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 233 transitions. [2022-07-21 06:22:16,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 06:22:16,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:22:16,358 INFO L195 NwaCegarLoop]: 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] [2022-07-21 06:22:16,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-21 06:22:16,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 06:22:16,576 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:22:16,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:22:16,578 INFO L85 PathProgramCache]: Analyzing trace with hash 819536951, now seen corresponding path program 1 times [2022-07-21 06:22:16,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 06:22:16,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072239800] [2022-07-21 06:22:16,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:16,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 06:22:16,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 06:22:16,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 06:22:16,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 06:22:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:16,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 06:22:16,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:22:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 06:22:17,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:22:17,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 06:22:17,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072239800] [2022-07-21 06:22:17,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072239800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:22:17,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:22:17,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 06:22:17,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582679057] [2022-07-21 06:22:17,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:22:17,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 06:22:17,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 06:22:17,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 06:22:17,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 06:22:17,007 INFO L87 Difference]: Start difference. First operand 160 states and 233 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 06:22:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:22:17,142 INFO L93 Difference]: Finished difference Result 318 states and 464 transitions. [2022-07-21 06:22:17,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 06:22:17,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-07-21 06:22:17,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:22:17,149 INFO L225 Difference]: With dead ends: 318 [2022-07-21 06:22:17,149 INFO L226 Difference]: Without dead ends: 165 [2022-07-21 06:22:17,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 06:22:17,152 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 5 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 06:22:17,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 456 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 06:22:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-21 06:22:17,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2022-07-21 06:22:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 117 states have internal predecessors, (160), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-21 06:22:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 234 transitions. [2022-07-21 06:22:17,169 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 234 transitions. Word has length 34 [2022-07-21 06:22:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:22:17,169 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 234 transitions. [2022-07-21 06:22:17,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 06:22:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2022-07-21 06:22:17,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 06:22:17,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:22:17,176 INFO L195 NwaCegarLoop]: 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] [2022-07-21 06:22:17,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 06:22:17,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 06:22:17,384 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:22:17,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:22:17,384 INFO L85 PathProgramCache]: Analyzing trace with hash -883018881, now seen corresponding path program 1 times [2022-07-21 06:22:17,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 06:22:17,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387547667] [2022-07-21 06:22:17,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:17,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 06:22:17,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 06:22:17,387 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 06:22:17,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 06:22:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:17,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 06:22:17,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:22:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 06:22:17,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:22:17,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 06:22:17,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387547667] [2022-07-21 06:22:17,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387547667] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:22:17,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:22:17,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 06:22:17,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852747426] [2022-07-21 06:22:17,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:22:17,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 06:22:17,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 06:22:17,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 06:22:17,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 06:22:17,787 INFO L87 Difference]: Start difference. First operand 161 states and 234 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 06:22:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:22:17,863 INFO L93 Difference]: Finished difference Result 321 states and 468 transitions. [2022-07-21 06:22:17,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 06:22:17,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-07-21 06:22:17,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:22:17,873 INFO L225 Difference]: With dead ends: 321 [2022-07-21 06:22:17,876 INFO L226 Difference]: Without dead ends: 163 [2022-07-21 06:22:17,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 06:22:17,879 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 1 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 06:22:17,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 459 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 06:22:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-21 06:22:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2022-07-21 06:22:17,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 118 states have (on average 1.3644067796610169) internal successors, (161), 118 states have internal predecessors, (161), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-21 06:22:17,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 235 transitions. [2022-07-21 06:22:17,893 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 235 transitions. Word has length 38 [2022-07-21 06:22:17,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:22:17,893 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 235 transitions. [2022-07-21 06:22:17,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 06:22:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 235 transitions. [2022-07-21 06:22:17,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-21 06:22:17,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:22:17,895 INFO L195 NwaCegarLoop]: 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] [2022-07-21 06:22:17,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 06:22:18,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 06:22:18,111 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:22:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:22:18,111 INFO L85 PathProgramCache]: Analyzing trace with hash -786448707, now seen corresponding path program 1 times [2022-07-21 06:22:18,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 06:22:18,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927774541] [2022-07-21 06:22:18,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:18,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 06:22:18,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 06:22:18,113 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 06:22:18,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 06:22:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:18,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 06:22:18,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:22:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 06:22:18,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:22:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 06:22:18,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 06:22:18,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927774541] [2022-07-21 06:22:18,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927774541] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:22:18,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 06:22:18,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-21 06:22:18,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601603509] [2022-07-21 06:22:18,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 06:22:18,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 06:22:18,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 06:22:18,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 06:22:18,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-21 06:22:18,625 INFO L87 Difference]: Start difference. First operand 162 states and 235 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 06:22:18,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:22:18,809 INFO L93 Difference]: Finished difference Result 327 states and 476 transitions. [2022-07-21 06:22:18,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 06:22:18,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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 40 [2022-07-21 06:22:18,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:22:18,812 INFO L225 Difference]: With dead ends: 327 [2022-07-21 06:22:18,812 INFO L226 Difference]: Without dead ends: 168 [2022-07-21 06:22:18,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-07-21 06:22:18,814 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 4 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 06:22:18,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1143 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 06:22:18,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-21 06:22:18,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-21 06:22:18,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 124 states have (on average 1.346774193548387) internal successors, (167), 124 states have internal predecessors, (167), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-21 06:22:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 241 transitions. [2022-07-21 06:22:18,828 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 241 transitions. Word has length 40 [2022-07-21 06:22:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:22:18,829 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 241 transitions. [2022-07-21 06:22:18,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 06:22:18,837 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 241 transitions. [2022-07-21 06:22:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 06:22:18,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:22:18,839 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:22:18,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 06:22:19,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 06:22:19,055 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:22:19,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:22:19,056 INFO L85 PathProgramCache]: Analyzing trace with hash 386454391, now seen corresponding path program 2 times [2022-07-21 06:22:19,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 06:22:19,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741179696] [2022-07-21 06:22:19,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 06:22:19,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 06:22:19,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 06:22:19,058 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 06:22:19,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 06:22:19,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 06:22:19,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 06:22:19,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 06:22:19,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:22:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 06:22:19,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:22:19,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 06:22:19,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741179696] [2022-07-21 06:22:19,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741179696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:22:19,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:22:19,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 06:22:19,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420563142] [2022-07-21 06:22:19,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:22:19,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 06:22:19,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 06:22:19,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 06:22:19,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 06:22:19,470 INFO L87 Difference]: Start difference. First operand 168 states and 241 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 06:22:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:22:19,492 INFO L93 Difference]: Finished difference Result 316 states and 457 transitions. [2022-07-21 06:22:19,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 06:22:19,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 46 [2022-07-21 06:22:19,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:22:19,494 INFO L225 Difference]: With dead ends: 316 [2022-07-21 06:22:19,494 INFO L226 Difference]: Without dead ends: 168 [2022-07-21 06:22:19,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 06:22:19,496 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:22:19,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:22:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-21 06:22:19,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-21 06:22:19,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 124 states have internal predecessors, (166), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-21 06:22:19,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 240 transitions. [2022-07-21 06:22:19,508 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 240 transitions. Word has length 46 [2022-07-21 06:22:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:22:19,508 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 240 transitions. [2022-07-21 06:22:19,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 06:22:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 240 transitions. [2022-07-21 06:22:19,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-21 06:22:19,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:22:19,510 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:22:19,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 06:22:19,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 06:22:19,728 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:22:19,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:22:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1136086573, now seen corresponding path program 1 times [2022-07-21 06:22:19,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 06:22:19,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192666140] [2022-07-21 06:22:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:19,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 06:22:19,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 06:22:19,731 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 06:22:19,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-21 06:22:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:20,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 06:22:20,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:22:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 06:22:20,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:22:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 06:22:20,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 06:22:20,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192666140] [2022-07-21 06:22:20,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192666140] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:22:20,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 06:22:20,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-21 06:22:20,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712525306] [2022-07-21 06:22:20,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 06:22:20,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 06:22:20,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 06:22:20,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 06:22:20,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 06:22:20,356 INFO L87 Difference]: Start difference. First operand 168 states and 240 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 06:22:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:22:20,662 INFO L93 Difference]: Finished difference Result 344 states and 489 transitions. [2022-07-21 06:22:20,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 06:22:20,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2022-07-21 06:22:20,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:22:20,664 INFO L225 Difference]: With dead ends: 344 [2022-07-21 06:22:20,664 INFO L226 Difference]: Without dead ends: 191 [2022-07-21 06:22:20,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 06:22:20,672 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 14 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 06:22:20,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1132 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 06:22:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-21 06:22:20,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 180. [2022-07-21 06:22:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 136 states have internal predecessors, (179), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-21 06:22:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 253 transitions. [2022-07-21 06:22:20,692 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 253 transitions. Word has length 64 [2022-07-21 06:22:20,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:22:20,693 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 253 transitions. [2022-07-21 06:22:20,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 06:22:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 253 transitions. [2022-07-21 06:22:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-21 06:22:20,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:22:20,695 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 06:22:20,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-21 06:22:20,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 06:22:20,913 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:22:20,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:22:20,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1095643411, now seen corresponding path program 2 times [2022-07-21 06:22:20,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 06:22:20,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752467542] [2022-07-21 06:22:20,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 06:22:20,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 06:22:20,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 06:22:20,915 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 06:22:20,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-21 06:22:21,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 06:22:21,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 06:22:21,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 06:22:21,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:22:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-21 06:22:21,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:22:21,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 06:22:21,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752467542] [2022-07-21 06:22:21,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752467542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:22:21,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:22:21,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 06:22:21,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114866045] [2022-07-21 06:22:21,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:22:21,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 06:22:21,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 06:22:21,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 06:22:21,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 06:22:21,650 INFO L87 Difference]: Start difference. First operand 180 states and 253 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 06:22:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:22:22,663 INFO L93 Difference]: Finished difference Result 361 states and 535 transitions. [2022-07-21 06:22:22,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 06:22:22,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2022-07-21 06:22:22,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:22:22,668 INFO L225 Difference]: With dead ends: 361 [2022-07-21 06:22:22,668 INFO L226 Difference]: Without dead ends: 335 [2022-07-21 06:22:22,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 06:22:22,669 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 303 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 06:22:22,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 699 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 06:22:22,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-07-21 06:22:22,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 334. [2022-07-21 06:22:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 236 states have internal predecessors, (324), 81 states have call successors, (81), 12 states have call predecessors, (81), 15 states have return successors, (101), 85 states have call predecessors, (101), 81 states have call successors, (101) [2022-07-21 06:22:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 506 transitions. [2022-07-21 06:22:22,694 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 506 transitions. Word has length 76 [2022-07-21 06:22:22,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:22:22,694 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 506 transitions. [2022-07-21 06:22:22,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 06:22:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 506 transitions. [2022-07-21 06:22:22,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-21 06:22:22,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:22:22,697 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:22:22,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-21 06:22:22,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 06:22:22,919 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:22:22,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:22:22,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1669023574, now seen corresponding path program 1 times [2022-07-21 06:22:22,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 06:22:22,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788773871] [2022-07-21 06:22:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:22,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 06:22:22,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 06:22:22,921 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 06:22:22,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-21 06:22:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:23,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 06:22:23,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:22:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-21 06:22:23,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:22:23,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 06:22:23,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788773871] [2022-07-21 06:22:23,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788773871] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:22:23,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:22:23,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 06:22:23,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568519835] [2022-07-21 06:22:23,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:22:23,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 06:22:23,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 06:22:23,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 06:22:23,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 06:22:23,787 INFO L87 Difference]: Start difference. First operand 334 states and 506 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 06:22:24,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:22:24,597 INFO L93 Difference]: Finished difference Result 809 states and 1302 transitions. [2022-07-21 06:22:24,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 06:22:24,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 121 [2022-07-21 06:22:24,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:22:24,602 INFO L225 Difference]: With dead ends: 809 [2022-07-21 06:22:24,602 INFO L226 Difference]: Without dead ends: 505 [2022-07-21 06:22:24,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-21 06:22:24,606 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 306 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 06:22:24,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 495 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 06:22:24,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-07-21 06:22:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 467. [2022-07-21 06:22:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 347 states have (on average 1.2564841498559078) internal successors, (436), 298 states have internal predecessors, (436), 95 states have call successors, (95), 14 states have call predecessors, (95), 24 states have return successors, (190), 154 states have call predecessors, (190), 95 states have call successors, (190) [2022-07-21 06:22:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 721 transitions. [2022-07-21 06:22:24,653 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 721 transitions. Word has length 121 [2022-07-21 06:22:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:22:24,653 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 721 transitions. [2022-07-21 06:22:24,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 06:22:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 721 transitions. [2022-07-21 06:22:24,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-21 06:22:24,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:22:24,656 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:22:24,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-21 06:22:24,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 06:22:24,877 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:22:24,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:22:24,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1837039795, now seen corresponding path program 1 times [2022-07-21 06:22:24,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 06:22:24,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080796590] [2022-07-21 06:22:24,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:24,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 06:22:24,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 06:22:24,879 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 06:22:24,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-21 06:22:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:26,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 06:22:26,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:22:26,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-07-21 06:22:26,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-21 06:22:26,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-07-21 06:22:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 06:22:26,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:22:26,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 8 [2022-07-21 06:22:26,800 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 06:22:26,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 06:22:26,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080796590] [2022-07-21 06:22:26,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080796590] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:22:26,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 06:22:26,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-07-21 06:22:26,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581931135] [2022-07-21 06:22:26,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 06:22:26,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 06:22:26,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 06:22:26,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 06:22:26,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 06:22:26,802 INFO L87 Difference]: Start difference. First operand 467 states and 721 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-21 06:22:28,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:22:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:22:29,985 INFO L93 Difference]: Finished difference Result 1084 states and 1758 transitions. [2022-07-21 06:22:29,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 06:22:29,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 122 [2022-07-21 06:22:29,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:22:29,998 INFO L225 Difference]: With dead ends: 1084 [2022-07-21 06:22:29,999 INFO L226 Difference]: Without dead ends: 1056 [2022-07-21 06:22:30,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-21 06:22:30,002 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 711 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 389 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-21 06:22:30,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 633 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 317 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-07-21 06:22:30,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-07-21 06:22:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1004. [2022-07-21 06:22:30,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 719 states have (on average 1.262865090403338) internal successors, (908), 616 states have internal predecessors, (908), 224 states have call successors, (224), 28 states have call predecessors, (224), 60 states have return successors, (520), 359 states have call predecessors, (520), 224 states have call successors, (520) [2022-07-21 06:22:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1652 transitions. [2022-07-21 06:22:30,081 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1652 transitions. Word has length 122 [2022-07-21 06:22:30,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:22:30,082 INFO L495 AbstractCegarLoop]: Abstraction has 1004 states and 1652 transitions. [2022-07-21 06:22:30,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-21 06:22:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1652 transitions. [2022-07-21 06:22:30,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-21 06:22:30,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:22:30,085 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:22:30,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-21 06:22:30,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 06:22:30,307 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:22:30,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:22:30,308 INFO L85 PathProgramCache]: Analyzing trace with hash -2094798163, now seen corresponding path program 1 times [2022-07-21 06:22:30,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 06:22:30,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608743885] [2022-07-21 06:22:30,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:30,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 06:22:30,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 06:22:30,310 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 06:22:30,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-21 06:22:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:31,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 06:22:31,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:22:31,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-07-21 06:22:31,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-21 06:22:31,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-07-21 06:22:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 06:22:31,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:22:31,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 8 [2022-07-21 06:22:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 06:22:32,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 06:22:32,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608743885] [2022-07-21 06:22:32,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608743885] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:22:32,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 06:22:32,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-07-21 06:22:32,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348715938] [2022-07-21 06:22:32,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 06:22:32,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 06:22:32,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 06:22:32,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 06:22:32,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 06:22:32,032 INFO L87 Difference]: Start difference. First operand 1004 states and 1652 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-21 06:22:34,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:22:36,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:22:36,094 INFO L93 Difference]: Finished difference Result 1653 states and 2632 transitions. [2022-07-21 06:22:36,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 06:22:36,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 122 [2022-07-21 06:22:36,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:22:36,102 INFO L225 Difference]: With dead ends: 1653 [2022-07-21 06:22:36,103 INFO L226 Difference]: Without dead ends: 1056 [2022-07-21 06:22:36,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-21 06:22:36,106 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 395 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 186 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-21 06:22:36,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 750 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 430 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-07-21 06:22:36,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-07-21 06:22:36,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1010. [2022-07-21 06:22:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 723 states have (on average 1.2614107883817427) internal successors, (912), 622 states have internal predecessors, (912), 224 states have call successors, (224), 28 states have call predecessors, (224), 62 states have return successors, (518), 359 states have call predecessors, (518), 224 states have call successors, (518) [2022-07-21 06:22:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1654 transitions. [2022-07-21 06:22:36,176 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1654 transitions. Word has length 122 [2022-07-21 06:22:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:22:36,177 INFO L495 AbstractCegarLoop]: Abstraction has 1010 states and 1654 transitions. [2022-07-21 06:22:36,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-21 06:22:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1654 transitions. [2022-07-21 06:22:36,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-21 06:22:36,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:22:36,183 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:22:36,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-21 06:22:36,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 06:22:36,401 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:22:36,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:22:36,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1285087731, now seen corresponding path program 1 times [2022-07-21 06:22:36,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 06:22:36,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162938298] [2022-07-21 06:22:36,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:36,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 06:22:36,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 06:22:36,404 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 06:22:36,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-21 06:22:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:37,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 06:22:37,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:22:37,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-07-21 06:22:37,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-21 06:22:38,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-07-21 06:22:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 06:22:38,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:22:38,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 8 [2022-07-21 06:22:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 06:22:38,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 06:22:38,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162938298] [2022-07-21 06:22:38,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162938298] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:22:38,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 06:22:38,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-07-21 06:22:38,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096329828] [2022-07-21 06:22:38,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 06:22:38,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 06:22:38,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 06:22:38,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 06:22:38,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 06:22:38,537 INFO L87 Difference]: Start difference. First operand 1010 states and 1654 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-21 06:22:40,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:22:42,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:22:42,791 INFO L93 Difference]: Finished difference Result 1994 states and 3215 transitions. [2022-07-21 06:22:42,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 06:22:42,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 122 [2022-07-21 06:22:42,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:22:42,799 INFO L225 Difference]: With dead ends: 1994 [2022-07-21 06:22:42,799 INFO L226 Difference]: Without dead ends: 1026 [2022-07-21 06:22:42,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-21 06:22:42,805 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 453 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 249 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-21 06:22:42,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 887 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 445 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-07-21 06:22:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2022-07-21 06:22:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 980. [2022-07-21 06:22:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 703 states have (on average 1.2588904694167853) internal successors, (885), 605 states have internal predecessors, (885), 216 states have call successors, (216), 28 states have call predecessors, (216), 60 states have return successors, (495), 346 states have call predecessors, (495), 216 states have call successors, (495) [2022-07-21 06:22:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1596 transitions. [2022-07-21 06:22:42,896 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1596 transitions. Word has length 122 [2022-07-21 06:22:42,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:22:42,896 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1596 transitions. [2022-07-21 06:22:42,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-21 06:22:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1596 transitions. [2022-07-21 06:22:42,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-21 06:22:42,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:22:42,900 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:22:42,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-21 06:22:43,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 06:22:43,121 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:22:43,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:22:43,121 INFO L85 PathProgramCache]: Analyzing trace with hash -892722353, now seen corresponding path program 1 times [2022-07-21 06:22:43,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 06:22:43,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708140989] [2022-07-21 06:22:43,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:43,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 06:22:43,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 06:22:43,124 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 06:22:43,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-21 06:22:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:43,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 06:22:43,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:22:43,800 INFO L390 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 [2022-07-21 06:22:43,813 INFO L390 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 [2022-07-21 06:22:43,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 06:22:43,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-21 06:22:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-21 06:22:44,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:22:44,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 06:22:44,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708140989] [2022-07-21 06:22:44,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [708140989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:22:44,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:22:44,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 06:22:44,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391217932] [2022-07-21 06:22:44,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:22:44,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 06:22:44,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 06:22:44,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 06:22:44,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 06:22:44,089 INFO L87 Difference]: Start difference. First operand 980 states and 1596 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 06:22:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:22:44,630 INFO L93 Difference]: Finished difference Result 1980 states and 3213 transitions. [2022-07-21 06:22:44,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 06:22:44,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 104 [2022-07-21 06:22:44,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:22:44,638 INFO L225 Difference]: With dead ends: 1980 [2022-07-21 06:22:44,638 INFO L226 Difference]: Without dead ends: 1001 [2022-07-21 06:22:44,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 06:22:44,644 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 269 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 06:22:44,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 721 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 06:22:44,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2022-07-21 06:22:44,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 949. [2022-07-21 06:22:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 681 states have (on average 1.2555066079295154) internal successors, (855), 590 states have internal predecessors, (855), 207 states have call successors, (207), 28 states have call predecessors, (207), 60 states have return successors, (490), 330 states have call predecessors, (490), 207 states have call successors, (490) [2022-07-21 06:22:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1552 transitions. [2022-07-21 06:22:44,708 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1552 transitions. Word has length 104 [2022-07-21 06:22:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:22:44,708 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1552 transitions. [2022-07-21 06:22:44,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 06:22:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1552 transitions. [2022-07-21 06:22:44,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-21 06:22:44,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:22:44,712 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:22:44,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-21 06:22:44,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 06:22:44,927 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:22:44,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:22:44,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1964731096, now seen corresponding path program 1 times [2022-07-21 06:22:44,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 06:22:44,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261820196] [2022-07-21 06:22:44,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:44,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 06:22:44,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 06:22:44,930 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 06:22:44,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-21 06:22:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:46,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 06:22:46,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:22:46,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-07-21 06:22:46,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-21 06:22:46,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-07-21 06:22:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-21 06:22:46,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:22:46,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 8 [2022-07-21 06:22:47,177 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-21 06:22:47,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 06:22:47,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261820196] [2022-07-21 06:22:47,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261820196] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:22:47,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 06:22:47,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-07-21 06:22:47,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614794904] [2022-07-21 06:22:47,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 06:22:47,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 06:22:47,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 06:22:47,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 06:22:47,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 06:22:47,178 INFO L87 Difference]: Start difference. First operand 949 states and 1552 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-21 06:22:49,202 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:22:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:22:51,904 INFO L93 Difference]: Finished difference Result 1041 states and 1676 transitions. [2022-07-21 06:22:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 06:22:51,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 136 [2022-07-21 06:22:51,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:22:51,917 INFO L225 Difference]: With dead ends: 1041 [2022-07-21 06:22:51,917 INFO L226 Difference]: Without dead ends: 1013 [2022-07-21 06:22:51,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-21 06:22:51,920 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 458 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 277 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-21 06:22:51,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 724 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 369 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-07-21 06:22:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2022-07-21 06:22:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 961. [2022-07-21 06:22:51,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 689 states have (on average 1.2525399129172714) internal successors, (863), 602 states have internal predecessors, (863), 207 states have call successors, (207), 28 states have call predecessors, (207), 64 states have return successors, (492), 330 states have call predecessors, (492), 207 states have call successors, (492) [2022-07-21 06:22:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1562 transitions. [2022-07-21 06:22:51,974 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1562 transitions. Word has length 136 [2022-07-21 06:22:51,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:22:51,974 INFO L495 AbstractCegarLoop]: Abstraction has 961 states and 1562 transitions. [2022-07-21 06:22:51,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-21 06:22:51,975 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1562 transitions. [2022-07-21 06:22:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-21 06:22:51,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:22:51,979 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 06:22:52,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-21 06:22:52,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 06:22:52,195 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:22:52,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:22:52,196 INFO L85 PathProgramCache]: Analyzing trace with hash -462837888, now seen corresponding path program 1 times [2022-07-21 06:22:52,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 06:22:52,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706754350] [2022-07-21 06:22:52,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:52,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 06:22:52,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 06:22:52,198 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 06:22:52,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-21 06:22:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:54,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 119 conjunts are in the unsatisfiable core [2022-07-21 06:22:54,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:22:55,399 INFO L356 Elim1Store]: treesize reduction 96, result has 43.2 percent of original size [2022-07-21 06:22:55,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 76 treesize of output 130 [2022-07-21 06:23:13,497 WARN L233 SmtUtils]: Spent 15.42s on a formula simplification. DAG size of input: 79 DAG size of output: 43 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-21 06:23:13,498 INFO L356 Elim1Store]: treesize reduction 364, result has 23.0 percent of original size [2022-07-21 06:23:13,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 392 treesize of output 469 [2022-07-21 06:23:13,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 06:23:13,909 INFO L244 Elim1Store]: Index analysis took 358 ms [2022-07-21 06:23:16,278 INFO L356 Elim1Store]: treesize reduction 226, result has 11.0 percent of original size [2022-07-21 06:23:16,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 333 treesize of output 580