./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 6c24879c 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-?-6c24879 [2022-07-12 07:39:48,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 07:39:48,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 07:39:48,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 07:39:48,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 07:39:48,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 07:39:48,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 07:39:48,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 07:39:48,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 07:39:48,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 07:39:48,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 07:39:48,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 07:39:48,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 07:39:48,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 07:39:48,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 07:39:48,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 07:39:48,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 07:39:48,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 07:39:48,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 07:39:48,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 07:39:48,510 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 07:39:48,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 07:39:48,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 07:39:48,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 07:39:48,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 07:39:48,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 07:39:48,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 07:39:48,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 07:39:48,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 07:39:48,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 07:39:48,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 07:39:48,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 07:39:48,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 07:39:48,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 07:39:48,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 07:39:48,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 07:39:48,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 07:39:48,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 07:39:48,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 07:39:48,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 07:39:48,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 07:39:48,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 07:39:48,529 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 07:39:48,559 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 07:39:48,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 07:39:48,559 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 07:39:48,559 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 07:39:48,560 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 07:39:48,560 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 07:39:48,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 07:39:48,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 07:39:48,561 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 07:39:48,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 07:39:48,562 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 07:39:48,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 07:39:48,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 07:39:48,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 07:39:48,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 07:39:48,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 07:39:48,563 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 07:39:48,563 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 07:39:48,563 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 07:39:48,564 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 07:39:48,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 07:39:48,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 07:39:48,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 07:39:48,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 07:39:48,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 07:39:48,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 07:39:48,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 07:39:48,565 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 07:39:48,565 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 07:39:48,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 07:39:48,566 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 07:39:48,566 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 07:39:48,566 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 07:39:48,566 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-12 07:39:48,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 07:39:48,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 07:39:48,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 07:39:48,799 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 07:39:48,799 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 07:39:48,800 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-12 07:39:48,848 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d19215e9/4de86e20afa5461581a6532b20b3ef62/FLAGd921339d4 [2022-07-12 07:39:49,245 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 07:39:49,245 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2022-07-12 07:39:49,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d19215e9/4de86e20afa5461581a6532b20b3ef62/FLAGd921339d4 [2022-07-12 07:39:49,582 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d19215e9/4de86e20afa5461581a6532b20b3ef62 [2022-07-12 07:39:49,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 07:39:49,584 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 07:39:49,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 07:39:49,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 07:39:49,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 07:39:49,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:39:49" (1/1) ... [2022-07-12 07:39:49,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6600fd44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:39:49, skipping insertion in model container [2022-07-12 07:39:49,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:39:49" (1/1) ... [2022-07-12 07:39:49,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 07:39:49,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 07:39:49,852 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-12 07:39:49,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 07:39:49,950 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 07:39:49,982 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-12 07:39:50,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 07:39:50,032 INFO L208 MainTranslator]: Completed translation [2022-07-12 07:39:50,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:39:50 WrapperNode [2022-07-12 07:39:50,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 07:39:50,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 07:39:50,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 07:39:50,034 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 07:39:50,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:39:50" (1/1) ... [2022-07-12 07:39:50,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:39:50" (1/1) ... [2022-07-12 07:39:50,102 INFO L137 Inliner]: procedures = 145, calls = 212, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 514 [2022-07-12 07:39:50,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 07:39:50,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 07:39:50,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 07:39:50,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 07:39:50,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:39:50" (1/1) ... [2022-07-12 07:39:50,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:39:50" (1/1) ... [2022-07-12 07:39:50,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:39:50" (1/1) ... [2022-07-12 07:39:50,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:39:50" (1/1) ... [2022-07-12 07:39:50,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:39:50" (1/1) ... [2022-07-12 07:39:50,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:39:50" (1/1) ... [2022-07-12 07:39:50,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:39:50" (1/1) ... [2022-07-12 07:39:50,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 07:39:50,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 07:39:50,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 07:39:50,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 07:39:50,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:39:50" (1/1) ... [2022-07-12 07:39:50,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 07:39:50,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:39:50,177 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-12 07:39:50,183 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-12 07:39:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 07:39:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 07:39:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 07:39:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 07:39:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 07:39:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-12 07:39:50,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-12 07:39:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-12 07:39:50,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-12 07:39:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 07:39:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-12 07:39:50,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-12 07:39:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-12 07:39:50,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-12 07:39:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 07:39:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 07:39:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-12 07:39:50,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-12 07:39:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 07:39:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-12 07:39:50,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-12 07:39:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 07:39:50,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 07:39:50,351 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 07:39:50,352 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 07:39:50,562 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-12 07:39:50,562 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != ~__CS_ret~0 % 256); [2022-07-12 07:39:50,562 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-12 07:39:50,563 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !(0 != ~__CS_ret~0 % 256); [2022-07-12 07:39:50,563 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: SUMMARY for call __CS_cs(); srcloc: null [2022-07-12 07:39:50,563 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-12 07:39:50,563 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume !(0 != ~__CS_ret~0 % 256); [2022-07-12 07:39:51,242 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 07:39:51,249 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 07:39:51,250 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 07:39:51,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:39:51 BoogieIcfgContainer [2022-07-12 07:39:51,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 07:39:51,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 07:39:51,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 07:39:51,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 07:39:51,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:39:49" (1/3) ... [2022-07-12 07:39:51,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16abb645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:39:51, skipping insertion in model container [2022-07-12 07:39:51,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:39:50" (2/3) ... [2022-07-12 07:39:51,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16abb645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:39:51, skipping insertion in model container [2022-07-12 07:39:51,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:39:51" (3/3) ... [2022-07-12 07:39:51,258 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2022-07-12 07:39:51,268 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 07:39:51,268 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 07:39:51,324 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 07:39:51,346 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@8481f6a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@38482c47 [2022-07-12 07:39:51,347 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 07:39:51,350 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-12 07:39:51,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 07:39:51,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:39:51,366 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-12 07:39:51,367 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:39:51,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:39:51,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1643557001, now seen corresponding path program 1 times [2022-07-12 07:39:51,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:39:51,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866033367] [2022-07-12 07:39:51,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:39:51,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:39:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:51,706 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-12 07:39:51,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:39:51,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866033367] [2022-07-12 07:39:51,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866033367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:39:51,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:39:51,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 07:39:51,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692996591] [2022-07-12 07:39:51,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:39:51,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:39:51,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:39:51,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:39:51,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:39:51,758 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-12 07:39:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:39:51,830 INFO L93 Difference]: Finished difference Result 331 states and 539 transitions. [2022-07-12 07:39:51,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:39:51,832 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-12 07:39:51,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:39:51,839 INFO L225 Difference]: With dead ends: 331 [2022-07-12 07:39:51,839 INFO L226 Difference]: Without dead ends: 165 [2022-07-12 07:39:51,843 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-12 07:39:51,849 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-12 07:39:51,850 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-12 07:39:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-12 07:39:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2022-07-12 07:39:51,883 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-12 07:39:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 234 transitions. [2022-07-12 07:39:51,886 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 234 transitions. Word has length 34 [2022-07-12 07:39:51,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:39:51,887 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 234 transitions. [2022-07-12 07:39:51,887 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-12 07:39:51,887 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2022-07-12 07:39:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 07:39:51,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:39:51,894 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-12 07:39:51,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 07:39:51,895 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:39:51,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:39:51,895 INFO L85 PathProgramCache]: Analyzing trace with hash -883018881, now seen corresponding path program 1 times [2022-07-12 07:39:51,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:39:51,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297648799] [2022-07-12 07:39:51,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:39:51,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:39:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:51,974 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-12 07:39:51,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:39:51,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297648799] [2022-07-12 07:39:51,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297648799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:39:51,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:39:51,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 07:39:51,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825073819] [2022-07-12 07:39:51,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:39:51,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:39:51,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:39:51,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:39:51,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:39:51,979 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-12 07:39:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:39:52,011 INFO L93 Difference]: Finished difference Result 321 states and 468 transitions. [2022-07-12 07:39:52,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:39:52,012 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-12 07:39:52,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:39:52,021 INFO L225 Difference]: With dead ends: 321 [2022-07-12 07:39:52,021 INFO L226 Difference]: Without dead ends: 163 [2022-07-12 07:39:52,025 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-12 07:39:52,026 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-12 07:39:52,027 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-12 07:39:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-12 07:39:52,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2022-07-12 07:39:52,039 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-12 07:39:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 235 transitions. [2022-07-12 07:39:52,040 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 235 transitions. Word has length 38 [2022-07-12 07:39:52,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:39:52,041 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 235 transitions. [2022-07-12 07:39:52,041 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-12 07:39:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 235 transitions. [2022-07-12 07:39:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 07:39:52,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:39:52,042 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-12 07:39:52,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 07:39:52,043 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:39:52,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:39:52,043 INFO L85 PathProgramCache]: Analyzing trace with hash -786448707, now seen corresponding path program 1 times [2022-07-12 07:39:52,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:39:52,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063944119] [2022-07-12 07:39:52,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:39:52,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:39:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:52,167 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-12 07:39:52,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:39:52,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063944119] [2022-07-12 07:39:52,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063944119] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:39:52,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840876927] [2022-07-12 07:39:52,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:39:52,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:39:52,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:39:52,178 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-12 07:39:52,187 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-12 07:39:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:52,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 07:39:52,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:39:52,496 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-12 07:39:52,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:39:52,516 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-12 07:39:52,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840876927] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 07:39:52,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 07:39:52,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-12 07:39:52,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606480993] [2022-07-12 07:39:52,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 07:39:52,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 07:39:52,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:39:52,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 07:39:52,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-12 07:39:52,519 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-12 07:39:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:39:52,576 INFO L93 Difference]: Finished difference Result 327 states and 476 transitions. [2022-07-12 07:39:52,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 07:39:52,577 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-12 07:39:52,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:39:52,579 INFO L225 Difference]: With dead ends: 327 [2022-07-12 07:39:52,579 INFO L226 Difference]: Without dead ends: 168 [2022-07-12 07:39:52,580 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-12 07:39:52,581 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-12 07:39:52,581 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-12 07:39:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-12 07:39:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-12 07:39:52,592 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-12 07:39:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 241 transitions. [2022-07-12 07:39:52,593 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 241 transitions. Word has length 40 [2022-07-12 07:39:52,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:39:52,594 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 241 transitions. [2022-07-12 07:39:52,594 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-12 07:39:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 241 transitions. [2022-07-12 07:39:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 07:39:52,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:39:52,596 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-12 07:39:52,623 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-12 07:39:52,811 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-12 07:39:52,812 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:39:52,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:39:52,812 INFO L85 PathProgramCache]: Analyzing trace with hash 386454391, now seen corresponding path program 2 times [2022-07-12 07:39:52,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:39:52,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773951284] [2022-07-12 07:39:52,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:39:52,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:39:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:53,029 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-12 07:39:53,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:39:53,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773951284] [2022-07-12 07:39:53,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773951284] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:39:53,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683202914] [2022-07-12 07:39:53,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 07:39:53,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:39:53,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:39:53,034 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-12 07:39:53,055 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-12 07:39:53,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 07:39:53,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 07:39:53,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 07:39:53,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:39:53,540 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-12 07:39:53,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:39:53,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683202914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:39:53,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 07:39:53,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-12 07:39:53,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460822405] [2022-07-12 07:39:53,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:39:53,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 07:39:53,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:39:53,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 07:39:53,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 07:39:53,543 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-12 07:39:53,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:39:53,579 INFO L93 Difference]: Finished difference Result 318 states and 470 transitions. [2022-07-12 07:39:53,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 07:39:53,579 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-12 07:39:53,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:39:53,601 INFO L225 Difference]: With dead ends: 318 [2022-07-12 07:39:53,601 INFO L226 Difference]: Without dead ends: 292 [2022-07-12 07:39:53,601 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-12 07:39:53,602 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-12 07:39:53,602 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-12 07:39:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-07-12 07:39:53,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2022-07-12 07:39:53,618 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-12 07:39:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 441 transitions. [2022-07-12 07:39:53,620 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 441 transitions. Word has length 46 [2022-07-12 07:39:53,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:39:53,621 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 441 transitions. [2022-07-12 07:39:53,621 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-12 07:39:53,621 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 441 transitions. [2022-07-12 07:39:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 07:39:53,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:39:53,624 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-12 07:39:53,645 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-12 07:39:53,845 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-12 07:39:53,845 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:39:53,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:39:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash -413357882, now seen corresponding path program 1 times [2022-07-12 07:39:53,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:39:53,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18328997] [2022-07-12 07:39:53,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:39:53,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:39:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:54,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 07:39:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:54,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:39:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:54,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 07:39:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:54,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 07:39:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:54,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 07:39:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:54,125 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-12 07:39:54,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:39:54,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18328997] [2022-07-12 07:39:54,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18328997] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:39:54,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238294647] [2022-07-12 07:39:54,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:39:54,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:39:54,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:39:54,131 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-12 07:39:54,135 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-12 07:39:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:54,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 07:39:54,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:39:54,624 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-12 07:39:54,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:39:54,678 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-12 07:39:54,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238294647] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 07:39:54,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 07:39:54,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 8 [2022-07-12 07:39:54,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178215429] [2022-07-12 07:39:54,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 07:39:54,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 07:39:54,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:39:54,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 07:39:54,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 07:39:54,681 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-12 07:39:56,728 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-12 07:39:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:39:57,345 INFO L93 Difference]: Finished difference Result 589 states and 899 transitions. [2022-07-12 07:39:57,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 07:39:57,346 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-12 07:39:57,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:39:57,350 INFO L225 Difference]: With dead ends: 589 [2022-07-12 07:39:57,352 INFO L226 Difference]: Without dead ends: 313 [2022-07-12 07:39:57,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 07:39:57,355 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 79 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 114 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-12 07:39:57,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 762 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 304 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-07-12 07:39:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-12 07:39:57,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 307. [2022-07-12 07:39:57,375 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-12 07:39:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 462 transitions. [2022-07-12 07:39:57,378 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 462 transitions. Word has length 91 [2022-07-12 07:39:57,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:39:57,378 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 462 transitions. [2022-07-12 07:39:57,379 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-12 07:39:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 462 transitions. [2022-07-12 07:39:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 07:39:57,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:39:57,381 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-12 07:39:57,409 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-12 07:39:57,599 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-12 07:39:57,600 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:39:57,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:39:57,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1310826886, now seen corresponding path program 2 times [2022-07-12 07:39:57,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:39:57,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063687486] [2022-07-12 07:39:57,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:39:57,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:39:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:57,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 07:39:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:57,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:39:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:57,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 07:39:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:57,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 07:39:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:57,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 07:39:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:39:57,961 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-12 07:39:57,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:39:57,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063687486] [2022-07-12 07:39:57,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063687486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:39:57,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:39:57,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 07:39:57,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514013126] [2022-07-12 07:39:57,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:39:57,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 07:39:57,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:39:57,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 07:39:57,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 07:39:57,962 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-12 07:39:59,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:40:01,889 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-12 07:40:03,906 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-12 07:40:05,532 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:40:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:06,151 INFO L93 Difference]: Finished difference Result 634 states and 980 transitions. [2022-07-12 07:40:06,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 07:40:06,152 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-12 07:40:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:06,156 INFO L225 Difference]: With dead ends: 634 [2022-07-12 07:40:06,156 INFO L226 Difference]: Without dead ends: 608 [2022-07-12 07:40:06,157 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-12 07:40:06,157 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 331 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 205 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-12 07:40:06,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 762 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 489 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2022-07-12 07:40:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-12 07:40:06,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 567. [2022-07-12 07:40:06,195 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-12 07:40:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 895 transitions. [2022-07-12 07:40:06,200 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 895 transitions. Word has length 103 [2022-07-12 07:40:06,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:06,201 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 895 transitions. [2022-07-12 07:40:06,201 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-12 07:40:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 895 transitions. [2022-07-12 07:40:06,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 07:40:06,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:06,208 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-12 07:40:06,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 07:40:06,208 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:06,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:06,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2058851120, now seen corresponding path program 1 times [2022-07-12 07:40:06,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:06,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181890049] [2022-07-12 07:40:06,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:06,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:06,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 07:40:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:06,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:40:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:06,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 07:40:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:06,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 07:40:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:06,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 07:40:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:06,456 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-12 07:40:06,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:06,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181890049] [2022-07-12 07:40:06,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181890049] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:40:06,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:40:06,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 07:40:06,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217610651] [2022-07-12 07:40:06,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:40:06,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 07:40:06,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:06,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 07:40:06,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 07:40:06,461 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-12 07:40:08,472 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-12 07:40:09,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:09,198 INFO L93 Difference]: Finished difference Result 1105 states and 1722 transitions. [2022-07-12 07:40:09,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 07:40:09,198 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-12 07:40:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:09,203 INFO L225 Difference]: With dead ends: 1105 [2022-07-12 07:40:09,204 INFO L226 Difference]: Without dead ends: 608 [2022-07-12 07:40:09,206 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-12 07:40:09,209 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.6s IncrementalHoareTripleChecker+Time [2022-07-12 07:40:09,209 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.6s Time] [2022-07-12 07:40:09,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-12 07:40:09,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 570. [2022-07-12 07:40:09,238 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-12 07:40:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 894 transitions. [2022-07-12 07:40:09,243 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 894 transitions. Word has length 103 [2022-07-12 07:40:09,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:09,244 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 894 transitions. [2022-07-12 07:40:09,244 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-12 07:40:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 894 transitions. [2022-07-12 07:40:09,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 07:40:09,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:09,247 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-12 07:40:09,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 07:40:09,247 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:09,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:09,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1861347046, now seen corresponding path program 1 times [2022-07-12 07:40:09,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:09,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532690782] [2022-07-12 07:40:09,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:09,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:09,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 07:40:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:09,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:40:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:09,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 07:40:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:09,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 07:40:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:09,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 07:40:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:09,510 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-12 07:40:09,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:09,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532690782] [2022-07-12 07:40:09,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532690782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:40:09,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:40:09,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 07:40:09,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425203239] [2022-07-12 07:40:09,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:40:09,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 07:40:09,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:09,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 07:40:09,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 07:40:09,515 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-12 07:40:11,532 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-12 07:40:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:12,235 INFO L93 Difference]: Finished difference Result 1128 states and 1755 transitions. [2022-07-12 07:40:12,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 07:40:12,235 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-12 07:40:12,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:12,240 INFO L225 Difference]: With dead ends: 1128 [2022-07-12 07:40:12,240 INFO L226 Difference]: Without dead ends: 565 [2022-07-12 07:40:12,243 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-12 07:40:12,243 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 302 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 149 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-12 07:40:12,243 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.6s Time] [2022-07-12 07:40:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-07-12 07:40:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 527. [2022-07-12 07:40:12,261 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-12 07:40:12,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 803 transitions. [2022-07-12 07:40:12,263 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 803 transitions. Word has length 103 [2022-07-12 07:40:12,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:12,264 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 803 transitions. [2022-07-12 07:40:12,264 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-12 07:40:12,264 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 803 transitions. [2022-07-12 07:40:12,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 07:40:12,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:12,266 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-12 07:40:12,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 07:40:12,267 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:12,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:12,274 INFO L85 PathProgramCache]: Analyzing trace with hash 544197250, now seen corresponding path program 1 times [2022-07-12 07:40:12,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:12,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570197084] [2022-07-12 07:40:12,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:12,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:12,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 07:40:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:12,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:40:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 07:40:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:12,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 07:40:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:12,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 07:40:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:12,468 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-12 07:40:12,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:12,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570197084] [2022-07-12 07:40:12,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570197084] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:40:12,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:40:12,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 07:40:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76179063] [2022-07-12 07:40:12,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:40:12,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 07:40:12,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:12,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 07:40:12,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 07:40:12,470 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-12 07:40:14,486 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-12 07:40:16,499 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-12 07:40:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:18,006 INFO L93 Difference]: Finished difference Result 897 states and 1333 transitions. [2022-07-12 07:40:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 07:40:18,007 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-12 07:40:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:18,010 INFO L225 Difference]: With dead ends: 897 [2022-07-12 07:40:18,010 INFO L226 Difference]: Without dead ends: 533 [2022-07-12 07:40:18,011 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-12 07:40:18,012 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 284 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 113 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s 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, 5.4s IncrementalHoareTripleChecker+Time [2022-07-12 07:40:18,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 936 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 616 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2022-07-12 07:40:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-07-12 07:40:18,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 489. [2022-07-12 07:40:18,026 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-12 07:40:18,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 734 transitions. [2022-07-12 07:40:18,029 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 734 transitions. Word has length 103 [2022-07-12 07:40:18,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:18,029 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 734 transitions. [2022-07-12 07:40:18,029 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-12 07:40:18,029 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 734 transitions. [2022-07-12 07:40:18,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 07:40:18,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:18,031 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-12 07:40:18,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 07:40:18,032 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:18,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:18,032 INFO L85 PathProgramCache]: Analyzing trace with hash -689449485, now seen corresponding path program 1 times [2022-07-12 07:40:18,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:18,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897638629] [2022-07-12 07:40:18,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:18,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:19,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 07:40:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:19,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 07:40:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:19,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 07:40:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:19,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 07:40:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:19,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 07:40:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:19,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 07:40:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:19,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 07:40:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:19,811 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-12 07:40:19,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:19,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897638629] [2022-07-12 07:40:19,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897638629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:40:19,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:40:19,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 07:40:19,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091144937] [2022-07-12 07:40:19,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:40:19,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 07:40:19,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:19,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 07:40:19,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 07:40:19,813 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-12 07:40:21,880 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-12 07:40:22,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:22,285 INFO L93 Difference]: Finished difference Result 740 states and 1085 transitions. [2022-07-12 07:40:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 07:40:22,285 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-12 07:40:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:22,288 INFO L225 Difference]: With dead ends: 740 [2022-07-12 07:40:22,288 INFO L226 Difference]: Without dead ends: 507 [2022-07-12 07:40:22,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-12 07:40:22,289 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 106 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 162 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-12 07:40:22,289 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.4s Time] [2022-07-12 07:40:22,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-07-12 07:40:22,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 493. [2022-07-12 07:40:22,305 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-12 07:40:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 739 transitions. [2022-07-12 07:40:22,308 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 739 transitions. Word has length 117 [2022-07-12 07:40:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:22,308 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 739 transitions. [2022-07-12 07:40:22,308 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-12 07:40:22,309 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 739 transitions. [2022-07-12 07:40:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 07:40:22,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:22,311 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-12 07:40:22,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 07:40:22,311 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:22,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:22,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1402171026, now seen corresponding path program 1 times [2022-07-12 07:40:22,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:22,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845358038] [2022-07-12 07:40:22,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:22,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:24,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 07:40:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:24,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 07:40:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:24,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 07:40:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:24,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 07:40:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:24,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 07:40:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:24,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 07:40:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:24,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 07:40:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:24,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 07:40:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:24,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 07:40:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:24,141 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-12 07:40:24,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:24,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845358038] [2022-07-12 07:40:24,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845358038] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:40:24,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:40:24,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 07:40:24,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49668372] [2022-07-12 07:40:24,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:40:24,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 07:40:24,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:24,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 07:40:24,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 07:40:24,143 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-12 07:40:26,218 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-12 07:40:26,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:26,693 INFO L93 Difference]: Finished difference Result 769 states and 1126 transitions. [2022-07-12 07:40:26,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 07:40:26,694 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-12 07:40:26,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:26,696 INFO L225 Difference]: With dead ends: 769 [2022-07-12 07:40:26,696 INFO L226 Difference]: Without dead ends: 504 [2022-07-12 07:40:26,697 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-12 07:40:26,698 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 40 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 07:40:26,698 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.5s Time] [2022-07-12 07:40:26,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-07-12 07:40:26,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 491. [2022-07-12 07:40:26,711 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-12 07:40:26,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 736 transitions. [2022-07-12 07:40:26,714 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 736 transitions. Word has length 137 [2022-07-12 07:40:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:26,714 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 736 transitions. [2022-07-12 07:40:26,714 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-12 07:40:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 736 transitions. [2022-07-12 07:40:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-12 07:40:26,716 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:26,716 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-12 07:40:26,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 07:40:26,716 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:26,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:26,717 INFO L85 PathProgramCache]: Analyzing trace with hash 359767575, now seen corresponding path program 1 times [2022-07-12 07:40:26,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:26,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466324410] [2022-07-12 07:40:26,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:26,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:26,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 07:40:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:26,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 07:40:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:26,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 07:40:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:26,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 07:40:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:26,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 07:40:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:26,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 07:40:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:26,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 07:40:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:27,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 07:40:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:27,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 07:40:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:27,008 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-12 07:40:27,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:27,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466324410] [2022-07-12 07:40:27,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466324410] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:40:27,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758112567] [2022-07-12 07:40:27,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:27,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:40:27,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:40:27,010 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-12 07:40:27,011 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-12 07:40:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:27,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 1480 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 07:40:27,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:40:27,718 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-12 07:40:27,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:40:27,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758112567] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:40:27,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 07:40:27,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2022-07-12 07:40:27,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719315189] [2022-07-12 07:40:27,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:40:27,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 07:40:27,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:27,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 07:40:27,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-07-12 07:40:27,721 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-12 07:40:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:28,111 INFO L93 Difference]: Finished difference Result 1207 states and 1913 transitions. [2022-07-12 07:40:28,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 07:40:28,111 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-12 07:40:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:28,115 INFO L225 Difference]: With dead ends: 1207 [2022-07-12 07:40:28,115 INFO L226 Difference]: Without dead ends: 746 [2022-07-12 07:40:28,118 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-12 07:40:28,118 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 07:40:28,118 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.3s Time] [2022-07-12 07:40:28,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-07-12 07:40:28,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 694. [2022-07-12 07:40:28,140 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-12 07:40:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1051 transitions. [2022-07-12 07:40:28,143 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1051 transitions. Word has length 135 [2022-07-12 07:40:28,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:28,143 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 1051 transitions. [2022-07-12 07:40:28,143 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-12 07:40:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1051 transitions. [2022-07-12 07:40:28,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 07:40:28,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:28,145 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-12 07:40:28,184 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-12 07:40:28,366 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-12 07:40:28,367 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:28,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash -462837888, now seen corresponding path program 1 times [2022-07-12 07:40:28,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:28,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874885923] [2022-07-12 07:40:28,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:28,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:29,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 07:40:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:29,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 07:40:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:29,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 07:40:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:29,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 07:40:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:29,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 07:40:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:29,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 07:40:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:29,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 07:40:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:29,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 07:40:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:29,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 07:40:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:29,803 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-12 07:40:29,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:29,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874885923] [2022-07-12 07:40:29,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874885923] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:40:29,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343686411] [2022-07-12 07:40:29,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:29,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:40:29,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:40:29,828 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-12 07:40:29,855 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-12 07:40:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:30,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 99 conjunts are in the unsatisfiable core [2022-07-12 07:40:30,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:40:30,562 INFO L356 Elim1Store]: treesize reduction 80, result has 29.2 percent of original size [2022-07-12 07:40:30,563 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-12 07:40:30,747 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-12 07:40:30,874 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-12 07:40:30,987 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-12 07:40:31,092 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-12 07:40:31,247 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-12 07:40:31,384 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-12 07:40:31,479 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-12 07:40:31,585 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-12 07:40:31,694 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-12 07:40:31,703 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-12 07:40:31,806 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-12 07:40:31,810 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-12 07:40:31,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:31,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:31,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:31,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:31,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:31,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:31,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:31,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:31,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:31,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:32,029 INFO L356 Elim1Store]: treesize reduction 114, result has 31.3 percent of original size [2022-07-12 07:40:32,030 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-12 07:40:32,057 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-12 07:40:32,057 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-12 07:40:32,271 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-12 07:40:32,403 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-12 07:40:32,420 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-12 07:40:32,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:40:32,664 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-12 07:40:32,710 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-12 07:40:32,769 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-12 07:40:32,803 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-12 07:40:32,839 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-12 07:40:32,878 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-12 07:40:32,934 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-12 07:40:33,011 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-12 07:40:33,065 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-12 07:40:33,115 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-12 07:40:33,183 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-12 07:40:33,348 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-12 07:40:33,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343686411] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 07:40:33,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 07:40:33,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 17] total 34 [2022-07-12 07:40:33,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900930065] [2022-07-12 07:40:33,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 07:40:33,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-12 07:40:33,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:33,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-12 07:40:33,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=423, Unknown=12, NotChecked=572, Total=1122 [2022-07-12 07:40:33,350 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-12 07:40:35,647 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-12 07:40:37,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:37,297 INFO L93 Difference]: Finished difference Result 1554 states and 2277 transitions. [2022-07-12 07:40:37,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 07:40:37,298 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-12 07:40:37,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:37,305 INFO L225 Difference]: With dead ends: 1554 [2022-07-12 07:40:37,305 INFO L226 Difference]: Without dead ends: 1045 [2022-07-12 07:40:37,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 282 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=334, Invalid=1338, Unknown=12, NotChecked=968, Total=2652 [2022-07-12 07:40:37,309 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 591 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 408 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 07:40:37,309 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.2s Time] [2022-07-12 07:40:37,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2022-07-12 07:40:37,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 976. [2022-07-12 07:40:37,351 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-12 07:40:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1470 transitions. [2022-07-12 07:40:37,355 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1470 transitions. Word has length 136 [2022-07-12 07:40:37,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:37,355 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1470 transitions. [2022-07-12 07:40:37,355 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-12 07:40:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1470 transitions. [2022-07-12 07:40:37,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 07:40:37,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:37,358 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-12 07:40:37,380 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-12 07:40:37,577 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-12 07:40:37,578 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:37,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:37,578 INFO L85 PathProgramCache]: Analyzing trace with hash -442404352, now seen corresponding path program 1 times [2022-07-12 07:40:37,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:37,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822153737] [2022-07-12 07:40:37,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:37,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:39,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 07:40:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:39,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 07:40:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:39,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 07:40:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:39,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 07:40:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 07:40:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:39,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 07:40:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:39,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 07:40:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:39,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 07:40:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:39,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 07:40:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:39,286 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-12 07:40:39,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:39,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822153737] [2022-07-12 07:40:39,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822153737] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:40:39,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800779195] [2022-07-12 07:40:39,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:39,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:40:39,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:40:39,288 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-12 07:40:39,319 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-12 07:40:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:39,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-12 07:40:39,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:40:40,028 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-07-12 07:40:40,029 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-12 07:40:40,190 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-12 07:40:40,261 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-12 07:40:40,339 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-12 07:40:40,428 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-12 07:40:40,544 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-12 07:40:40,652 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-12 07:40:40,734 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-12 07:40:40,795 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-12 07:40:40,858 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-12 07:40:40,991 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-12 07:40:40,996 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-12 07:40:41,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:41,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:41,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:41,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:41,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:41,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:41,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:41,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:41,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:41,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:41,203 INFO L356 Elim1Store]: treesize reduction 130, result has 29.7 percent of original size [2022-07-12 07:40:41,203 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-12 07:40:41,223 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-12 07:40:41,223 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-12 07:40:41,391 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-12 07:40:41,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:41,478 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-12 07:40:41,505 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-12 07:40:41,518 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-12 07:40:41,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:40:41,627 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-12 07:40:41,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800779195] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:40:41,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 07:40:41,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2022-07-12 07:40:41,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708919664] [2022-07-12 07:40:41,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 07:40:41,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 07:40:41,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:41,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 07:40:41,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=380, Unknown=1, NotChecked=40, Total=506 [2022-07-12 07:40:41,642 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-12 07:40:44,677 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-12 07:40:46,697 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-12 07:40:48,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:48,325 INFO L93 Difference]: Finished difference Result 1291 states and 1869 transitions. [2022-07-12 07:40:48,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 07:40:48,325 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-12 07:40:48,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:48,332 INFO L225 Difference]: With dead ends: 1291 [2022-07-12 07:40:48,332 INFO L226 Difference]: Without dead ends: 1148 [2022-07-12 07:40:48,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=251, Invalid=942, Unknown=1, NotChecked=66, Total=1260 [2022-07-12 07:40:48,334 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 522 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 337 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-12 07:40:48,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1200 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 1580 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-07-12 07:40:48,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2022-07-12 07:40:48,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1035. [2022-07-12 07:40:48,374 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-12 07:40:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1545 transitions. [2022-07-12 07:40:48,377 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1545 transitions. Word has length 136 [2022-07-12 07:40:48,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:48,377 INFO L495 AbstractCegarLoop]: Abstraction has 1035 states and 1545 transitions. [2022-07-12 07:40:48,377 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-12 07:40:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1545 transitions. [2022-07-12 07:40:48,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 07:40:48,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:48,381 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-12 07:40:48,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 07:40:48,601 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-12 07:40:48,601 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:48,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:48,602 INFO L85 PathProgramCache]: Analyzing trace with hash 762367328, now seen corresponding path program 1 times [2022-07-12 07:40:48,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:48,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992472540] [2022-07-12 07:40:48,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:48,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 07:40:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 07:40:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 07:40:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 07:40:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 07:40:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 07:40:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 07:40:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 07:40:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 07:40:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,714 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-12 07:40:49,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:49,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992472540] [2022-07-12 07:40:49,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992472540] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:40:49,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125842039] [2022-07-12 07:40:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:49,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:40:49,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:40:49,736 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-12 07:40:49,737 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-12 07:40:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:50,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 81 conjunts are in the unsatisfiable core [2022-07-12 07:40:50,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:40:50,436 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-07-12 07:40:50,437 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-12 07:40:50,571 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-12 07:40:50,643 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-12 07:40:50,690 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-12 07:40:50,761 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-12 07:40:50,852 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-12 07:40:50,942 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-12 07:40:51,064 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-12 07:40:51,195 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-12 07:40:51,263 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-12 07:40:51,336 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-12 07:40:51,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:51,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:51,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:51,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:51,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:51,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:51,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:51,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:51,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:51,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:51,503 INFO L356 Elim1Store]: treesize reduction 130, result has 29.7 percent of original size [2022-07-12 07:40:51,503 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-12 07:40:51,521 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-12 07:40:51,521 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-12 07:40:51,681 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-12 07:40:51,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:40:51,766 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-12 07:40:51,791 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-12 07:40:51,805 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-12 07:40:51,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:40:51,928 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-12 07:40:51,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125842039] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:40:51,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 07:40:51,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2022-07-12 07:40:51,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87841610] [2022-07-12 07:40:51,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 07:40:51,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 07:40:51,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:51,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 07:40:51,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=380, Unknown=1, NotChecked=40, Total=506 [2022-07-12 07:40:51,945 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-12 07:40:53,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:40:56,406 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-12 07:40:58,424 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-12 07:41:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:41:00,512 INFO L93 Difference]: Finished difference Result 1622 states and 2291 transitions. [2022-07-12 07:41:00,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 07:41:00,513 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-12 07:41:00,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:41:00,516 INFO L225 Difference]: With dead ends: 1622 [2022-07-12 07:41:00,517 INFO L226 Difference]: Without dead ends: 1038 [2022-07-12 07:41:00,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=251, Invalid=942, Unknown=1, NotChecked=66, Total=1260 [2022-07-12 07:41:00,518 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 440 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 286 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:41:00,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1214 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1687 Invalid, 2 Unknown, 0 Unchecked, 8.0s Time] [2022-07-12 07:41:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2022-07-12 07:41:00,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 994. [2022-07-12 07:41:00,558 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-12 07:41:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1485 transitions. [2022-07-12 07:41:00,561 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1485 transitions. Word has length 136 [2022-07-12 07:41:00,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:41:00,561 INFO L495 AbstractCegarLoop]: Abstraction has 994 states and 1485 transitions. [2022-07-12 07:41:00,561 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-12 07:41:00,562 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1485 transitions. [2022-07-12 07:41:00,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 07:41:00,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:41:00,564 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-12 07:41:00,586 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-12 07:41:00,779 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-12 07:41:00,780 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:41:00,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:41:00,780 INFO L85 PathProgramCache]: Analyzing trace with hash 924945984, now seen corresponding path program 1 times [2022-07-12 07:41:00,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:41:00,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758984786] [2022-07-12 07:41:00,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:00,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:41:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:01,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 07:41:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 07:41:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 07:41:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 07:41:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 07:41:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 07:41:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 07:41:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 07:41:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 07:41:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,052 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-12 07:41:02,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:41:02,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758984786] [2022-07-12 07:41:02,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758984786] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:41:02,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707594784] [2022-07-12 07:41:02,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:02,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:02,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:41:02,054 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-12 07:41:02,112 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-12 07:41:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:02,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-12 07:41:02,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:41:02,882 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-07-12 07:41:02,882 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-12 07:41:02,973 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-12 07:41:03,045 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-12 07:41:03,119 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-12 07:41:03,162 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-12 07:41:03,286 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-12 07:41:03,400 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-12 07:41:03,470 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-12 07:41:03,555 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-12 07:41:03,601 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-12 07:41:03,694 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-12 07:41:03,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:03,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:03,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:03,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:03,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:03,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:03,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:03,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:03,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:03,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:25,049 WARN L233 SmtUtils]: Spent 21.23s on a formula simplification. DAG size of input: 457 DAG size of output: 167 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-12 07:41:25,050 INFO L356 Elim1Store]: treesize reduction 2076, result has 21.5 percent of original size [2022-07-12 07:41:25,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 9 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 1568 treesize of output 3728 [2022-07-12 07:41:26,284 INFO L356 Elim1Store]: treesize reduction 95, result has 6.9 percent of original size [2022-07-12 07:41:26,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 143 [2022-07-12 07:41:27,147 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-12 07:41:27,147 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 80 treesize of output 76 [2022-07-12 07:41:32,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 36 treesize of output 20 [2022-07-12 07:41:32,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 36 treesize of output 20 [2022-07-12 07:41:33,755 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 0 case distinctions, treesize of input 24 treesize of output 7 [2022-07-12 07:41:33,895 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 0 case distinctions, treesize of input 24 treesize of output 7 [2022-07-12 07:41:34,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 106 [2022-07-12 07:41:35,612 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-12 07:41:35,951 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-12 07:41:41,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:41,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:41,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:42,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:42,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:42,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:42,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:43,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:43,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:43,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:43,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:43,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:50,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:50,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:50,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:50,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:50,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:50,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:50,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:06,266 INFO L244 Elim1Store]: Index analysis took 24582 ms [2022-07-12 07:42:14,916 WARN L233 SmtUtils]: Spent 8.63s on a formula simplification. DAG size of input: 239 DAG size of output: 39 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-12 07:42:14,916 INFO L356 Elim1Store]: treesize reduction 1072, result has 5.0 percent of original size [2022-07-12 07:42:14,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 8 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 73 case distinctions, treesize of input 746 treesize of output 4196 [2022-07-12 07:42:26,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:26,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:26,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:26,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:26,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:26,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:26,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:26,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:27,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:27,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:27,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:27,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:31,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:31,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:31,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:31,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:31,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:31,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:31,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:40,000 INFO L244 Elim1Store]: Index analysis took 13692 ms [2022-07-12 07:42:46,870 WARN L233 SmtUtils]: Spent 6.86s on a formula simplification. DAG size of input: 199 DAG size of output: 29 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-12 07:42:46,870 INFO L356 Elim1Store]: treesize reduction 784, result has 5.0 percent of original size [2022-07-12 07:42:46,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 8 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 71 case distinctions, treesize of input 743 treesize of output 4177 [2022-07-12 07:43:06,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:43:06,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:43:06,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:43:06,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:43:06,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:43:06,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:07,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:07,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:07,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:07,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:07,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:07,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:12,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:13,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:13,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:13,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:13,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:13,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:13,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:29,729 INFO L244 Elim1Store]: Index analysis took 23629 ms [2022-07-12 07:43:35,966 WARN L233 SmtUtils]: Spent 6.23s on a formula simplification. DAG size of input: 239 DAG size of output: 39 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-12 07:43:35,966 INFO L356 Elim1Store]: treesize reduction 1072, result has 5.0 percent of original size [2022-07-12 07:43:35,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 8 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 73 case distinctions, treesize of input 746 treesize of output 4196 [2022-07-12 07:43:52,658 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 07:43:52,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-07-12 07:43:52,818 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 07:43:52,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-07-12 07:43:54,393 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 07:43:54,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 3 [2022-07-12 07:43:54,754 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 07:43:54,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 3 [2022-07-12 07:43:54,782 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:43:56,563 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:43:56,673 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:44:00,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:44:00,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 149 [2022-07-12 07:44:05,147 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 07:44:05,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 149 [2022-07-12 07:44:07,482 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 07:44:07,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 149 [2022-07-12 07:44:10,418 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 07:44:10,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-07-12 07:44:10,620 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 07:44:10,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-07-12 07:44:12,870 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 07:44:12,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 3 [2022-07-12 07:44:13,297 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 07:44:13,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 3 [2022-07-12 07:44:13,343 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:44:15,350 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:44:15,527 WARN L234 Elim1Store]: Array PQE input equivalent to false