./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_sync.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_sync.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 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 07:40:41,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 07:40:41,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 07:40:41,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 07:40:41,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 07:40:41,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 07:40:41,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 07:40:41,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 07:40:41,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 07:40:41,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 07:40:41,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 07:40:41,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 07:40:41,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 07:40:41,629 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 07:40:41,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 07:40:41,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 07:40:41,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 07:40:41,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 07:40:41,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 07:40:41,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 07:40:41,634 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 07:40:41,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 07:40:41,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 07:40:41,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 07:40:41,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 07:40:41,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 07:40:41,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 07:40:41,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 07:40:41,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 07:40:41,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 07:40:41,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 07:40:41,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 07:40:41,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 07:40:41,642 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 07:40:41,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 07:40:41,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 07:40:41,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 07:40:41,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 07:40:41,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 07:40:41,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 07:40:41,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 07:40:41,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 07:40:41,647 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:40:41,660 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 07:40:41,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 07:40:41,663 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 07:40:41,663 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 07:40:41,664 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 07:40:41,664 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 07:40:41,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 07:40:41,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 07:40:41,665 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 07:40:41,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 07:40:41,666 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 07:40:41,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 07:40:41,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 07:40:41,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 07:40:41,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 07:40:41,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 07:40:41,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 07:40:41,667 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 07:40:41,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 07:40:41,668 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 07:40:41,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 07:40:41,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 07:40:41,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 07:40:41,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 07:40:41,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 07:40:41,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 07:40:41,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 07:40:41,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 07:40:41,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 07:40:41,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 07:40:41,670 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 07:40:41,670 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 07:40:41,670 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 07:40:41,670 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 -> 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef [2022-07-12 07:40:41,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 07:40:41,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 07:40:41,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 07:40:41,870 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 07:40:41,870 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 07:40:41,871 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_sync.i [2022-07-12 07:40:41,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2051a637d/bcd7e1813168457897eb7b326b7fb1a4/FLAGfe08712ae [2022-07-12 07:40:42,369 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 07:40:42,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i [2022-07-12 07:40:42,384 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2051a637d/bcd7e1813168457897eb7b326b7fb1a4/FLAGfe08712ae [2022-07-12 07:40:42,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2051a637d/bcd7e1813168457897eb7b326b7fb1a4 [2022-07-12 07:40:42,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 07:40:42,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 07:40:42,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 07:40:42,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 07:40:42,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 07:40:42,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:40:42" (1/1) ... [2022-07-12 07:40:42,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5acf27e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:42, skipping insertion in model container [2022-07-12 07:40:42,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:40:42" (1/1) ... [2022-07-12 07:40:42,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 07:40:42,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 07:40:43,099 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_sync.i[34698,34711] [2022-07-12 07:40:43,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 07:40:43,199 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 07:40:43,224 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_sync.i[34698,34711] [2022-07-12 07:40:43,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 07:40:43,306 INFO L208 MainTranslator]: Completed translation [2022-07-12 07:40:43,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:43 WrapperNode [2022-07-12 07:40:43,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 07:40:43,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 07:40:43,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 07:40:43,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 07:40:43,313 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:40:43" (1/1) ... [2022-07-12 07:40:43,341 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:40:43" (1/1) ... [2022-07-12 07:40:43,385 INFO L137 Inliner]: procedures = 245, calls = 244, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 544 [2022-07-12 07:40:43,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 07:40:43,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 07:40:43,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 07:40:43,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 07:40:43,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:43" (1/1) ... [2022-07-12 07:40:43,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:43" (1/1) ... [2022-07-12 07:40:43,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:43" (1/1) ... [2022-07-12 07:40:43,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:43" (1/1) ... [2022-07-12 07:40:43,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:43" (1/1) ... [2022-07-12 07:40:43,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:43" (1/1) ... [2022-07-12 07:40:43,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:43" (1/1) ... [2022-07-12 07:40:43,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 07:40:43,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 07:40:43,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 07:40:43,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 07:40:43,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:43" (1/1) ... [2022-07-12 07:40:43,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 07:40:43,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:40:43,481 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:40:43,503 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:40:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 07:40:43,508 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 07:40:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 07:40:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_signal [2022-07-12 07:40:43,508 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_signal [2022-07-12 07:40:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-12 07:40:43,508 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-12 07:40:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 07:40:43,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 07:40:43,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 07:40:43,509 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-12 07:40:43,509 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-12 07:40:43,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 07:40:43,509 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_init [2022-07-12 07:40:43,509 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_init [2022-07-12 07:40:43,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 07:40:43,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 07:40:43,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 07:40:43,510 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-12 07:40:43,510 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-12 07:40:43,510 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_wait [2022-07-12 07:40:43,510 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_wait [2022-07-12 07:40:43,510 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-12 07:40:43,510 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-12 07:40:43,511 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-12 07:40:43,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-12 07:40:43,511 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-12 07:40:43,511 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-12 07:40:43,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 07:40:43,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 07:40:43,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 07:40:43,681 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 07:40:43,683 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 07:40:43,926 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !(0 != ~__CS_ret~0 % 256); [2022-07-12 07:40:43,927 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-12 07:40:43,927 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !(0 != ~__CS_ret~0 % 256); [2022-07-12 07:40:43,927 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-12 07:40:43,927 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: SUMMARY for call __CS_cs(); srcloc: null [2022-07-12 07:40:43,927 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-12 07:40:43,927 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume !(0 != ~__CS_ret~0 % 256); [2022-07-12 07:40:46,196 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 07:40:46,205 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 07:40:46,206 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-12 07:40:46,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:40:46 BoogieIcfgContainer [2022-07-12 07:40:46,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 07:40:46,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 07:40:46,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 07:40:46,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 07:40:46,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:40:42" (1/3) ... [2022-07-12 07:40:46,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181c6224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:40:46, skipping insertion in model container [2022-07-12 07:40:46,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:43" (2/3) ... [2022-07-12 07:40:46,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181c6224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:40:46, skipping insertion in model container [2022-07-12 07:40:46,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:40:46" (3/3) ... [2022-07-12 07:40:46,215 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_sync.i [2022-07-12 07:40:46,224 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 07:40:46,225 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 07:40:46,277 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 07:40:46,286 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@39d8e3e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@624de1eb [2022-07-12 07:40:46,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 07:40:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 128 states have internal predecessors, (185), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-12 07:40:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 07:40:46,302 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:46,302 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,303 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:46,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:46,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1902090431, now seen corresponding path program 1 times [2022-07-12 07:40:46,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:46,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242046671] [2022-07-12 07:40:46,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:46,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:46,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 07:40:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:46,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 07:40:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:46,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 07:40:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:46,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 07:40:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:46,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 07:40:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:46,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 07:40:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:46,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 07:40:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:46,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 07:40:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:46,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 07:40:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:46,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 07:40:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-12 07:40:46,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:46,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242046671] [2022-07-12 07:40:46,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242046671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:40:46,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:40:46,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 07:40:46,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588442155] [2022-07-12 07:40:46,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:40:46,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:40:46,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:46,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:40:46,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:40:46,825 INFO L87 Difference]: Start difference. First operand has 194 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 128 states have internal predecessors, (185), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 07:40:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:46,901 INFO L93 Difference]: Finished difference Result 390 states and 641 transitions. [2022-07-12 07:40:46,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:40:46,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-07-12 07:40:46,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:46,910 INFO L225 Difference]: With dead ends: 390 [2022-07-12 07:40:46,910 INFO L226 Difference]: Without dead ends: 194 [2022-07-12 07:40:46,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:40:46,918 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 4 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:40:46,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 568 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:40:46,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-12 07:40:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2022-07-12 07:40:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 125 states have (on average 1.4) internal successors, (175), 125 states have internal predecessors, (175), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-12 07:40:46,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 285 transitions. [2022-07-12 07:40:46,961 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 285 transitions. Word has length 72 [2022-07-12 07:40:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:46,962 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 285 transitions. [2022-07-12 07:40:46,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 07:40:46,962 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 285 transitions. [2022-07-12 07:40:46,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-12 07:40:46,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:46,966 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 07:40:46,966 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:46,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:46,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1569921272, now seen corresponding path program 1 times [2022-07-12 07:40:46,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:46,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25612573] [2022-07-12 07:40:46,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:46,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 07:40:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 07:40:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 07:40:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 07:40:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 07:40:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 07:40:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 07:40:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 07:40:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 07:40:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 07:40:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-12 07:40:47,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:47,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25612573] [2022-07-12 07:40:47,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25612573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:40:47,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:40:47,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 07:40:47,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248238288] [2022-07-12 07:40:47,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:40:47,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:40:47,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:47,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:40:47,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:40:47,127 INFO L87 Difference]: Start difference. First operand 191 states and 285 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 07:40:47,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:47,152 INFO L93 Difference]: Finished difference Result 381 states and 570 transitions. [2022-07-12 07:40:47,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:40:47,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2022-07-12 07:40:47,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:47,155 INFO L225 Difference]: With dead ends: 381 [2022-07-12 07:40:47,155 INFO L226 Difference]: Without dead ends: 193 [2022-07-12 07:40:47,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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:40:47,174 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 561 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:40:47,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 561 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:40:47,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-12 07:40:47,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2022-07-12 07:40:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 126 states have internal predecessors, (176), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-12 07:40:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 286 transitions. [2022-07-12 07:40:47,187 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 286 transitions. Word has length 75 [2022-07-12 07:40:47,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:47,187 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 286 transitions. [2022-07-12 07:40:47,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 07:40:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 286 transitions. [2022-07-12 07:40:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-12 07:40:47,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:47,196 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 07:40:47,196 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:47,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:47,197 INFO L85 PathProgramCache]: Analyzing trace with hash 217866074, now seen corresponding path program 1 times [2022-07-12 07:40:47,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:47,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278692192] [2022-07-12 07:40:47,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:47,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 07:40:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 07:40:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 07:40:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 07:40:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 07:40:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 07:40:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 07:40:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 07:40:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 07:40:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 07:40:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-12 07:40:47,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:47,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278692192] [2022-07-12 07:40:47,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278692192] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:40:47,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739159520] [2022-07-12 07:40:47,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:47,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:40:47,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:40:47,420 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:40:47,428 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:40:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:47,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 1763 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 07:40:47,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:40:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-12 07:40:47,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:40:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-12 07:40:48,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739159520] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 07:40:48,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 07:40:48,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-12 07:40:48,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495765554] [2022-07-12 07:40:48,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 07:40:48,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 07:40:48,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:48,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 07:40:48,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-12 07:40:48,028 INFO L87 Difference]: Start difference. First operand 192 states and 286 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-12 07:40:48,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:48,063 INFO L93 Difference]: Finished difference Result 385 states and 575 transitions. [2022-07-12 07:40:48,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 07:40:48,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 77 [2022-07-12 07:40:48,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:48,080 INFO L225 Difference]: With dead ends: 385 [2022-07-12 07:40:48,080 INFO L226 Difference]: Without dead ends: 196 [2022-07-12 07:40:48,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-12 07:40:48,094 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 3 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:40:48,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1119 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:40:48,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-12 07:40:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-07-12 07:40:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-12 07:40:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 290 transitions. [2022-07-12 07:40:48,106 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 290 transitions. Word has length 77 [2022-07-12 07:40:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:48,106 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 290 transitions. [2022-07-12 07:40:48,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-12 07:40:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 290 transitions. [2022-07-12 07:40:48,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-12 07:40:48,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:48,109 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2022-07-12 07:40:48,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 07:40:48,331 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:40:48,331 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:48,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:48,332 INFO L85 PathProgramCache]: Analyzing trace with hash 971561630, now seen corresponding path program 2 times [2022-07-12 07:40:48,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:48,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861458638] [2022-07-12 07:40:48,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:48,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:48,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 07:40:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:48,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 07:40:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:48,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 07:40:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:48,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 07:40:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:48,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 07:40:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:48,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 07:40:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:48,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 07:40:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:48,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 07:40:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:48,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 07:40:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:48,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 07:40:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-07-12 07:40:48,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:48,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861458638] [2022-07-12 07:40:48,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861458638] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:40:48,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504878297] [2022-07-12 07:40:48,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 07:40:48,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:40:48,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:40:48,570 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:40:48,605 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:40:49,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 07:40:49,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 07:40:49,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 07:40:49,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:40:49,330 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-12 07:40:49,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:40:49,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504878297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:40:49,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 07:40:49,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-12 07:40:49,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115443767] [2022-07-12 07:40:49,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:40:49,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 07:40:49,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:49,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 07:40:49,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 07:40:49,333 INFO L87 Difference]: Start difference. First operand 196 states and 290 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 07:40:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:49,361 INFO L93 Difference]: Finished difference Result 377 states and 570 transitions. [2022-07-12 07:40:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 07:40:49,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 81 [2022-07-12 07:40:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:49,365 INFO L225 Difference]: With dead ends: 377 [2022-07-12 07:40:49,365 INFO L226 Difference]: Without dead ends: 351 [2022-07-12 07:40:49,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 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:40:49,366 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 230 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:40:49,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1057 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:40:49,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-12 07:40:49,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 350. [2022-07-12 07:40:49,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 230 states have internal predecessors, (325), 99 states have call successors, (99), 20 states have call predecessors, (99), 20 states have return successors, (107), 99 states have call predecessors, (107), 99 states have call successors, (107) [2022-07-12 07:40:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 531 transitions. [2022-07-12 07:40:49,387 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 531 transitions. Word has length 81 [2022-07-12 07:40:49,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:49,388 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 531 transitions. [2022-07-12 07:40:49,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 07:40:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 531 transitions. [2022-07-12 07:40:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-12 07:40:49,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:49,391 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:40:49,414 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:40:49,607 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:40:49,608 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:49,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:49,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1383247446, now seen corresponding path program 1 times [2022-07-12 07:40:49,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:49,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397349114] [2022-07-12 07:40:49,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:49,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 07:40:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:40:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:40:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:40:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 07:40:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 07:40:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:40:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:40:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 07:40:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:40:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:40:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 07:40:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 07:40:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:40:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:40:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 07:40:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 07:40:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 07:40:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 07:40:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 07:40:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 07:40:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 07:40:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 07:40:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 07:40:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 07:40:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-07-12 07:40:49,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:49,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397349114] [2022-07-12 07:40:49,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397349114] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:40:49,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102542445] [2022-07-12 07:40:49,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:49,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:40:49,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:40:49,993 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:40:49,994 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:40:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:50,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 2184 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 07:40:50,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:40:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-07-12 07:40:50,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:40:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-07-12 07:40:50,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102542445] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 07:40:50,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 07:40:50,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2022-07-12 07:40:50,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573524694] [2022-07-12 07:40:50,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 07:40:50,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 07:40:50,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:50,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 07:40:50,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-12 07:40:50,829 INFO L87 Difference]: Start difference. First operand 350 states and 531 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-12 07:40:52,879 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:54,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:40:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:54,655 INFO L93 Difference]: Finished difference Result 719 states and 1092 transitions. [2022-07-12 07:40:54,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 07:40:54,655 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 183 [2022-07-12 07:40:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:54,658 INFO L225 Difference]: With dead ends: 719 [2022-07-12 07:40:54,658 INFO L226 Difference]: Without dead ends: 381 [2022-07-12 07:40:54,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 410 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-12 07:40:54,660 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 108 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 175 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 07:40:54,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 929 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 557 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 07:40:54,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-07-12 07:40:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 363. [2022-07-12 07:40:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 241 states have (on average 1.3983402489626555) internal successors, (337), 243 states have internal predecessors, (337), 99 states have call successors, (99), 20 states have call predecessors, (99), 22 states have return successors, (111), 99 states have call predecessors, (111), 99 states have call successors, (111) [2022-07-12 07:40:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 547 transitions. [2022-07-12 07:40:54,679 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 547 transitions. Word has length 183 [2022-07-12 07:40:54,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:54,679 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 547 transitions. [2022-07-12 07:40:54,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-12 07:40:54,680 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 547 transitions. [2022-07-12 07:40:54,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-12 07:40:54,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:54,683 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 6, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:40:54,715 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:40:54,913 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:40:54,913 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:54,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:54,914 INFO L85 PathProgramCache]: Analyzing trace with hash -945252521, now seen corresponding path program 2 times [2022-07-12 07:40:54,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:54,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730719711] [2022-07-12 07:40:54,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:54,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:41:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 07:41:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:41:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 07:41:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 07:41:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 07:41:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 07:41:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 07:41:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 07:41:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 07:41:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 07:41:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 07:41:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 07:41:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 07:41:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 07:41:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 07:41:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-12 07:41:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 07:41:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2022-07-12 07:41:09,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:41:09,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730719711] [2022-07-12 07:41:09,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730719711] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:41:09,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456591810] [2022-07-12 07:41:09,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 07:41:09,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:09,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:41:09,676 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:41:09,677 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:41:10,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 07:41:10,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 07:41:10,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 07:41:10,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:41:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-07-12 07:41:10,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:41:10,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456591810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:41:10,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 07:41:10,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-12 07:41:10,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413358995] [2022-07-12 07:41:10,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:41:10,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:41:10,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:41:10,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:41:10,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-12 07:41:10,552 INFO L87 Difference]: Start difference. First operand 363 states and 547 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 07:41:10,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:41:10,572 INFO L93 Difference]: Finished difference Result 695 states and 1053 transitions. [2022-07-12 07:41:10,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:41:10,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 192 [2022-07-12 07:41:10,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:41:10,575 INFO L225 Difference]: With dead ends: 695 [2022-07-12 07:41:10,575 INFO L226 Difference]: Without dead ends: 363 [2022-07-12 07:41:10,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-12 07:41:10,579 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:41:10,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 562 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:41:10,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-12 07:41:10,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2022-07-12 07:41:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 241 states have (on average 1.3941908713692945) internal successors, (336), 243 states have internal predecessors, (336), 99 states have call successors, (99), 20 states have call predecessors, (99), 22 states have return successors, (111), 99 states have call predecessors, (111), 99 states have call successors, (111) [2022-07-12 07:41:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 546 transitions. [2022-07-12 07:41:10,605 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 546 transitions. Word has length 192 [2022-07-12 07:41:10,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:41:10,607 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 546 transitions. [2022-07-12 07:41:10,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 07:41:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 546 transitions. [2022-07-12 07:41:10,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-12 07:41:10,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:41:10,611 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:41:10,653 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:41:10,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:10,830 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:41:10,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:41:10,831 INFO L85 PathProgramCache]: Analyzing trace with hash 342116215, now seen corresponding path program 1 times [2022-07-12 07:41:10,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:41:10,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548739919] [2022-07-12 07:41:10,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:10,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:41:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 07:41:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 07:41:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 07:41:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:41:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 07:41:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 07:41:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 07:41:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 07:41:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 07:41:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 07:41:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 07:41:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 07:41:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 07:41:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 07:41:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 07:41:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 07:41:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 07:41:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-12 07:41:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 07:41:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2022-07-12 07:41:11,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:41:11,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548739919] [2022-07-12 07:41:11,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548739919] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:41:11,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774034129] [2022-07-12 07:41:11,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:11,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:11,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:41:11,292 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:41:11,313 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:41:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:12,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 2532 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 07:41:12,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:41:12,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-07-12 07:41:12,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 07:41:12,326 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:12,329 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 400 proven. 5 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2022-07-12 07:41:12,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:41:12,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-12 07:41:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2022-07-12 07:41:12,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774034129] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 07:41:12,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 07:41:12,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2022-07-12 07:41:12,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788969244] [2022-07-12 07:41:12,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 07:41:12,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 07:41:12,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:41:12,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 07:41:12,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-12 07:41:12,537 INFO L87 Difference]: Start difference. First operand 363 states and 546 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 8 states have internal predecessors, (108), 8 states have call successors, (41), 8 states have call predecessors, (41), 6 states have return successors, (39), 8 states have call predecessors, (39), 8 states have call successors, (39) [2022-07-12 07:41:14,557 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:16,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:41:16,091 INFO L93 Difference]: Finished difference Result 845 states and 1305 transitions. [2022-07-12 07:41:16,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 07:41:16,092 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 8 states have internal predecessors, (108), 8 states have call successors, (41), 8 states have call predecessors, (41), 6 states have return successors, (39), 8 states have call predecessors, (39), 8 states have call successors, (39) Word has length 220 [2022-07-12 07:41:16,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:41:16,097 INFO L225 Difference]: With dead ends: 845 [2022-07-12 07:41:16,097 INFO L226 Difference]: Without dead ends: 815 [2022-07-12 07:41:16,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2022-07-12 07:41:16,098 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 673 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 663 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 2283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 07:41:16,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1126 Invalid, 2283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 1619 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-07-12 07:41:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2022-07-12 07:41:16,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 754. [2022-07-12 07:41:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 489 states have (on average 1.4110429447852761) internal successors, (690), 496 states have internal predecessors, (690), 215 states have call successors, (215), 40 states have call predecessors, (215), 49 states have return successors, (265), 217 states have call predecessors, (265), 215 states have call successors, (265) [2022-07-12 07:41:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1170 transitions. [2022-07-12 07:41:16,130 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1170 transitions. Word has length 220 [2022-07-12 07:41:16,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:41:16,132 INFO L495 AbstractCegarLoop]: Abstraction has 754 states and 1170 transitions. [2022-07-12 07:41:16,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 8 states have internal predecessors, (108), 8 states have call successors, (41), 8 states have call predecessors, (41), 6 states have return successors, (39), 8 states have call predecessors, (39), 8 states have call successors, (39) [2022-07-12 07:41:16,133 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1170 transitions. [2022-07-12 07:41:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-12 07:41:16,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:41:16,136 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 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, 1, 1, 1, 1] [2022-07-12 07:41:16,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 07:41:16,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:16,351 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:41:16,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:41:16,352 INFO L85 PathProgramCache]: Analyzing trace with hash -26567542, now seen corresponding path program 1 times [2022-07-12 07:41:16,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:41:16,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698264036] [2022-07-12 07:41:16,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:16,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:41:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:21,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 07:41:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:21,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:41:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:21,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:21,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:21,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 07:41:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:21,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:41:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:21,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:21,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:21,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 07:41:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:21,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 07:41:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:21,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:21,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:21,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 07:41:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:22,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:22,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:22,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 07:41:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:22,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 07:41:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:22,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:22,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:22,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 07:41:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:22,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 07:41:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:22,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 07:41:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:22,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 07:41:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:22,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 07:41:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:22,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 07:41:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:22,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 07:41:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:22,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 07:41:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:22,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 07:41:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:22,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 07:41:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2022-07-12 07:41:22,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:41:22,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698264036] [2022-07-12 07:41:22,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698264036] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:41:22,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670556075] [2022-07-12 07:41:22,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:22,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:22,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:41:22,042 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:41:22,043 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:41:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:23,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 2496 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 07:41:23,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:41:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2022-07-12 07:41:23,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:41:23,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670556075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:41:23,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 07:41:23,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 15 [2022-07-12 07:41:23,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330235866] [2022-07-12 07:41:23,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:41:23,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 07:41:23,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:41:23,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 07:41:23,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-12 07:41:23,293 INFO L87 Difference]: Start difference. First operand 754 states and 1170 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 07:41:23,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:41:23,849 INFO L93 Difference]: Finished difference Result 1731 states and 2851 transitions. [2022-07-12 07:41:23,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 07:41:23,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) Word has length 221 [2022-07-12 07:41:23,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:41:23,854 INFO L225 Difference]: With dead ends: 1731 [2022-07-12 07:41:23,855 INFO L226 Difference]: Without dead ends: 1001 [2022-07-12 07:41:23,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-12 07:41:23,859 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 418 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 07:41:23,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 497 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 07:41:23,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2022-07-12 07:41:23,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 963. [2022-07-12 07:41:23,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 676 states have (on average 1.3032544378698225) internal successors, (881), 574 states have internal predecessors, (881), 225 states have call successors, (225), 41 states have call predecessors, (225), 61 states have return successors, (412), 347 states have call predecessors, (412), 225 states have call successors, (412) [2022-07-12 07:41:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1518 transitions. [2022-07-12 07:41:23,926 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1518 transitions. Word has length 221 [2022-07-12 07:41:23,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:41:23,926 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1518 transitions. [2022-07-12 07:41:23,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-12 07:41:23,926 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1518 transitions. [2022-07-12 07:41:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-12 07:41:23,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:41:23,930 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,955 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:41:24,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:24,149 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:41:24,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:41:24,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2076186120, now seen corresponding path program 1 times [2022-07-12 07:41:24,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:41:24,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607239077] [2022-07-12 07:41:24,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:24,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:41:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 07:41:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:41:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 07:41:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:41:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 07:41:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 07:41:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 07:41:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 07:41:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 07:41:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 07:41:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 07:41:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 07:41:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 07:41:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 07:41:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 07:41:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 07:41:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 07:41:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 07:41:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 07:41:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2022-07-12 07:41:24,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:41:24,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607239077] [2022-07-12 07:41:24,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607239077] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:41:24,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569979665] [2022-07-12 07:41:24,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:24,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:24,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:41:24,490 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:41:24,515 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:41:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:25,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 2471 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 07:41:25,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:41:25,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 07:41:25,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 07:41:25,637 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:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2022-07-12 07:41:25,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:41:25,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569979665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:41:25,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 07:41:25,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-12 07:41:25,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842292379] [2022-07-12 07:41:25,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:41:25,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 07:41:25,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:41:25,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 07:41:25,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-12 07:41:25,643 INFO L87 Difference]: Start difference. First operand 963 states and 1518 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-12 07:41:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:41:25,784 INFO L93 Difference]: Finished difference Result 1940 states and 3040 transitions. [2022-07-12 07:41:25,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 07:41:25,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 221 [2022-07-12 07:41:25,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:41:25,793 INFO L225 Difference]: With dead ends: 1940 [2022-07-12 07:41:25,793 INFO L226 Difference]: Without dead ends: 1017 [2022-07-12 07:41:25,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-12 07:41:25,799 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 301 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 07:41:25,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 965 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 07:41:25,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2022-07-12 07:41:25,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 975. [2022-07-12 07:41:25,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 684 states have (on average 1.2997076023391814) internal successors, (889), 586 states have internal predecessors, (889), 225 states have call successors, (225), 41 states have call predecessors, (225), 65 states have return successors, (418), 347 states have call predecessors, (418), 225 states have call successors, (418) [2022-07-12 07:41:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1532 transitions. [2022-07-12 07:41:25,861 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1532 transitions. Word has length 221 [2022-07-12 07:41:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:41:25,862 INFO L495 AbstractCegarLoop]: Abstraction has 975 states and 1532 transitions. [2022-07-12 07:41:25,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-12 07:41:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1532 transitions. [2022-07-12 07:41:25,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-12 07:41:25,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:41:25,867 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:41:25,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-12 07:41:26,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:26,079 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:41:26,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:41:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1342111146, now seen corresponding path program 1 times [2022-07-12 07:41:26,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:41:26,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175374466] [2022-07-12 07:41:26,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:26,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:41:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 07:41:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 07:41:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 07:41:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:41:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 07:41:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 07:41:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 07:41:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 07:41:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 07:41:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 07:41:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 07:41:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 07:41:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 07:41:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 07:41:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 07:41:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 07:41:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 07:41:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-12 07:41:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 07:41:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:34,423 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 19 proven. 16 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2022-07-12 07:41:34,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:41:34,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175374466] [2022-07-12 07:41:34,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175374466] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:41:34,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775879812] [2022-07-12 07:41:34,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:34,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:34,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:41:34,440 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:34,441 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:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:35,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 2499 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 07:41:35,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:41:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2022-07-12 07:41:35,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:41:35,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775879812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:41:35,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 07:41:35,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2022-07-12 07:41:35,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788467401] [2022-07-12 07:41:35,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:41:35,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 07:41:35,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:41:35,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 07:41:35,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-07-12 07:41:35,758 INFO L87 Difference]: Start difference. First operand 975 states and 1532 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2022-07-12 07:41:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:41:36,977 INFO L93 Difference]: Finished difference Result 2599 states and 4124 transitions. [2022-07-12 07:41:36,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 07:41:36,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 220 [2022-07-12 07:41:36,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:41:36,985 INFO L225 Difference]: With dead ends: 2599 [2022-07-12 07:41:36,985 INFO L226 Difference]: Without dead ends: 1648 [2022-07-12 07:41:36,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2022-07-12 07:41:36,990 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 406 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:41:36,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1065 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 07:41:36,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2022-07-12 07:41:37,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1440. [2022-07-12 07:41:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 989 states have (on average 1.2810920121334681) internal successors, (1267), 899 states have internal predecessors, (1267), 342 states have call successors, (342), 63 states have call predecessors, (342), 108 states have return successors, (648), 477 states have call predecessors, (648), 342 states have call successors, (648) [2022-07-12 07:41:37,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2257 transitions. [2022-07-12 07:41:37,080 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2257 transitions. Word has length 220 [2022-07-12 07:41:37,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:41:37,080 INFO L495 AbstractCegarLoop]: Abstraction has 1440 states and 2257 transitions. [2022-07-12 07:41:37,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2022-07-12 07:41:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2257 transitions. [2022-07-12 07:41:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-12 07:41:37,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:41:37,084 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:41:37,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 07:41:37,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 07:41:37,307 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:41:37,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:41:37,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2117807204, now seen corresponding path program 1 times [2022-07-12 07:41:37,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:41:37,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683355060] [2022-07-12 07:41:37,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:37,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:41:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 07:41:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 07:41:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 07:41:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:41:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 07:41:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 07:41:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 07:41:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 07:41:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 07:41:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:41:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 07:41:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 07:41:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 07:41:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 07:41:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 07:41:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 07:41:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 07:41:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 07:41:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 07:41:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 07:41:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2022-07-12 07:41:51,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:41:51,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683355060] [2022-07-12 07:41:51,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683355060] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:41:51,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665371678] [2022-07-12 07:41:51,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:51,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:51,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:41:51,696 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 07:41:51,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 07:41:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:53,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 107 conjunts are in the unsatisfiable core [2022-07-12 07:41:53,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:41:53,355 INFO L356 Elim1Store]: treesize reduction 144, result has 14.8 percent of original size [2022-07-12 07:41:53,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 96 treesize of output 106 [2022-07-12 07:41:53,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2022-07-12 07:41:53,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 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:53,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 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:54,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 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:54,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2022-07-12 07:41:54,423 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-12 07:41:54,499 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-12 07:41:54,586 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-12 07:41:54,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:54,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:54,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:54,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:54,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:54,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:54,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:54,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:54,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:54,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:54,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:54,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:54,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:54,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:54,893 INFO L356 Elim1Store]: treesize reduction 315, result has 24.1 percent of original size [2022-07-12 07:41:54,895 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 720 treesize of output 318 [2022-07-12 07:41:54,923 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-12 07:41:54,924 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:41:55,241 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:41:55,358 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:41:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 185 proven. 33 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2022-07-12 07:41:55,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:41:55,712 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#num~0.offset| Int) (v_ArrVal_19061 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-12 07:41:55,752 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-12 07:41:55,783 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19061 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-12 07:41:55,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19061 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (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_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-12 07:41:55,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19030 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19032 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19031 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19030) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19031) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19032) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-12 07:41:55,899 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19030 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19029 (Array Int Int)) (v_ArrVal_19028 (Array Int Int)) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19032 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19031 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (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_19029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19028) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19030) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19031) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19032) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-12 07:41:55,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19030 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19029 (Array Int Int)) (v_ArrVal_19028 (Array Int Int)) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19032 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19031 (Array Int Int)) (v_ArrVal_19027 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19026 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19046 (Array Int Int)) (v_ArrVal_19057 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (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_19026) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19027) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19028) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19030) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19031) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19032) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-12 07:41:56,007 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19030 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19032 (Array Int Int)) (v_ArrVal_19031 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19057 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (v_ArrVal_19029 (Array Int Int)) (v_ArrVal_19028 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19027 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19026 (Array Int Int)) (v_ArrVal_19025 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19024 (Array Int Int)) (v_ArrVal_19046 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (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_19024) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19025) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19026) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19027) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19028) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19030) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19031) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19032) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-12 07:41:56,049 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19030 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19034 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19055 (Array Int Int)) (v_ArrVal_19032 (Array Int Int)) (v_ArrVal_19031 (Array Int Int)) (v_ArrVal_19038 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19036 (Array Int Int)) (v_ArrVal_19058 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19057 (Array Int Int)) (v_ArrVal_19061 (Array Int Int)) (v_ArrVal_19029 (Array Int Int)) (v_ArrVal_19028 (Array Int Int)) (v_ArrVal_19023 (Array Int Int)) (v_ArrVal_19022 (Array Int Int)) (v_ArrVal_19021 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19020 (Array Int Int)) (v_ArrVal_19027 (Array Int Int)) (v_ArrVal_19049 (Array Int Int)) (v_ArrVal_19026 (Array Int Int)) (v_ArrVal_19025 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19024 (Array Int Int)) (v_ArrVal_19046 (Array Int Int))) (not (= 1 (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (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_num~0#1.base| v_ArrVal_19020) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19023) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19021) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19022) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19024) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19025) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19026) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19027) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19028) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19030) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19031) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19032) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19034) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19036) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19038) |c_~#__CS_thread_status~0.base| v_ArrVal_19055) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19043))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19061) |c_~#empty~0.base| v_ArrVal_19058) |c_~#full~0.base| v_ArrVal_19049) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19046) |c_~#__CS_thread_status~0.base| v_ArrVal_19057) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256)))) is different from false [2022-07-12 07:41:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 854 trivial. 47 not checked. [2022-07-12 07:41:56,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665371678] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 07:41:56,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 07:41:56,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 15] total 33 [2022-07-12 07:41:56,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129719418] [2022-07-12 07:41:56,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 07:41:56,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 07:41:56,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:41:56,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 07:41:56,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=455, Unknown=9, NotChecked=468, Total=1056 [2022-07-12 07:41:56,288 INFO L87 Difference]: Start difference. First operand 1440 states and 2257 transitions. Second operand has 33 states, 33 states have (on average 5.333333333333333) internal successors, (176), 29 states have internal predecessors, (176), 9 states have call successors, (50), 9 states have call predecessors, (50), 6 states have return successors, (44), 9 states have call predecessors, (44), 9 states have call successors, (44) [2022-07-12 07:41:58,698 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:42:00,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:42:00,176 INFO L93 Difference]: Finished difference Result 2292 states and 3433 transitions. [2022-07-12 07:42:00,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 07:42:00,177 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.333333333333333) internal successors, (176), 29 states have internal predecessors, (176), 9 states have call successors, (50), 9 states have call predecessors, (50), 6 states have return successors, (44), 9 states have call predecessors, (44), 9 states have call successors, (44) Word has length 221 [2022-07-12 07:42:00,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:42:00,186 INFO L225 Difference]: With dead ends: 2292 [2022-07-12 07:42:00,186 INFO L226 Difference]: Without dead ends: 1626 [2022-07-12 07:42:00,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 486 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=276, Invalid=1083, Unknown=9, NotChecked=702, Total=2070 [2022-07-12 07:42:00,189 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 453 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 354 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 5006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 3177 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-12 07:42:00,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1125 Invalid, 5006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 1474 Invalid, 1 Unknown, 3177 Unchecked, 3.2s Time] [2022-07-12 07:42:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2022-07-12 07:42:00,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1552. [2022-07-12 07:42:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1074 states have (on average 1.266294227188082) internal successors, (1360), 986 states have internal predecessors, (1360), 353 states have call successors, (353), 69 states have call predecessors, (353), 124 states have return successors, (693), 496 states have call predecessors, (693), 353 states have call successors, (693) [2022-07-12 07:42:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2406 transitions. [2022-07-12 07:42:00,298 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2406 transitions. Word has length 221 [2022-07-12 07:42:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:42:00,298 INFO L495 AbstractCegarLoop]: Abstraction has 1552 states and 2406 transitions. [2022-07-12 07:42:00,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.333333333333333) internal successors, (176), 29 states have internal predecessors, (176), 9 states have call successors, (50), 9 states have call predecessors, (50), 6 states have return successors, (44), 9 states have call predecessors, (44), 9 states have call successors, (44) [2022-07-12 07:42:00,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2406 transitions. [2022-07-12 07:42:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-07-12 07:42:00,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:42:00,304 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:42:00,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 07:42:00,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:42:00,528 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:42:00,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:42:00,528 INFO L85 PathProgramCache]: Analyzing trace with hash 857070716, now seen corresponding path program 1 times [2022-07-12 07:42:00,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:42:00,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180504224] [2022-07-12 07:42:00,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:42:00,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:42:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:09,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 07:42:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:42:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:42:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:42:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 07:42:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:42:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:42:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:42:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 07:42:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 07:42:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:42:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:42:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 07:42:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:42:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:42:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 07:42:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 07:42:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:42:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:42:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 07:42:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 07:42:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 07:42:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-12 07:42:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 07:42:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 07:42:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 07:42:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-12 07:42:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-12 07:42:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-12 07:42:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2022-07-12 07:42:10,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:42:10,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180504224] [2022-07-12 07:42:10,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180504224] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:42:10,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331376279] [2022-07-12 07:42:10,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:42:10,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:42:10,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:42:10,100 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 07:42:10,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 07:42:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:11,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 2479 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 07:42:11,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:42:11,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 07:42:11,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 07:42:11,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 07:42:11,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 07:42:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2022-07-12 07:42:11,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:42:11,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331376279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:42:11,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 07:42:11,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2022-07-12 07:42:11,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503884485] [2022-07-12 07:42:11,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:42:11,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 07:42:11,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:42:11,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 07:42:11,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 07:42:11,519 INFO L87 Difference]: Start difference. First operand 1552 states and 2406 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-12 07:42:11,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:42:11,699 INFO L93 Difference]: Finished difference Result 3135 states and 4822 transitions. [2022-07-12 07:42:11,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 07:42:11,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 222 [2022-07-12 07:42:11,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:42:11,708 INFO L225 Difference]: With dead ends: 3135 [2022-07-12 07:42:11,708 INFO L226 Difference]: Without dead ends: 1600 [2022-07-12 07:42:11,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 07:42:11,714 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 335 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 07:42:11,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 904 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 07:42:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2022-07-12 07:42:11,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1531. [2022-07-12 07:42:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1059 states have (on average 1.267233238904627) internal successors, (1342), 972 states have internal predecessors, (1342), 350 states have call successors, (350), 67 states have call predecessors, (350), 121 states have return successors, (685), 491 states have call predecessors, (685), 350 states have call successors, (685) [2022-07-12 07:42:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 2377 transitions. [2022-07-12 07:42:11,822 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 2377 transitions. Word has length 222 [2022-07-12 07:42:11,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:42:11,822 INFO L495 AbstractCegarLoop]: Abstraction has 1531 states and 2377 transitions. [2022-07-12 07:42:11,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-12 07:42:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2377 transitions. [2022-07-12 07:42:11,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-12 07:42:11,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:42:11,828 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:42:11,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 07:42:12,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 07:42:12,043 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:42:12,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:42:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1032257057, now seen corresponding path program 1 times [2022-07-12 07:42:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:42:12,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784005963] [2022-07-12 07:42:12,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:42:12,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:42:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 07:42:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 07:42:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:42:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:42:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 07:42:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 07:42:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:42:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:42:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 07:42:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 07:42:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:42:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:42:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 07:42:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:42:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:42:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 07:42:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 07:42:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:42:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 07:42:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 07:42:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 07:42:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 07:42:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 07:42:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 07:42:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 07:42:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 07:42:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 07:42:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 07:42:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 07:42:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2022-07-12 07:42:34,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:42:34,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784005963] [2022-07-12 07:42:34,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784005963] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:42:34,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767835451] [2022-07-12 07:42:34,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:42:34,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:42:34,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:42:34,641 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 07:42:34,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 07:42:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:42:36,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 156 conjunts are in the unsatisfiable core [2022-07-12 07:42:36,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:42:36,707 INFO L356 Elim1Store]: treesize reduction 120, result has 25.5 percent of original size [2022-07-12 07:42:36,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 114 [2022-07-12 07:42:36,922 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-12 07:42:36,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 19 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2022-07-12 07:42:36,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 07:42:36,950 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 7 treesize of output 3 [2022-07-12 07:42:37,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2022-07-12 07:42:37,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2022-07-12 07:42:37,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2022-07-12 07:42:38,870 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-12 07:42:38,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 19 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 59 [2022-07-12 07:42:39,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2022-07-12 07:42:39,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2022-07-12 07:42:39,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2022-07-12 07:42:39,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2022-07-12 07:42:39,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:39,947 INFO L356 Elim1Store]: treesize reduction 618, result has 10.7 percent of original size [2022-07-12 07:42:39,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 27 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 467 treesize of output 608 [2022-07-12 07:42:39,969 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 14 treesize of output 10 [2022-07-12 07:42:40,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:40,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:40,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:40,147 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:40,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:40,167 INFO L244 Elim1Store]: Index analysis took 123 ms [2022-07-12 07:42:40,180 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-12 07:42:40,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 27 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 5 case distinctions, treesize of input 261 treesize of output 238 [2022-07-12 07:42:40,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:40,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:40,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:40,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:40,495 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:40,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:42:40,528 INFO L244 Elim1Store]: Index analysis took 183 ms [2022-07-12 07:42:40,541 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-12 07:42:40,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 27 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 5 case distinctions, treesize of input 261 treesize of output 238 [2022-07-12 07:42:40,592 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 14 treesize of output 10 [2022-07-12 07:42:40,657 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 14 treesize of output 10 [2022-07-12 07:42:40,736 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 14 treesize of output 10 [2022-07-12 07:42:40,844 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 14 treesize of output 10 [2022-07-12 07:42:41,051 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 14 treesize of output 10 [2022-07-12 07:42:41,138 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 14 treesize of output 10 [2022-07-12 07:42:41,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:41,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:41,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:41,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:41,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:41,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:41,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:41,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:41,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:41,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:41,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:41,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:41,384 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-12 07:42:41,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 27 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 49 [2022-07-12 07:42:45,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:45,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:45,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:45,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 9 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 10886 treesize of output 10308 [2022-07-12 07:42:53,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:53,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:53,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:53,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 8243 treesize of output 8303 [2022-07-12 07:42:55,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:55,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:55,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:55,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 67 [2022-07-12 07:42:55,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:55,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:55,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:55,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 67 [2022-07-12 07:42:55,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:55,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:55,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:55,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 67 [2022-07-12 07:42:57,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:57,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:57,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:57,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:57,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 222 [2022-07-12 07:42:58,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:58,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-07-12 07:42:58,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:58,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-07-12 07:42:58,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:58,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-07-12 07:42:58,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:58,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:58,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:58,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 2214 treesize of output 2222 [2022-07-12 07:42:59,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:59,289 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 07:42:59,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 07:42:59,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 07:42:59,514 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @17f9344b) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.constructNestedStoreUpdateConstraintForOnePosition(ArrayIndexEqualityManager.java:415) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.constructNestedStoreUpdateConstraint(ArrayIndexEqualityManager.java:449) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.constructWriteConstraints2(Elim1Store.java:975) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:314) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:257) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-12 07:42:59,517 INFO L158 Benchmark]: Toolchain (without parser) took 136784.72ms. Allocated memory was 86.0MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 51.5MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-07-12 07:42:59,517 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory was 42.0MB in the beginning and 42.0MB in the end (delta: 47.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 07:42:59,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.50ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.3MB in the beginning and 58.4MB in the end (delta: -7.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 07:42:59,518 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.15ms. Allocated memory is still 104.9MB. Free memory was 58.4MB in the beginning and 53.7MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 07:42:59,518 INFO L158 Benchmark]: Boogie Preprocessor took 69.35ms. Allocated memory is still 104.9MB. Free memory was 53.7MB in the beginning and 50.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 07:42:59,518 INFO L158 Benchmark]: RCFGBuilder took 2749.96ms. Allocated memory is still 104.9MB. Free memory was 50.0MB in the beginning and 73.4MB in the end (delta: -23.4MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2022-07-12 07:42:59,518 INFO L158 Benchmark]: TraceAbstraction took 133306.72ms. Allocated memory was 104.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 72.7MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-07-12 07:42:59,519 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory was 42.0MB in the beginning and 42.0MB in the end (delta: 47.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 573.50ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.3MB in the beginning and 58.4MB in the end (delta: -7.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.15ms. Allocated memory is still 104.9MB. Free memory was 58.4MB in the beginning and 53.7MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.35ms. Allocated memory is still 104.9MB. Free memory was 53.7MB in the beginning and 50.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2749.96ms. Allocated memory is still 104.9MB. Free memory was 50.0MB in the beginning and 73.4MB in the end (delta: -23.4MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * TraceAbstraction took 133306.72ms. Allocated memory was 104.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 72.7MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @17f9344b) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @17f9344b): de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:103) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 07:42:59,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_sync.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 07:43:01,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 07:43:01,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 07:43:01,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 07:43:01,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 07:43:01,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 07:43:01,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 07:43:01,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 07:43:01,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 07:43:01,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 07:43:01,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 07:43:01,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 07:43:01,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 07:43:01,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 07:43:01,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 07:43:01,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 07:43:01,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 07:43:01,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 07:43:01,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 07:43:01,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 07:43:01,409 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 07:43:01,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 07:43:01,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 07:43:01,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 07:43:01,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 07:43:01,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 07:43:01,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 07:43:01,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 07:43:01,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 07:43:01,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 07:43:01,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 07:43:01,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 07:43:01,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 07:43:01,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 07:43:01,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 07:43:01,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 07:43:01,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 07:43:01,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 07:43:01,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 07:43:01,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 07:43:01,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 07:43:01,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 07:43:01,430 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 07:43:01,458 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 07:43:01,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 07:43:01,458 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 07:43:01,459 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 07:43:01,459 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 07:43:01,459 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 07:43:01,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 07:43:01,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 07:43:01,460 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 07:43:01,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 07:43:01,461 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 07:43:01,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 07:43:01,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 07:43:01,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 07:43:01,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 07:43:01,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 07:43:01,462 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 07:43:01,462 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 07:43:01,462 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 07:43:01,462 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 07:43:01,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 07:43:01,462 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 07:43:01,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 07:43:01,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 07:43:01,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 07:43:01,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 07:43:01,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 07:43:01,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 07:43:01,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 07:43:01,463 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 07:43:01,464 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 07:43:01,464 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 07:43:01,464 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 07:43:01,464 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 07:43:01,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 07:43:01,464 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 07:43:01,464 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef [2022-07-12 07:43:01,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 07:43:01,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 07:43:01,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 07:43:01,728 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 07:43:01,738 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 07:43:01,740 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_sync.i [2022-07-12 07:43:01,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b91dc75db/e3180d7716ea47aa9781d5061962e437/FLAG6a98eb5f9 [2022-07-12 07:43:02,203 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 07:43:02,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i [2022-07-12 07:43:02,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b91dc75db/e3180d7716ea47aa9781d5061962e437/FLAG6a98eb5f9 [2022-07-12 07:43:02,555 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b91dc75db/e3180d7716ea47aa9781d5061962e437 [2022-07-12 07:43:02,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 07:43:02,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 07:43:02,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 07:43:02,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 07:43:02,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 07:43:02,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:43:02" (1/1) ... [2022-07-12 07:43:02,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a1ce289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:43:02, skipping insertion in model container [2022-07-12 07:43:02,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:43:02" (1/1) ... [2022-07-12 07:43:02,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 07:43:02,639 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 07:43:02,938 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_sync.i[34698,34711] [2022-07-12 07:43:03,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 07:43:03,029 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 07:43:03,050 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_sync.i[34698,34711] [2022-07-12 07:43:03,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 07:43:03,143 INFO L208 MainTranslator]: Completed translation [2022-07-12 07:43:03,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:43:03 WrapperNode [2022-07-12 07:43:03,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 07:43:03,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 07:43:03,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 07:43:03,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 07:43:03,149 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:43:03" (1/1) ... [2022-07-12 07:43:03,189 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:43:03" (1/1) ... [2022-07-12 07:43:03,233 INFO L137 Inliner]: procedures = 249, calls = 244, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 529 [2022-07-12 07:43:03,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 07:43:03,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 07:43:03,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 07:43:03,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 07:43:03,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:43:03" (1/1) ... [2022-07-12 07:43:03,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:43:03" (1/1) ... [2022-07-12 07:43:03,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:43:03" (1/1) ... [2022-07-12 07:43:03,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:43:03" (1/1) ... [2022-07-12 07:43:03,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:43:03" (1/1) ... [2022-07-12 07:43:03,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:43:03" (1/1) ... [2022-07-12 07:43:03,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:43:03" (1/1) ... [2022-07-12 07:43:03,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 07:43:03,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 07:43:03,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 07:43:03,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 07:43:03,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:43:03" (1/1) ... [2022-07-12 07:43:03,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 07:43:03,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:43:03,314 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:43:03,333 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:43:03,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-12 07:43:03,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 07:43:03,343 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 07:43:03,343 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 07:43:03,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 07:43:03,343 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_signal [2022-07-12 07:43:03,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_signal [2022-07-12 07:43:03,343 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-12 07:43:03,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-12 07:43:03,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 07:43:03,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-12 07:43:03,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 07:43:03,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 07:43:03,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 07:43:03,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 07:43:03,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-12 07:43:03,344 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-12 07:43:03,344 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-12 07:43:03,344 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_init [2022-07-12 07:43:03,345 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_init [2022-07-12 07:43:03,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 07:43:03,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 07:43:03,345 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-12 07:43:03,345 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-12 07:43:03,345 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_wait [2022-07-12 07:43:03,345 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_wait [2022-07-12 07:43:03,345 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-12 07:43:03,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-12 07:43:03,346 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-12 07:43:03,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-12 07:43:03,346 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-12 07:43:03,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-12 07:43:03,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 07:43:03,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 07:43:03,489 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 07:43:03,490 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 07:43:03,808 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-07-12 07:43:03,808 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv32, 0bv32;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-12 07:43:03,808 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-07-12 07:43:03,808 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv32, 0bv32;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-12 07:43:03,809 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: SUMMARY for call __CS_cs(); srcloc: null [2022-07-12 07:43:03,809 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv32, 0bv32;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-12 07:43:03,809 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-07-12 07:43:06,152 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 07:43:06,157 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 07:43:06,158 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-12 07:43:06,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:43:06 BoogieIcfgContainer [2022-07-12 07:43:06,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 07:43:06,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 07:43:06,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 07:43:06,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 07:43:06,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:43:02" (1/3) ... [2022-07-12 07:43:06,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@100af898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:43:06, skipping insertion in model container [2022-07-12 07:43:06,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:43:03" (2/3) ... [2022-07-12 07:43:06,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@100af898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:43:06, skipping insertion in model container [2022-07-12 07:43:06,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:43:06" (3/3) ... [2022-07-12 07:43:06,189 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_sync.i [2022-07-12 07:43:06,198 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 07:43:06,198 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 07:43:06,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 07:43:06,261 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@59f3f1a9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@10d8f1fe [2022-07-12 07:43:06,262 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 07:43:06,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 128 states have internal predecessors, (185), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-12 07:43:06,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 07:43:06,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:43:06,281 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:06,282 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:43:06,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:43:06,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1902090431, now seen corresponding path program 1 times [2022-07-12 07:43:06,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 07:43:06,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946001552] [2022-07-12 07:43:06,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:43:06,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 07:43:06,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 07:43:06,297 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 07:43:06,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 07:43:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:43:07,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 07:43:07,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:43:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-12 07:43:07,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:43:07,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 07:43:07,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946001552] [2022-07-12 07:43:07,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946001552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:43:07,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:43:07,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 07:43:07,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781800733] [2022-07-12 07:43:07,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:43:07,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 07:43:07,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 07:43:07,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 07:43:07,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 07:43:07,074 INFO L87 Difference]: Start difference. First operand has 194 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 128 states have internal predecessors, (185), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 07:43:07,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:43:07,106 INFO L93 Difference]: Finished difference Result 386 states and 633 transitions. [2022-07-12 07:43:07,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 07:43:07,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2022-07-12 07:43:07,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:43:07,114 INFO L225 Difference]: With dead ends: 386 [2022-07-12 07:43:07,115 INFO L226 Difference]: Without dead ends: 190 [2022-07-12 07:43:07,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 07:43:07,121 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:43:07,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:43:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-12 07:43:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-07-12 07:43:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 124 states have (on average 1.403225806451613) internal successors, (174), 124 states have internal predecessors, (174), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-12 07:43:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 284 transitions. [2022-07-12 07:43:07,159 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 284 transitions. Word has length 72 [2022-07-12 07:43:07,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:43:07,160 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 284 transitions. [2022-07-12 07:43:07,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 07:43:07,160 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 284 transitions. [2022-07-12 07:43:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 07:43:07,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:43:07,165 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:07,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-12 07:43:07,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 07:43:07,366 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:43:07,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:43:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1312194389, now seen corresponding path program 1 times [2022-07-12 07:43:07,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 07:43:07,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552667176] [2022-07-12 07:43:07,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:43:07,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 07:43:07,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 07:43:07,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 07:43:07,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 07:43:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:43:08,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 07:43:08,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:43:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-12 07:43:08,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:43:08,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 07:43:08,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552667176] [2022-07-12 07:43:08,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552667176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:43:08,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:43:08,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 07:43:08,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471434656] [2022-07-12 07:43:08,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:43:08,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:43:08,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 07:43:08,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:43:08,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:43:08,068 INFO L87 Difference]: Start difference. First operand 190 states and 284 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 07:43:08,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:43:08,302 INFO L93 Difference]: Finished difference Result 378 states and 566 transitions. [2022-07-12 07:43:08,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:43:08,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-07-12 07:43:08,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:43:08,308 INFO L225 Difference]: With dead ends: 378 [2022-07-12 07:43:08,308 INFO L226 Difference]: Without dead ends: 194 [2022-07-12 07:43:08,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 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:43:08,310 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 4 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 07:43:08,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 560 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 07:43:08,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-12 07:43:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2022-07-12 07:43:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 125 states have (on average 1.4) internal successors, (175), 125 states have internal predecessors, (175), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-12 07:43:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 285 transitions. [2022-07-12 07:43:08,323 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 285 transitions. Word has length 72 [2022-07-12 07:43:08,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:43:08,323 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 285 transitions. [2022-07-12 07:43:08,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 07:43:08,323 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 285 transitions. [2022-07-12 07:43:08,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-12 07:43:08,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:43:08,327 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:08,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 07:43:08,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 07:43:08,560 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:43:08,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:43:08,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1569921272, now seen corresponding path program 1 times [2022-07-12 07:43:08,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 07:43:08,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526381997] [2022-07-12 07:43:08,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:43:08,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 07:43:08,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 07:43:08,570 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 07:43:08,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 07:43:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:43:09,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 07:43:09,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:43:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-12 07:43:09,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:43:09,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 07:43:09,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526381997] [2022-07-12 07:43:09,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526381997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:43:09,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:43:09,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 07:43:09,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889809783] [2022-07-12 07:43:09,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:43:09,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:43:09,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 07:43:09,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:43:09,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:43:09,303 INFO L87 Difference]: Start difference. First operand 191 states and 285 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 07:43:09,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:43:09,363 INFO L93 Difference]: Finished difference Result 381 states and 570 transitions. [2022-07-12 07:43:09,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:43:09,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2022-07-12 07:43:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:43:09,369 INFO L225 Difference]: With dead ends: 381 [2022-07-12 07:43:09,369 INFO L226 Difference]: Without dead ends: 193 [2022-07-12 07:43:09,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 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:43:09,371 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 561 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:43:09,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 561 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:43:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-12 07:43:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2022-07-12 07:43:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 126 states have internal predecessors, (176), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-12 07:43:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 286 transitions. [2022-07-12 07:43:09,383 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 286 transitions. Word has length 75 [2022-07-12 07:43:09,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:43:09,383 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 286 transitions. [2022-07-12 07:43:09,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 07:43:09,384 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 286 transitions. [2022-07-12 07:43:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-12 07:43:09,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:43:09,386 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:09,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 07:43:09,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 07:43:09,600 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:43:09,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:43:09,603 INFO L85 PathProgramCache]: Analyzing trace with hash 217866074, now seen corresponding path program 1 times [2022-07-12 07:43:09,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 07:43:09,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807752841] [2022-07-12 07:43:09,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:43:09,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 07:43:09,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 07:43:09,605 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 07:43:09,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 07:43:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:43:10,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 07:43:10,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:43:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-12 07:43:10,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:43:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-12 07:43:10,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 07:43:10,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807752841] [2022-07-12 07:43:10,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807752841] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 07:43:10,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 07:43:10,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 07:43:10,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726591412] [2022-07-12 07:43:10,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 07:43:10,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 07:43:10,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 07:43:10,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 07:43:10,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 07:43:10,471 INFO L87 Difference]: Start difference. First operand 192 states and 286 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-12 07:43:10,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:43:10,686 INFO L93 Difference]: Finished difference Result 385 states and 575 transitions. [2022-07-12 07:43:10,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 07:43:10,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 77 [2022-07-12 07:43:10,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:43:10,689 INFO L225 Difference]: With dead ends: 385 [2022-07-12 07:43:10,689 INFO L226 Difference]: Without dead ends: 196 [2022-07-12 07:43:10,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 07:43:10,691 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 07:43:10,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 840 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 07:43:10,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-12 07:43:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-07-12 07:43:10,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-12 07:43:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 290 transitions. [2022-07-12 07:43:10,700 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 290 transitions. Word has length 77 [2022-07-12 07:43:10,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:43:10,700 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 290 transitions. [2022-07-12 07:43:10,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-12 07:43:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 290 transitions. [2022-07-12 07:43:10,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-12 07:43:10,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:43:10,702 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2022-07-12 07:43:10,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 07:43:10,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 07:43:10,921 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:43:10,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:43:10,921 INFO L85 PathProgramCache]: Analyzing trace with hash 971561630, now seen corresponding path program 2 times [2022-07-12 07:43:10,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 07:43:10,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666089967] [2022-07-12 07:43:10,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 07:43:10,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 07:43:10,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 07:43:10,924 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 07:43:10,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 07:43:11,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 07:43:11,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 07:43:11,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 07:43:11,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:43:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-12 07:43:11,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:43:11,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 07:43:11,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666089967] [2022-07-12 07:43:11,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666089967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:43:11,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:43:11,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 07:43:11,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451696534] [2022-07-12 07:43:11,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:43:11,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:43:11,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 07:43:11,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:43:11,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:43:11,703 INFO L87 Difference]: Start difference. First operand 196 states and 290 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 07:43:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:43:11,724 INFO L93 Difference]: Finished difference Result 375 states and 558 transitions. [2022-07-12 07:43:11,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:43:11,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 81 [2022-07-12 07:43:11,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:43:11,728 INFO L225 Difference]: With dead ends: 375 [2022-07-12 07:43:11,728 INFO L226 Difference]: Without dead ends: 196 [2022-07-12 07:43:11,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 79 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:43:11,729 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:43:11,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 562 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:43:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-12 07:43:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-07-12 07:43:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 130 states have (on average 1.376923076923077) internal successors, (179), 130 states have internal predecessors, (179), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-12 07:43:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 289 transitions. [2022-07-12 07:43:11,744 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 289 transitions. Word has length 81 [2022-07-12 07:43:11,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:43:11,744 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 289 transitions. [2022-07-12 07:43:11,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-12 07:43:11,745 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 289 transitions. [2022-07-12 07:43:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-12 07:43:11,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:43:11,746 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1] [2022-07-12 07:43:11,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 07:43:11,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 07:43:11,951 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:43:11,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:43:11,951 INFO L85 PathProgramCache]: Analyzing trace with hash -768163553, now seen corresponding path program 1 times [2022-07-12 07:43:11,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 07:43:11,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767283148] [2022-07-12 07:43:11,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:43:11,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 07:43:11,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 07:43:11,954 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 07:43:11,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 07:43:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:43:12,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 07:43:12,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:43:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2022-07-12 07:43:12,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:43:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2022-07-12 07:43:12,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 07:43:12,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767283148] [2022-07-12 07:43:12,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767283148] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 07:43:12,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 07:43:12,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 07:43:12,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072029773] [2022-07-12 07:43:12,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 07:43:12,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 07:43:12,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 07:43:12,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 07:43:12,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 07:43:12,956 INFO L87 Difference]: Start difference. First operand 196 states and 289 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 07:43:13,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:43:13,592 INFO L93 Difference]: Finished difference Result 397 states and 584 transitions. [2022-07-12 07:43:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 07:43:13,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 109 [2022-07-12 07:43:13,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:43:13,595 INFO L225 Difference]: With dead ends: 397 [2022-07-12 07:43:13,595 INFO L226 Difference]: Without dead ends: 213 [2022-07-12 07:43:13,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 07:43:13,597 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 11 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 07:43:13,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1114 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 07:43:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-12 07:43:13,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2022-07-12 07:43:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 139 states have (on average 1.3597122302158273) internal successors, (189), 139 states have internal predecessors, (189), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-12 07:43:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 299 transitions. [2022-07-12 07:43:13,605 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 299 transitions. Word has length 109 [2022-07-12 07:43:13,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:43:13,615 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 299 transitions. [2022-07-12 07:43:13,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 07:43:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 299 transitions. [2022-07-12 07:43:13,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 07:43:13,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:43:13,617 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 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] [2022-07-12 07:43:13,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 07:43:13,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 07:43:13,840 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:43:13,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:43:13,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1532343052, now seen corresponding path program 2 times [2022-07-12 07:43:13,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 07:43:13,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300275493] [2022-07-12 07:43:13,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 07:43:13,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 07:43:13,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 07:43:13,845 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 07:43:13,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 07:43:14,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 07:43:14,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 07:43:14,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 07:43:14,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:43:14,862 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-07-12 07:43:14,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:43:14,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 07:43:14,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300275493] [2022-07-12 07:43:14,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300275493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:43:14,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:43:14,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 07:43:14,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207139528] [2022-07-12 07:43:14,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:43:14,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 07:43:14,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 07:43:14,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 07:43:14,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 07:43:14,864 INFO L87 Difference]: Start difference. First operand 205 states and 299 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-12 07:43:16,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:43:16,177 INFO L93 Difference]: Finished difference Result 447 states and 687 transitions. [2022-07-12 07:43:16,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 07:43:16,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2022-07-12 07:43:16,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:43:16,181 INFO L225 Difference]: With dead ends: 447 [2022-07-12 07:43:16,181 INFO L226 Difference]: Without dead ends: 421 [2022-07-12 07:43:16,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 07:43:16,182 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 380 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 07:43:16,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 891 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 07:43:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-07-12 07:43:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 419. [2022-07-12 07:43:16,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 274 states have (on average 1.4087591240875912) internal successors, (386), 277 states have internal predecessors, (386), 120 states have call successors, (120), 20 states have call predecessors, (120), 24 states have return successors, (141), 121 states have call predecessors, (141), 120 states have call successors, (141) [2022-07-12 07:43:16,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 647 transitions. [2022-07-12 07:43:16,224 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 647 transitions. Word has length 118 [2022-07-12 07:43:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:43:16,226 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 647 transitions. [2022-07-12 07:43:16,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-12 07:43:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 647 transitions. [2022-07-12 07:43:16,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-12 07:43:16,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:43:16,231 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:43:16,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 07:43:16,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 07:43:16,443 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:43:16,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:43:16,443 INFO L85 PathProgramCache]: Analyzing trace with hash 475166479, now seen corresponding path program 1 times [2022-07-12 07:43:16,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 07:43:16,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290423831] [2022-07-12 07:43:16,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:43:16,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 07:43:16,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 07:43:16,445 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 07:43:16,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 07:43:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:43:17,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 1629 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 07:43:17,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:43:17,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 07:43:17,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 07:43:17,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 07:43:17,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 07:43:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2022-07-12 07:43:17,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:43:17,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 07:43:17,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290423831] [2022-07-12 07:43:17,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290423831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:43:17,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:43:17,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 07:43:17,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989745637] [2022-07-12 07:43:17,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:43:17,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 07:43:17,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 07:43:17,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 07:43:17,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 07:43:17,784 INFO L87 Difference]: Start difference. First operand 419 states and 647 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-12 07:43:18,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:43:18,420 INFO L93 Difference]: Finished difference Result 1227 states and 1924 transitions. [2022-07-12 07:43:18,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 07:43:18,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 221 [2022-07-12 07:43:18,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:43:18,429 INFO L225 Difference]: With dead ends: 1227 [2022-07-12 07:43:18,429 INFO L226 Difference]: Without dead ends: 832 [2022-07-12 07:43:18,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 07:43:18,432 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 338 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 07:43:18,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 903 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 07:43:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2022-07-12 07:43:18,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 425. [2022-07-12 07:43:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 278 states have (on average 1.4028776978417266) internal successors, (390), 283 states have internal predecessors, (390), 120 states have call successors, (120), 20 states have call predecessors, (120), 26 states have return successors, (146), 121 states have call predecessors, (146), 120 states have call successors, (146) [2022-07-12 07:43:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 656 transitions. [2022-07-12 07:43:18,463 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 656 transitions. Word has length 221 [2022-07-12 07:43:18,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:43:18,464 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 656 transitions. [2022-07-12 07:43:18,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-12 07:43:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 656 transitions. [2022-07-12 07:43:18,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-12 07:43:18,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:43:18,468 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:43:18,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 07:43:18,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 07:43:18,693 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:43:18,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:43:18,693 INFO L85 PathProgramCache]: Analyzing trace with hash -904655670, now seen corresponding path program 1 times [2022-07-12 07:43:18,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 07:43:18,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153848263] [2022-07-12 07:43:18,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:43:18,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 07:43:18,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 07:43:18,704 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 07:43:18,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 07:43:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:43:19,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 1649 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 07:43:19,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:43:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2022-07-12 07:43:20,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:43:20,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 07:43:20,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153848263] [2022-07-12 07:43:20,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153848263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:43:20,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:43:20,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 07:43:20,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513836886] [2022-07-12 07:43:20,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:43:20,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 07:43:20,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 07:43:20,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 07:43:20,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 07:43:20,047 INFO L87 Difference]: Start difference. First operand 425 states and 656 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 07:43:20,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:43:20,754 INFO L93 Difference]: Finished difference Result 1036 states and 1695 transitions. [2022-07-12 07:43:20,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 07:43:20,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) Word has length 220 [2022-07-12 07:43:20,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:43:20,758 INFO L225 Difference]: With dead ends: 1036 [2022-07-12 07:43:20,758 INFO L226 Difference]: Without dead ends: 635 [2022-07-12 07:43:20,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-12 07:43:20,761 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 402 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 07:43:20,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 546 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 07:43:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-07-12 07:43:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 625. [2022-07-12 07:43:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 430 states have (on average 1.283720930232558) internal successors, (552), 386 states have internal predecessors, (552), 155 states have call successors, (155), 24 states have call predecessors, (155), 39 states have return successors, (268), 214 states have call predecessors, (268), 155 states have call successors, (268) [2022-07-12 07:43:20,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 975 transitions. [2022-07-12 07:43:20,787 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 975 transitions. Word has length 220 [2022-07-12 07:43:20,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:43:20,788 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 975 transitions. [2022-07-12 07:43:20,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 07:43:20,788 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 975 transitions. [2022-07-12 07:43:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-12 07:43:20,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:43:20,791 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:43:20,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 07:43:21,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 07:43:21,015 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:43:21,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:43:21,015 INFO L85 PathProgramCache]: Analyzing trace with hash 103491005, now seen corresponding path program 1 times [2022-07-12 07:43:21,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 07:43:21,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105856135] [2022-07-12 07:43:21,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:43:21,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 07:43:21,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 07:43:21,017 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 07:43:21,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 07:43:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:43:23,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 1636 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 07:43:23,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:43:23,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-07-12 07:43:23,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 07:43:24,014 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:43:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 400 proven. 5 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2022-07-12 07:43:24,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:43:24,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-12 07:43:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 899 trivial. 0 not checked. [2022-07-12 07:43:24,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 07:43:24,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105856135] [2022-07-12 07:43:24,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105856135] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 07:43:24,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 07:43:24,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-07-12 07:43:24,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087460858] [2022-07-12 07:43:24,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 07:43:24,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 07:43:24,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 07:43:24,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 07:43:24,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 07:43:24,330 INFO L87 Difference]: Start difference. First operand 625 states and 975 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 7 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2022-07-12 07:43:26,350 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:43:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:43:28,184 INFO L93 Difference]: Finished difference Result 1425 states and 2259 transitions. [2022-07-12 07:43:28,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 07:43:28,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 7 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) Word has length 221 [2022-07-12 07:43:28,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:43:28,192 INFO L225 Difference]: With dead ends: 1425 [2022-07-12 07:43:28,192 INFO L226 Difference]: Without dead ends: 1369 [2022-07-12 07:43:28,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-12 07:43:28,194 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 630 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 401 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-12 07:43:28,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 814 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 573 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-07-12 07:43:28,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2022-07-12 07:43:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1329. [2022-07-12 07:43:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 905 states have (on average 1.287292817679558) internal successors, (1165), 806 states have internal predecessors, (1165), 337 states have call successors, (337), 48 states have call predecessors, (337), 86 states have return successors, (614), 474 states have call predecessors, (614), 337 states have call successors, (614) [2022-07-12 07:43:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 2116 transitions. [2022-07-12 07:43:28,270 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 2116 transitions. Word has length 221 [2022-07-12 07:43:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:43:28,270 INFO L495 AbstractCegarLoop]: Abstraction has 1329 states and 2116 transitions. [2022-07-12 07:43:28,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 7 states have call successors, (34), 4 states have call predecessors, (34), 5 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2022-07-12 07:43:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 2116 transitions. [2022-07-12 07:43:28,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-12 07:43:28,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:43:28,275 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:43:28,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 07:43:28,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 07:43:28,499 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:43:28,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:43:28,500 INFO L85 PathProgramCache]: Analyzing trace with hash 871035319, now seen corresponding path program 1 times [2022-07-12 07:43:28,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 07:43:28,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986482976] [2022-07-12 07:43:28,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:43:28,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 07:43:28,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 07:43:28,502 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 07:43:28,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 07:43:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:43:39,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 507 conjunts are in the unsatisfiable core [2022-07-12 07:43:39,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:43:39,799 INFO L356 Elim1Store]: treesize reduction 138, result has 18.3 percent of original size [2022-07-12 07:43:39,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 384 treesize of output 400 [2022-07-12 07:43:40,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 44 [2022-07-12 07:43:40,792 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 07:43:40,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 41 [2022-07-12 07:43:41,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-07-12 07:43:41,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2022-07-12 07:43:42,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-07-12 07:43:42,120 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 4 [2022-07-12 07:43:43,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2022-07-12 07:43:44,278 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 07:43:44,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 17 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 46 [2022-07-12 07:43:44,302 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 8 treesize of output 4 [2022-07-12 07:43:44,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, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-07-12 07:43:45,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-07-12 07:43:45,474 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 0 case distinctions, treesize of input 31 treesize of output 33 [2022-07-12 07:43:45,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2022-07-12 07:43:47,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:43:47,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:43:47,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:43:47,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:43:47,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:43:47,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:43:47,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:43:48,124 INFO L356 Elim1Store]: treesize reduction 134, result has 16.8 percent of original size [2022-07-12 07:43:48,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 33 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 90 [2022-07-12 07:43:48,164 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-12 07:43:48,164 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 17 treesize of output 21 [2022-07-12 07:43:48,307 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 10 treesize of output 4 [2022-07-12 07:43:48,485 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 21 treesize of output 9 [2022-07-12 07:43:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 186 proven. 40 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2022-07-12 07:43:48,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:43:49,759 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#empty~0.offset| (_ BitVec 32)) (v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10597 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ BitVec 32)) (|~#m~0.offset| (_ BitVec 32)) (|~#full~0.offset| (_ BitVec 32)) (|~#num~0.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ BitVec 32)) (v_~__CS_round~0_213 (_ BitVec 8)) (|~#__CS_thread_born_round~0.offset| (_ BitVec 32)) (v_ArrVal_10605 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_10605) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_10597))) (store .cse4 |c_~#num~0.base| (store (select .cse4 |c_~#num~0.base|) (bvadd (_ bv4 32) |~#num~0.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.offset|))))))) (store .cse3 |c_~#m~0.base| (store (select .cse3 |c_~#m~0.base|) (bvadd (_ bv1 32) |~#m~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.offset| (_ bv1 32)))))))))) (store .cse2 |c_~#empty~0.base| (store (select .cse2 |c_~#empty~0.base|) (bvadd |~#empty~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ bv1 32)))))))))) (store .cse1 |c_~#full~0.base| (store (select .cse1 |c_~#full~0.base|) (bvadd |~#full~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ bv1 32)))))))))) (store .cse0 |c_~#__CS_thread_born_round~0.base| (store (select .cse0 |c_~#__CS_thread_born_round~0.base|) |~#__CS_thread_born_round~0.offset| ((_ sign_extend 24) v_~__CS_round~0_213)))) |c_~#__CS_thread_status~0.base| v_ArrVal_10619) |c_~#__CS_thread_allocated~0.base|) (bvadd |c_~#__CS_thread_allocated~0.offset| (_ bv2 32)))))))) is different from false [2022-07-12 07:43:50,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10597 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m~0.offset| (_ BitVec 32)) (|~#full~0.offset| (_ BitVec 32)) (|~#num~0.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~i~0#1| (_ BitVec 32)) (|~#empty~0.offset| (_ BitVec 32)) (v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet83#1| (_ BitVec 8)) (|ULTIMATE.start_main_~j~2#1| (_ BitVec 32)) (v_~__CS_round~0_213 (_ BitVec 8)) (v_ArrVal_10605 (Array (_ BitVec 32) (_ BitVec 32))) (|~#__CS_thread_born_round~0.offset| (_ BitVec 32)) (v_ArrVal_10219 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store (store (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|) (bvadd (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) |ULTIMATE.start_main_~j~2#1| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset|) ((_ sign_extend 24) |ULTIMATE.start_main_#t~nondet83#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10219) |c_~#__CS_thread_status~0.base| v_ArrVal_10605) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_10597))) (store .cse4 |c_~#num~0.base| (store (select .cse4 |c_~#num~0.base|) (bvadd (_ bv4 32) |~#num~0.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.offset|))))))) (store .cse3 |c_~#m~0.base| (store (select .cse3 |c_~#m~0.base|) (bvadd (_ bv1 32) |~#m~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.offset| (_ bv1 32)))))))))) (store .cse2 |c_~#empty~0.base| (store (select .cse2 |c_~#empty~0.base|) (bvadd |~#empty~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ bv1 32)))))))))) (store .cse1 |c_~#full~0.base| (store (select .cse1 |c_~#full~0.base|) (bvadd |~#full~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ bv1 32)))))))))) (store .cse0 |c_~#__CS_thread_born_round~0.base| (store (select .cse0 |c_~#__CS_thread_born_round~0.base|) |~#__CS_thread_born_round~0.offset| ((_ sign_extend 24) v_~__CS_round~0_213)))) |c_~#__CS_thread_status~0.base| v_ArrVal_10619) |c_~#__CS_thread_allocated~0.base|) (bvadd |c_~#__CS_thread_allocated~0.offset| (_ bv2 32))))) (_ bv1 32)))) is different from false [2022-07-12 07:43:50,501 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10597 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m~0.offset| (_ BitVec 32)) (|~#full~0.offset| (_ BitVec 32)) (|~#num~0.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~i~0#1| (_ BitVec 32)) (|~#empty~0.offset| (_ BitVec 32)) (v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ BitVec 32)) (v_ArrVal_10216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10217 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~nondet83#1| (_ BitVec 8)) (|ULTIMATE.start_main_~j~2#1| (_ BitVec 32)) (v_~__CS_round~0_213 (_ BitVec 8)) (v_ArrVal_10605 (Array (_ BitVec 32) (_ BitVec 32))) (|~#__CS_thread_born_round~0.offset| (_ BitVec 32)) (v_ArrVal_10219 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store (store (store (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10216) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10217))) (store .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (bvadd (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) |ULTIMATE.start_main_~j~2#1| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset|) ((_ sign_extend 24) |ULTIMATE.start_main_#t~nondet83#1|)))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10219) |c_~#__CS_thread_status~0.base| v_ArrVal_10605) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_10597))) (store .cse4 |c_~#num~0.base| (store (select .cse4 |c_~#num~0.base|) (bvadd (_ bv4 32) |~#num~0.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.offset|))))))) (store .cse3 |c_~#m~0.base| (store (select .cse3 |c_~#m~0.base|) (bvadd (_ bv1 32) |~#m~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.offset| (_ bv1 32)))))))))) (store .cse2 |c_~#empty~0.base| (store (select .cse2 |c_~#empty~0.base|) (bvadd |~#empty~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ bv1 32)))))))))) (store .cse1 |c_~#full~0.base| (store (select .cse1 |c_~#full~0.base|) (bvadd |~#full~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ bv1 32)))))))))) (store .cse0 |c_~#__CS_thread_born_round~0.base| (store (select .cse0 |c_~#__CS_thread_born_round~0.base|) |~#__CS_thread_born_round~0.offset| ((_ sign_extend 24) v_~__CS_round~0_213)))) |c_~#__CS_thread_status~0.base| v_ArrVal_10619) |c_~#__CS_thread_allocated~0.base|) (bvadd |c_~#__CS_thread_allocated~0.offset| (_ bv2 32))))) (_ bv1 32)))) is different from false [2022-07-12 07:43:50,895 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10597 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m~0.offset| (_ BitVec 32)) (|~#full~0.offset| (_ BitVec 32)) (|~#num~0.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~i~0#1| (_ BitVec 32)) (|~#empty~0.offset| (_ BitVec 32)) (v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ BitVec 32)) (v_ArrVal_10216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10217 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~nondet83#1| (_ BitVec 8)) (v_ArrVal_10214 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~j~2#1| (_ BitVec 32)) (v_ArrVal_10215 (Array (_ BitVec 32) (_ BitVec 32))) (v_~__CS_round~0_213 (_ BitVec 8)) (v_ArrVal_10605 (Array (_ BitVec 32) (_ BitVec 32))) (|~#__CS_thread_born_round~0.offset| (_ BitVec 32)) (v_ArrVal_10219 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store (store (store (let ((.cse5 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10215) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10214) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10216) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10217))) (store .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (bvadd (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) |ULTIMATE.start_main_~j~2#1| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset|) ((_ sign_extend 24) |ULTIMATE.start_main_#t~nondet83#1|)))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10219) |c_~#__CS_thread_status~0.base| v_ArrVal_10605) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_10597))) (store .cse4 |c_~#num~0.base| (store (select .cse4 |c_~#num~0.base|) (bvadd (_ bv4 32) |~#num~0.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.offset|))))))) (store .cse3 |c_~#m~0.base| (store (select .cse3 |c_~#m~0.base|) (bvadd (_ bv1 32) |~#m~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.offset| (_ bv1 32)))))))))) (store .cse2 |c_~#empty~0.base| (store (select .cse2 |c_~#empty~0.base|) (bvadd |~#empty~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ bv1 32)))))))))) (store .cse1 |c_~#full~0.base| (store (select .cse1 |c_~#full~0.base|) (bvadd |~#full~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ bv1 32)))))))))) (store .cse0 |c_~#__CS_thread_born_round~0.base| (store (select .cse0 |c_~#__CS_thread_born_round~0.base|) |~#__CS_thread_born_round~0.offset| ((_ sign_extend 24) v_~__CS_round~0_213)))) |c_~#__CS_thread_status~0.base| v_ArrVal_10619) |c_~#__CS_thread_allocated~0.base|) (bvadd |c_~#__CS_thread_allocated~0.offset| (_ bv2 32))))) (_ bv1 32)))) is different from false [2022-07-12 07:43:51,384 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10212 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10597 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10210 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10211 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m~0.offset| (_ BitVec 32)) (|~#full~0.offset| (_ BitVec 32)) (|~#num~0.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~i~0#1| (_ BitVec 32)) (|~#empty~0.offset| (_ BitVec 32)) (v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ BitVec 32)) (v_ArrVal_10216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10217 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~nondet83#1| (_ BitVec 8)) (v_ArrVal_10214 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~j~2#1| (_ BitVec 32)) (v_ArrVal_10215 (Array (_ BitVec 32) (_ BitVec 32))) (v_~__CS_round~0_213 (_ BitVec 8)) (v_ArrVal_10605 (Array (_ BitVec 32) (_ BitVec 32))) (|~#__CS_thread_born_round~0.offset| (_ BitVec 32)) (v_ArrVal_10219 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store (store (store (let ((.cse5 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_10213) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_10211) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_10212) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_10210) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10215) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10214) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10216) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10217))) (store .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (bvadd (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) |ULTIMATE.start_main_~j~2#1| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset|) ((_ sign_extend 24) |ULTIMATE.start_main_#t~nondet83#1|)))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10219) |c_~#__CS_thread_status~0.base| v_ArrVal_10605) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_10597))) (store .cse4 |c_~#num~0.base| (store (select .cse4 |c_~#num~0.base|) (bvadd (_ bv4 32) |~#num~0.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.offset|))))))) (store .cse3 |c_~#m~0.base| (store (select .cse3 |c_~#m~0.base|) (bvadd (_ bv1 32) |~#m~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.offset| (_ bv1 32)))))))))) (store .cse2 |c_~#empty~0.base| (store (select .cse2 |c_~#empty~0.base|) (bvadd |~#empty~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ bv1 32)))))))))) (store .cse1 |c_~#full~0.base| (store (select .cse1 |c_~#full~0.base|) (bvadd |~#full~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ bv1 32)))))))))) (store .cse0 |c_~#__CS_thread_born_round~0.base| (store (select .cse0 |c_~#__CS_thread_born_round~0.base|) |~#__CS_thread_born_round~0.offset| ((_ sign_extend 24) v_~__CS_round~0_213)))) |c_~#__CS_thread_status~0.base| v_ArrVal_10619) |c_~#__CS_thread_allocated~0.base|) (bvadd |c_~#__CS_thread_allocated~0.offset| (_ bv2 32))))) (_ bv1 32)))) is different from false [2022-07-12 07:43:51,725 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10212 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10597 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10210 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10211 (Array (_ BitVec 32) (_ BitVec 32))) (|~#full~0.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ BitVec 32)) (|~#empty~0.offset| (_ BitVec 32)) (v_ArrVal_10209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10605 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10208 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m~0.offset| (_ BitVec 32)) (|~#num~0.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~i~0#1| (_ BitVec 32)) (v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ BitVec 32)) (v_ArrVal_10216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10217 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~nondet83#1| (_ BitVec 8)) (v_ArrVal_10214 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~j~2#1| (_ BitVec 32)) (v_ArrVal_10215 (Array (_ BitVec 32) (_ BitVec 32))) (v_~__CS_round~0_213 (_ BitVec 8)) (|~#__CS_thread_born_round~0.offset| (_ BitVec 32)) (v_ArrVal_10219 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store (store (store (let ((.cse5 (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_10209) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10208) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_10213) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_10211) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_10212) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_10210) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10215) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10214) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10216) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10217))) (store .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (bvadd (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) |ULTIMATE.start_main_~j~2#1| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset|) ((_ sign_extend 24) |ULTIMATE.start_main_#t~nondet83#1|)))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10219) |c_~#__CS_thread_status~0.base| v_ArrVal_10605) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_10597))) (store .cse4 |c_~#num~0.base| (store (select .cse4 |c_~#num~0.base|) (bvadd (_ bv4 32) |~#num~0.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.offset|))))))) (store .cse3 |c_~#m~0.base| (store (select .cse3 |c_~#m~0.base|) (bvadd (_ bv1 32) |~#m~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.offset| (_ bv1 32)))))))))) (store .cse2 |c_~#empty~0.base| (store (select .cse2 |c_~#empty~0.base|) (bvadd |~#empty~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ bv1 32)))))))))) (store .cse1 |c_~#full~0.base| (store (select .cse1 |c_~#full~0.base|) (bvadd |~#full~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ bv1 32)))))))))) (store .cse0 |c_~#__CS_thread_born_round~0.base| (store (select .cse0 |c_~#__CS_thread_born_round~0.base|) |~#__CS_thread_born_round~0.offset| ((_ sign_extend 24) v_~__CS_round~0_213)))) |c_~#__CS_thread_status~0.base| v_ArrVal_10619) |c_~#__CS_thread_allocated~0.base|) (bvadd |c_~#__CS_thread_allocated~0.offset| (_ bv2 32))))) (_ bv1 32)))) is different from false [2022-07-12 07:43:52,085 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10212 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10597 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10210 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10211 (Array (_ BitVec 32) (_ BitVec 32))) (|~#full~0.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ BitVec 32)) (|~#empty~0.offset| (_ BitVec 32)) (v_ArrVal_10206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10605 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10208 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m~0.offset| (_ BitVec 32)) (|~#num~0.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~i~0#1| (_ BitVec 32)) (v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ BitVec 32)) (v_ArrVal_10216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10217 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~nondet83#1| (_ BitVec 8)) (v_ArrVal_10214 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~j~2#1| (_ BitVec 32)) (v_ArrVal_10215 (Array (_ BitVec 32) (_ BitVec 32))) (v_~__CS_round~0_213 (_ BitVec 8)) (|~#__CS_thread_born_round~0.offset| (_ BitVec 32)) (v_ArrVal_10219 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store (store (store (let ((.cse5 (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_10206) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10207) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10209) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10208) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_10213) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_10211) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_10212) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_10210) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10215) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10214) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10216) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10217))) (store .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (bvadd (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) |ULTIMATE.start_main_~j~2#1| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset|) ((_ sign_extend 24) |ULTIMATE.start_main_#t~nondet83#1|)))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10219) |c_~#__CS_thread_status~0.base| v_ArrVal_10605) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_10597))) (store .cse4 |c_~#num~0.base| (store (select .cse4 |c_~#num~0.base|) (bvadd (_ bv4 32) |~#num~0.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.offset|))))))) (store .cse3 |c_~#m~0.base| (store (select .cse3 |c_~#m~0.base|) (bvadd (_ bv1 32) |~#m~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.offset| (_ bv1 32)))))))))) (store .cse2 |c_~#empty~0.base| (store (select .cse2 |c_~#empty~0.base|) (bvadd |~#empty~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ bv1 32)))))))))) (store .cse1 |c_~#full~0.base| (store (select .cse1 |c_~#full~0.base|) (bvadd |~#full~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ bv1 32)))))))))) (store .cse0 |c_~#__CS_thread_born_round~0.base| (store (select .cse0 |c_~#__CS_thread_born_round~0.base|) |~#__CS_thread_born_round~0.offset| ((_ sign_extend 24) v_~__CS_round~0_213)))) |c_~#__CS_thread_status~0.base| v_ArrVal_10619) |c_~#__CS_thread_allocated~0.base|) (bvadd |c_~#__CS_thread_allocated~0.offset| (_ bv2 32)))))))) is different from false [2022-07-12 07:43:52,346 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10212 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10597 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10210 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10211 (Array (_ BitVec 32) (_ BitVec 32))) (|~#full~0.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~j~2#1_32| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet83#1_8| (_ BitVec 8)) (|~#empty~0.offset| (_ BitVec 32)) (v_ArrVal_10206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10605 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10207 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (_ BitVec 32)) (v_ArrVal_10208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10202 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m~0.offset| (_ BitVec 32)) (|~#num~0.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~i~0#1_18| (_ BitVec 32)) (v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ BitVec 32)) (v_ArrVal_10216 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~nondet83#1| (_ BitVec 8)) (v_ArrVal_10217 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~j~2#1| (_ BitVec 32)) (v_ArrVal_10214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10215 (Array (_ BitVec 32) (_ BitVec 32))) (v_~__CS_round~0_213 (_ BitVec 8)) (|~#__CS_thread_born_round~0.offset| (_ BitVec 32)) (v_ArrVal_10219 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store (store (store (let ((.cse5 (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| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| |ULTIMATE.start_main_~j~2#1| (bvmul (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|)) ((_ sign_extend 24) |ULTIMATE.start_main_#t~nondet83#1|))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10202) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10206) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10207) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10209) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10208) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_10213) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_10211) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_10212) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_10210) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10215) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10214) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10216) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10217))) (store .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (bvmul (_ bv3 32) |v_ULTIMATE.start_main_~i~0#1_18|) |v_ULTIMATE.start_main_~j~2#1_32|) ((_ sign_extend 24) |v_ULTIMATE.start_main_#t~nondet83#1_8|)))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10219) |c_~#__CS_thread_status~0.base| v_ArrVal_10605) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_10597))) (store .cse4 |c_~#num~0.base| (store (select .cse4 |c_~#num~0.base|) (bvadd (_ bv4 32) |~#num~0.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.offset|))))))) (store .cse3 |c_~#m~0.base| (store (select .cse3 |c_~#m~0.base|) (bvadd (_ bv1 32) |~#m~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.offset| (_ bv1 32)))))))))) (store .cse2 |c_~#empty~0.base| (store (select .cse2 |c_~#empty~0.base|) (bvadd |~#empty~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ bv1 32)))))))))) (store .cse1 |c_~#full~0.base| (store (select .cse1 |c_~#full~0.base|) (bvadd |~#full~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ bv1 32)))))))))) (store .cse0 |c_~#__CS_thread_born_round~0.base| (store (select .cse0 |c_~#__CS_thread_born_round~0.base|) |~#__CS_thread_born_round~0.offset| ((_ sign_extend 24) v_~__CS_round~0_213)))) |c_~#__CS_thread_status~0.base| v_ArrVal_10619) |c_~#__CS_thread_allocated~0.base|) (bvadd |c_~#__CS_thread_allocated~0.offset| (_ bv2 32))))) (_ bv1 32)))) is different from false [2022-07-12 07:43:53,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10212 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10597 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10213 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| (_ BitVec 32)) (v_ArrVal_10210 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10211 (Array (_ BitVec 32) (_ BitVec 32))) (|~#full~0.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ BitVec 32)) (v_ArrVal_10190 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~j~2#1_32| (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet78#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet83#1_8| (_ BitVec 8)) (|~#empty~0.offset| (_ BitVec 32)) (v_ArrVal_10206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10605 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~nondet79#1| (_ BitVec 8)) (v_ArrVal_10207 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (_ BitVec 32)) (v_ArrVal_10208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10202 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m~0.offset| (_ BitVec 32)) (|~#num~0.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~i~0#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~i~0#1_18| (_ BitVec 32)) (v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ BitVec 32)) (v_ArrVal_10216 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~nondet83#1| (_ BitVec 8)) (v_ArrVal_10217 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~j~2#1| (_ BitVec 32)) (v_ArrVal_10214 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp_m~0#1.offset| (_ BitVec 32)) (v_ArrVal_10215 (Array (_ BitVec 32) (_ BitVec 32))) (v_~__CS_round~0_213 (_ BitVec 8)) (|~#__CS_thread_born_round~0.offset| (_ BitVec 32)) (v_ArrVal_10219 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store (store (store (let ((.cse5 (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse6 (store (store (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)) |ULTIMATE.start_main_#t~nondet78#1|)))) (store .cse7 |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~#__CS_cp_m~0#1.offset|) ((_ sign_extend 24) |ULTIMATE.start_main_#t~nondet79#1|)))) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_10190) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_10196))) (store .cse6 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) |ULTIMATE.start_main_~j~2#1|) ((_ sign_extend 24) |ULTIMATE.start_main_#t~nondet83#1|)))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10202) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10206) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10207) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10209) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10208) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_10213) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_10211) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_10212) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_10210) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10215) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10214) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10216) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10217))) (store .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (bvmul (_ bv3 32) |v_ULTIMATE.start_main_~i~0#1_18|) |v_ULTIMATE.start_main_~j~2#1_32|) ((_ sign_extend 24) |v_ULTIMATE.start_main_#t~nondet83#1_8|)))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10219) |c_~#__CS_thread_status~0.base| v_ArrVal_10605) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_10597))) (store .cse4 |c_~#num~0.base| (store (select .cse4 |c_~#num~0.base|) (bvadd (_ bv4 32) |~#num~0.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset|))))))) (store .cse3 |c_~#m~0.base| (store (select .cse3 |c_~#m~0.base|) (bvadd (_ bv1 32) |~#m~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_m~0#1.offset| (_ bv1 32)))))))))) (store .cse2 |c_~#empty~0.base| (store (select .cse2 |c_~#empty~0.base|) (bvadd |~#empty~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ bv1 32)))))))))) (store .cse1 |c_~#full~0.base| (store (select .cse1 |c_~#full~0.base|) (bvadd |~#full~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ bv1 32)))))))))) (store .cse0 |c_~#__CS_thread_born_round~0.base| (store (select .cse0 |c_~#__CS_thread_born_round~0.base|) |~#__CS_thread_born_round~0.offset| ((_ sign_extend 24) v_~__CS_round~0_213)))) |c_~#__CS_thread_status~0.base| v_ArrVal_10619) |c_~#__CS_thread_allocated~0.base|) (bvadd |c_~#__CS_thread_allocated~0.offset| (_ bv2 32))))) (_ bv1 32)))) is different from false [2022-07-12 07:44:04,945 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10212 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10597 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10213 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| (_ BitVec 32)) (v_ArrVal_10210 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base_12| (_ BitVec 32)) (v_ArrVal_10211 (Array (_ BitVec 32) (_ BitVec 32))) (|~#full~0.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ BitVec 32)) (v_ArrVal_10190 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~j~2#1_32| (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet78#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet83#1_8| (_ BitVec 8)) (|~#empty~0.offset| (_ BitVec 32)) (v_ArrVal_10169 (_ BitVec 1)) (v_ArrVal_10206 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#__CS_cp_full~0#1.base_10| (_ BitVec 32)) (v_ArrVal_10209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10605 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~nondet79#1| (_ BitVec 8)) (v_ArrVal_10207 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (_ BitVec 32)) (v_ArrVal_10208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10202 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m~0.offset| (_ BitVec 32)) (|~#num~0.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~i~0#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~i~0#1_18| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#__CS_cp_m~0#1.base_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#__CS_cp_num~0#1.base_10| (_ BitVec 32)) (v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base_10| (_ BitVec 32)) (|ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ BitVec 32)) (v_ArrVal_10216 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~nondet83#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base_12| (_ BitVec 32)) (v_ArrVal_10217 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~j~2#1| (_ BitVec 32)) (v_ArrVal_10214 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp_m~0#1.offset| (_ BitVec 32)) (v_ArrVal_10215 (Array (_ BitVec 32) (_ BitVec 32))) (v_~__CS_round~0_213 (_ BitVec 8)) (|~#__CS_thread_born_round~0.offset| (_ BitVec 32)) (v_ArrVal_10219 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base_12| (_ bv1 1)))) (let ((.cse9 (store .cse0 |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base_12| (_ bv1 1)))) (let ((.cse10 (store .cse9 |v_ULTIMATE.start_main_~#__CS_cp_num~0#1.base_10| (_ bv1 1)))) (let ((.cse11 (store .cse10 |v_ULTIMATE.start_main_~#__CS_cp_m~0#1.base_10| (_ bv1 1)))) (or (not (= (_ bv0 1) (bvneg (select .cse0 |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base_12|)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store (store (store (let ((.cse6 (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse7 (store (store (let ((.cse8 (store |c_#memory_int| |v_ULTIMATE.start_main_~#__CS_cp_num~0#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_main_~#__CS_cp_num~0#1.base_10|) (bvadd |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)) |ULTIMATE.start_main_#t~nondet78#1|)))) (store .cse8 |v_ULTIMATE.start_main_~#__CS_cp_m~0#1.base_10| (store (select .cse8 |v_ULTIMATE.start_main_~#__CS_cp_m~0#1.base_10|) (bvadd |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~#__CS_cp_m~0#1.offset|) ((_ sign_extend 24) |ULTIMATE.start_main_#t~nondet79#1|)))) |v_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base_10| v_ArrVal_10190) |v_ULTIMATE.start_main_~#__CS_cp_full~0#1.base_10| v_ArrVal_10196))) (store .cse7 |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base_12| (store (select .cse7 |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base_12|) (bvadd |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) |ULTIMATE.start_main_~j~2#1|) ((_ sign_extend 24) |ULTIMATE.start_main_#t~nondet83#1|)))) |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base_12| v_ArrVal_10202) |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base_12| v_ArrVal_10206) |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base_12| v_ArrVal_10207) |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base_12| v_ArrVal_10209) |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base_12| v_ArrVal_10208) |v_ULTIMATE.start_main_~#__CS_cp_num~0#1.base_10| v_ArrVal_10213) |v_ULTIMATE.start_main_~#__CS_cp_m~0#1.base_10| v_ArrVal_10211) |v_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base_10| v_ArrVal_10212) |v_ULTIMATE.start_main_~#__CS_cp_full~0#1.base_10| v_ArrVal_10210) |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base_12| v_ArrVal_10215) |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base_12| v_ArrVal_10214) |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base_12| v_ArrVal_10216) |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base_12| v_ArrVal_10217))) (store .cse6 |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base_12| (store (select .cse6 |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base_12|) (bvadd |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (bvmul (_ bv3 32) |v_ULTIMATE.start_main_~i~0#1_18|) |v_ULTIMATE.start_main_~j~2#1_32|) ((_ sign_extend 24) |v_ULTIMATE.start_main_#t~nondet83#1_8|)))) |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base_12| v_ArrVal_10219) |c_~#__CS_thread_status~0.base| v_ArrVal_10605) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_10597))) (store .cse5 |c_~#num~0.base| (store (select .cse5 |c_~#num~0.base|) (bvadd (_ bv4 32) |~#num~0.offset|) (select (select .cse5 |v_ULTIMATE.start_main_~#__CS_cp_num~0#1.base_10|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset|))))))) (store .cse4 |c_~#m~0.base| (store (select .cse4 |c_~#m~0.base|) (bvadd (_ bv1 32) |~#m~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |v_ULTIMATE.start_main_~#__CS_cp_m~0#1.base_10|) (bvadd |ULTIMATE.start_main_~#__CS_cp_m~0#1.offset| (_ bv1 32)))))))))) (store .cse3 |c_~#empty~0.base| (store (select .cse3 |c_~#empty~0.base|) (bvadd |~#empty~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |v_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base_10|) (bvadd |ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ bv1 32)))))))))) (store .cse2 |c_~#full~0.base| (store (select .cse2 |c_~#full~0.base|) (bvadd |~#full~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |v_ULTIMATE.start_main_~#__CS_cp_full~0#1.base_10|) (bvadd |ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ bv1 32)))))))))) (store .cse1 |c_~#__CS_thread_born_round~0.base| (store (select .cse1 |c_~#__CS_thread_born_round~0.base|) |~#__CS_thread_born_round~0.offset| ((_ sign_extend 24) v_~__CS_round~0_213)))) |c_~#__CS_thread_status~0.base| v_ArrVal_10619) |c_~#__CS_thread_allocated~0.base|) (bvadd |c_~#__CS_thread_allocated~0.offset| (_ bv2 32))))) (_ bv1 32))) (not (= (_ bv0 1) (bvneg (bvneg (select .cse9 |v_ULTIMATE.start_main_~#__CS_cp_num~0#1.base_10|))))) (not (= (bvneg (select .cse10 |v_ULTIMATE.start_main_~#__CS_cp_m~0#1.base_10|)) (_ bv0 1))) (not (= (select .cse11 |v_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base_10|) (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base_12|))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select (store .cse11 |v_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base_10| v_ArrVal_10169) |v_ULTIMATE.start_main_~#__CS_cp_full~0#1.base_10|)))))))))))) is different from false [2022-07-12 07:44:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 852 trivial. 47 not checked. [2022-07-12 07:44:05,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 07:44:05,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986482976] [2022-07-12 07:44:05,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986482976] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 07:44:05,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 07:44:05,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 25 [2022-07-12 07:44:05,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113765409] [2022-07-12 07:44:05,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 07:44:05,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 07:44:05,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 07:44:05,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 07:44:05,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=10, NotChecked=350, Total=600 [2022-07-12 07:44:05,139 INFO L87 Difference]: Start difference. First operand 1329 states and 2116 transitions. Second operand has 25 states, 25 states have (on average 6.2) internal successors, (155), 25 states have internal predecessors, (155), 7 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 7 states have call predecessors, (44), 7 states have call successors, (44) [2022-07-12 07:44:10,276 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_~#__CS_thread_allocated~0.base| (_ bv3 32)) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |c_#memory_int| |c_~#__CS_thread_allocated~0.base|) (bvadd |c_~#__CS_thread_allocated~0.offset| (_ bv2 32)))) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| (_ bv3 32))) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (_ bv3 32))) (= |c_~#empty~0.base| (_ bv9 32)) (forall ((v_ArrVal_10212 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10597 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10210 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10211 (Array (_ BitVec 32) (_ BitVec 32))) (|~#full~0.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ BitVec 32)) (|~#empty~0.offset| (_ BitVec 32)) (v_ArrVal_10206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10605 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10208 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m~0.offset| (_ BitVec 32)) (|~#num~0.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~i~0#1| (_ BitVec 32)) (v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ BitVec 32)) (v_ArrVal_10216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10217 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~nondet83#1| (_ BitVec 8)) (v_ArrVal_10214 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~j~2#1| (_ BitVec 32)) (v_ArrVal_10215 (Array (_ BitVec 32) (_ BitVec 32))) (v_~__CS_round~0_213 (_ BitVec 8)) (|~#__CS_thread_born_round~0.offset| (_ BitVec 32)) (v_ArrVal_10219 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store (store (store (let ((.cse5 (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_10206) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10207) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10209) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10208) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_10213) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_10211) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_10212) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_10210) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10215) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10214) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10216) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10217))) (store .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (bvadd (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) |ULTIMATE.start_main_~j~2#1| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset|) ((_ sign_extend 24) |ULTIMATE.start_main_#t~nondet83#1|)))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10219) |c_~#__CS_thread_status~0.base| v_ArrVal_10605) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_10597))) (store .cse4 |c_~#num~0.base| (store (select .cse4 |c_~#num~0.base|) (bvadd (_ bv4 32) |~#num~0.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.offset|))))))) (store .cse3 |c_~#m~0.base| (store (select .cse3 |c_~#m~0.base|) (bvadd (_ bv1 32) |~#m~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.offset| (_ bv1 32)))))))))) (store .cse2 |c_~#empty~0.base| (store (select .cse2 |c_~#empty~0.base|) (bvadd |~#empty~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ bv1 32)))))))))) (store .cse1 |c_~#full~0.base| (store (select .cse1 |c_~#full~0.base|) (bvadd |~#full~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ bv1 32)))))))))) (store .cse0 |c_~#__CS_thread_born_round~0.base| (store (select .cse0 |c_~#__CS_thread_born_round~0.base|) |~#__CS_thread_born_round~0.offset| ((_ sign_extend 24) v_~__CS_round~0_213)))) |c_~#__CS_thread_status~0.base| v_ArrVal_10619) |c_~#__CS_thread_allocated~0.base|) (bvadd |c_~#__CS_thread_allocated~0.offset| (_ bv2 32)))))))) (exists ((|v_ULTIMATE.start_main_#t~nondet79#1_6| (_ BitVec 8)) (|ULTIMATE.start_main_~i~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~j~2#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet83#1_6| (_ BitVec 8))) (and (= ((_ sign_extend 24) |v_ULTIMATE.start_main_#t~nondet79#1_6|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.offset| |ULTIMATE.start_main_~i~0#1|))) (= ((_ sign_extend 24) |v_ULTIMATE.start_main_#t~nondet83#1_6|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (bvadd (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) |ULTIMATE.start_main_~j~2#1| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset|))))) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| (_ bv3 32))) (= |c_~#full~0.base| (_ bv10 32)) (not (= |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|)) (= |c_~#__CS_thread_status~0.base| (_ bv5 32)) (= (_ bv7 32) |c_~#num~0.base|) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|)) (= |c_~#__CS_thread_lockedon~0.base| (_ bv6 32)) (not (= (_ bv3 32) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|)) (not (= (_ bv3 32) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|)) (= |c_~#__CS_thread_born_round~0.base| (_ bv4 32)) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|)) (not (= (_ bv3 32) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|)) (= (_ bv8 32) |c_~#m~0.base|) (not (= |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|))) is different from true [2022-07-12 07:44:15,637 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_~#__CS_thread_allocated~0.base| (_ bv3 32)) (forall ((v_ArrVal_10212 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10597 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10210 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10211 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m~0.offset| (_ BitVec 32)) (|~#full~0.offset| (_ BitVec 32)) (|~#num~0.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~i~0#1| (_ BitVec 32)) (|~#empty~0.offset| (_ BitVec 32)) (v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ BitVec 32)) (v_ArrVal_10216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10217 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~nondet83#1| (_ BitVec 8)) (v_ArrVal_10214 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~j~2#1| (_ BitVec 32)) (v_ArrVal_10215 (Array (_ BitVec 32) (_ BitVec 32))) (v_~__CS_round~0_213 (_ BitVec 8)) (v_ArrVal_10605 (Array (_ BitVec 32) (_ BitVec 32))) (|~#__CS_thread_born_round~0.offset| (_ BitVec 32)) (v_ArrVal_10219 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (select (select (store (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store (store (store (let ((.cse5 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_10213) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_10211) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_10212) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_10210) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10215) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10214) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_10216) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10217))) (store .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (bvadd (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) |ULTIMATE.start_main_~j~2#1| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset|) ((_ sign_extend 24) |ULTIMATE.start_main_#t~nondet83#1|)))) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_10219) |c_~#__CS_thread_status~0.base| v_ArrVal_10605) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_10597))) (store .cse4 |c_~#num~0.base| (store (select .cse4 |c_~#num~0.base|) (bvadd (_ bv4 32) |~#num~0.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.offset|))))))) (store .cse3 |c_~#m~0.base| (store (select .cse3 |c_~#m~0.base|) (bvadd (_ bv1 32) |~#m~0.offset|) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.offset| (_ bv1 32)))))))))) (store .cse2 |c_~#empty~0.base| (store (select .cse2 |c_~#empty~0.base|) (bvadd |~#empty~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse2 |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_empty~0#1.offset| (_ bv1 32)))))))))) (store .cse1 |c_~#full~0.base| (store (select .cse1 |c_~#full~0.base|) (bvadd |~#full~0.offset| (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp_full~0#1.offset| (_ bv1 32)))))))))) (store .cse0 |c_~#__CS_thread_born_round~0.base| (store (select .cse0 |c_~#__CS_thread_born_round~0.base|) |~#__CS_thread_born_round~0.offset| ((_ sign_extend 24) v_~__CS_round~0_213)))) |c_~#__CS_thread_status~0.base| v_ArrVal_10619) |c_~#__CS_thread_allocated~0.base|) (bvadd |c_~#__CS_thread_allocated~0.offset| (_ bv2 32))))) (_ bv1 32)))) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |c_#memory_int| |c_~#__CS_thread_allocated~0.base|) (bvadd |c_~#__CS_thread_allocated~0.offset| (_ bv2 32)))) (exists ((|v_ULTIMATE.start_main_#t~nondet79#1_6| (_ BitVec 8)) (|ULTIMATE.start_main_~i~0#1| (_ BitVec 32))) (= ((_ sign_extend 24) |v_ULTIMATE.start_main_#t~nondet79#1_6|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.offset| |ULTIMATE.start_main_~i~0#1|)))) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| (_ bv3 32))) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (_ bv3 32))) (= |c_~#empty~0.base| (_ bv9 32)) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| (_ bv3 32))) (= |c_~#full~0.base| (_ bv10 32)) (exists ((|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~i~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~j~2#1| (_ BitVec 32)) (|ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet83#1_7| (_ BitVec 8))) (and (not (= (_ bv3 32) |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|)) (= ((_ sign_extend 24) |v_ULTIMATE.start_main_#t~nondet83#1_7|) (select (select |c_#memory_int| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|) (bvadd |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.offset| (bvmul |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) |ULTIMATE.start_main_~j~2#1|))) (not (= |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| |ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|)))) (not (= |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|)) (= |c_~#__CS_thread_status~0.base| (_ bv5 32)) (= (_ bv7 32) |c_~#num~0.base|) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|)) (= |c_~#__CS_thread_lockedon~0.base| (_ bv6 32)) (not (= (_ bv3 32) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|)) (not (= (_ bv3 32) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base|)) (= |c_~#__CS_thread_born_round~0.base| (_ bv4 32)) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|)) (not (= (_ bv3 32) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base|)) (= (_ bv8 32) |c_~#m~0.base|) (not (= |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|))) is different from true [2022-07-12 07:44:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:44:19,427 INFO L93 Difference]: Finished difference Result 2085 states and 3185 transitions. [2022-07-12 07:44:19,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 07:44:19,428 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.2) internal successors, (155), 25 states have internal predecessors, (155), 7 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 7 states have call predecessors, (44), 7 states have call successors, (44) Word has length 221 [2022-07-12 07:44:19,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:44:19,435 INFO L225 Difference]: With dead ends: 2085 [2022-07-12 07:44:19,435 INFO L226 Difference]: Without dead ends: 1485 [2022-07-12 07:44:19,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 422 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 12 IntricatePredicates, 1 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=173, Invalid=369, Unknown=12, NotChecked=636, Total=1190 [2022-07-12 07:44:19,438 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 279 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 4513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3725 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-12 07:44:19,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1230 Invalid, 4513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 673 Invalid, 0 Unknown, 3725 Unchecked, 2.8s Time] [2022-07-12 07:44:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2022-07-12 07:44:19,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1395. [2022-07-12 07:44:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 955 states have (on average 1.2795811518324607) internal successors, (1222), 857 states have internal predecessors, (1222), 345 states have call successors, (345), 52 states have call predecessors, (345), 94 states have return successors, (642), 485 states have call predecessors, (642), 345 states have call successors, (642) [2022-07-12 07:44:19,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 2209 transitions. [2022-07-12 07:44:19,511 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 2209 transitions. Word has length 221 [2022-07-12 07:44:19,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:44:19,511 INFO L495 AbstractCegarLoop]: Abstraction has 1395 states and 2209 transitions. [2022-07-12 07:44:19,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.2) internal successors, (155), 25 states have internal predecessors, (155), 7 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 7 states have call predecessors, (44), 7 states have call successors, (44) [2022-07-12 07:44:19,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 2209 transitions. [2022-07-12 07:44:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-12 07:44:19,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:44:19,516 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:44:19,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-12 07:44:19,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 07:44:19,730 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:44:19,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:44:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1068125724, now seen corresponding path program 1 times [2022-07-12 07:44:19,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 07:44:19,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380332886] [2022-07-12 07:44:19,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:44:19,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 07:44:19,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 07:44:19,732 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 07:44:19,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 07:44:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:44:21,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 1643 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 07:44:21,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:44:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2022-07-12 07:44:21,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:44:21,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 07:44:21,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380332886] [2022-07-12 07:44:21,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380332886] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:44:21,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:44:21,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 07:44:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360958961] [2022-07-12 07:44:21,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:44:21,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 07:44:21,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 07:44:21,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 07:44:21,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 07:44:21,298 INFO L87 Difference]: Start difference. First operand 1395 states and 2209 transitions. Second operand has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-12 07:44:23,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:44:23,537 INFO L93 Difference]: Finished difference Result 2953 states and 4750 transitions. [2022-07-12 07:44:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 07:44:23,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) Word has length 221 [2022-07-12 07:44:23,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:44:23,548 INFO L225 Difference]: With dead ends: 2953 [2022-07-12 07:44:23,548 INFO L226 Difference]: Without dead ends: 1592 [2022-07-12 07:44:23,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-12 07:44:23,556 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 254 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 07:44:23,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 917 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-12 07:44:23,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2022-07-12 07:44:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1542. [2022-07-12 07:44:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1050 states have (on average 1.1457142857142857) internal successors, (1203), 957 states have internal predecessors, (1203), 386 states have call successors, (386), 57 states have call predecessors, (386), 105 states have return successors, (757), 527 states have call predecessors, (757), 386 states have call successors, (757) [2022-07-12 07:44:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2346 transitions. [2022-07-12 07:44:23,658 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2346 transitions. Word has length 221 [2022-07-12 07:44:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:44:23,658 INFO L495 AbstractCegarLoop]: Abstraction has 1542 states and 2346 transitions. [2022-07-12 07:44:23,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-12 07:44:23,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2346 transitions. [2022-07-12 07:44:23,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-12 07:44:23,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:44:23,663 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:44:23,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-12 07:44:23,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 07:44:23,889 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:44:23,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:44:23,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2008452116, now seen corresponding path program 1 times [2022-07-12 07:44:23,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 07:44:23,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099797319] [2022-07-12 07:44:23,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:44:23,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 07:44:23,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 07:44:23,891 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 07:44:23,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 07:44:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:44:26,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 1636 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 07:44:26,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:44:27,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-07-12 07:44:27,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 07:44:27,266 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:44:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 400 proven. 5 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2022-07-12 07:44:27,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:44:27,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-12 07:44:27,674 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2022-07-12 07:44:27,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 07:44:27,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099797319] [2022-07-12 07:44:27,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099797319] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 07:44:27,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 07:44:27,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-07-12 07:44:27,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715244106] [2022-07-12 07:44:27,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 07:44:27,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 07:44:27,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 07:44:27,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 07:44:27,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 07:44:27,676 INFO L87 Difference]: Start difference. First operand 1542 states and 2346 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 7 states have call successors, (33), 4 states have call predecessors, (33), 5 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-07-12 07:44:29,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:44:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:44:32,270 INFO L93 Difference]: Finished difference Result 3036 states and 4553 transitions. [2022-07-12 07:44:32,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 07:44:32,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 7 states have call successors, (33), 4 states have call predecessors, (33), 5 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) Word has length 221 [2022-07-12 07:44:32,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:44:32,277 INFO L225 Difference]: With dead ends: 3036 [2022-07-12 07:44:32,277 INFO L226 Difference]: Without dead ends: 1397 [2022-07-12 07:44:32,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-12 07:44:32,284 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 632 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 402 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-12 07:44:32,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 769 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 549 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-07-12 07:44:32,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2022-07-12 07:44:32,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1328. [2022-07-12 07:44:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 909 states have (on average 1.1507150715071508) internal successors, (1046), 840 states have internal predecessors, (1046), 322 states have call successors, (322), 55 states have call predecessors, (322), 96 states have return successors, (591), 432 states have call predecessors, (591), 322 states have call successors, (591) [2022-07-12 07:44:32,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1959 transitions. [2022-07-12 07:44:32,342 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1959 transitions. Word has length 221 [2022-07-12 07:44:32,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:44:32,342 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 1959 transitions. [2022-07-12 07:44:32,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 7 states have call successors, (33), 4 states have call predecessors, (33), 5 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-07-12 07:44:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1959 transitions. [2022-07-12 07:44:32,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-12 07:44:32,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:44:32,346 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:44:32,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 07:44:32,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 07:44:32,572 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:44:32,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:44:32,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1032257057, now seen corresponding path program 1 times [2022-07-12 07:44:32,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 07:44:32,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512583417] [2022-07-12 07:44:32,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:44:32,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 07:44:32,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 07:44:32,574 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 07:44:32,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 07:44:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:44:41,320 WARN L261 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 852 conjunts are in the unsatisfiable core [2022-07-12 07:44:41,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:44:41,993 INFO L356 Elim1Store]: treesize reduction 240, result has 33.5 percent of original size [2022-07-12 07:44:41,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 10 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 137 treesize of output 235 [2022-07-12 07:44:43,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 07:44:43,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 27 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2022-07-12 07:44:43,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 19 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 07:44:45,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-12 07:44:45,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 19 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2022-07-12 07:44:47,426 INFO L356 Elim1Store]: treesize reduction 39, result has 29.1 percent of original size [2022-07-12 07:44:47,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 50 [2022-07-12 07:44:47,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 19 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47