./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 791161d1 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-?-791161d [2022-07-22 18:59:16,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 18:59:16,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 18:59:16,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 18:59:16,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 18:59:16,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 18:59:16,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 18:59:16,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 18:59:16,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 18:59:16,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 18:59:16,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 18:59:16,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 18:59:16,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 18:59:16,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 18:59:16,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 18:59:16,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 18:59:16,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 18:59:16,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 18:59:16,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 18:59:16,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 18:59:16,355 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 18:59:16,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 18:59:16,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 18:59:16,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 18:59:16,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 18:59:16,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 18:59:16,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 18:59:16,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 18:59:16,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 18:59:16,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 18:59:16,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 18:59:16,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 18:59:16,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 18:59:16,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 18:59:16,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 18:59:16,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 18:59:16,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 18:59:16,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 18:59:16,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 18:59:16,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 18:59:16,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 18:59:16,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 18:59:16,371 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 18:59:16,392 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 18:59:16,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 18:59:16,393 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 18:59:16,393 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 18:59:16,393 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 18:59:16,394 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 18:59:16,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 18:59:16,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 18:59:16,394 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 18:59:16,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 18:59:16,395 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 18:59:16,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 18:59:16,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 18:59:16,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 18:59:16,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 18:59:16,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 18:59:16,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 18:59:16,396 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 18:59:16,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 18:59:16,396 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 18:59:16,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 18:59:16,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 18:59:16,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 18:59:16,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 18:59:16,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 18:59:16,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 18:59:16,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 18:59:16,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 18:59:16,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 18:59:16,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 18:59:16,398 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 18:59:16,398 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 18:59:16,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 18:59:16,398 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-22 18:59:16,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 18:59:16,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 18:59:16,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 18:59:16,632 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 18:59:16,632 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 18:59:16,633 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-22 18:59:16,697 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c42b15b1e/22b2921393b343fa957715f4a12c309c/FLAGe3a2226c3 [2022-07-22 18:59:17,119 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 18:59:17,119 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i [2022-07-22 18:59:17,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c42b15b1e/22b2921393b343fa957715f4a12c309c/FLAGe3a2226c3 [2022-07-22 18:59:17,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c42b15b1e/22b2921393b343fa957715f4a12c309c [2022-07-22 18:59:17,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 18:59:17,158 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 18:59:17,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 18:59:17,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 18:59:17,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 18:59:17,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 06:59:17" (1/1) ... [2022-07-22 18:59:17,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19f08d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:17, skipping insertion in model container [2022-07-22 18:59:17,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 06:59:17" (1/1) ... [2022-07-22 18:59:17,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 18:59:17,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 18:59:17,435 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-22 18:59:17,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 18:59:17,519 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 18:59:17,536 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-22 18:59:17,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 18:59:17,609 INFO L208 MainTranslator]: Completed translation [2022-07-22 18:59:17,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:17 WrapperNode [2022-07-22 18:59:17,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 18:59:17,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 18:59:17,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 18:59:17,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 18:59:17,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:17" (1/1) ... [2022-07-22 18:59:17,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:17" (1/1) ... [2022-07-22 18:59:17,701 INFO L137 Inliner]: procedures = 245, calls = 244, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 544 [2022-07-22 18:59:17,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 18:59:17,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 18:59:17,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 18:59:17,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 18:59:17,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:17" (1/1) ... [2022-07-22 18:59:17,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:17" (1/1) ... [2022-07-22 18:59:17,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:17" (1/1) ... [2022-07-22 18:59:17,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:17" (1/1) ... [2022-07-22 18:59:17,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:17" (1/1) ... [2022-07-22 18:59:17,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:17" (1/1) ... [2022-07-22 18:59:17,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:17" (1/1) ... [2022-07-22 18:59:17,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 18:59:17,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 18:59:17,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 18:59:17,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 18:59:17,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:17" (1/1) ... [2022-07-22 18:59:17,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 18:59:17,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 18:59:17,808 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-22 18:59:17,817 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-22 18:59:17,847 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 18:59:17,847 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 18:59:17,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 18:59:17,847 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_signal [2022-07-22 18:59:17,847 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_signal [2022-07-22 18:59:17,848 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-22 18:59:17,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-22 18:59:17,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 18:59:17,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 18:59:17,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 18:59:17,848 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-22 18:59:17,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-22 18:59:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 18:59:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_init [2022-07-22 18:59:17,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_init [2022-07-22 18:59:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 18:59:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 18:59:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 18:59:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-22 18:59:17,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-22 18:59:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_wait [2022-07-22 18:59:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_wait [2022-07-22 18:59:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-22 18:59:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-22 18:59:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-22 18:59:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-22 18:59:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-22 18:59:17,851 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-22 18:59:17,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 18:59:17,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 18:59:17,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 18:59:17,991 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 18:59:17,992 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 18:59:18,258 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !(0 != ~__CS_ret~0 % 256); [2022-07-22 18:59:18,258 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-22 18:59:18,259 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !(0 != ~__CS_ret~0 % 256); [2022-07-22 18:59:18,259 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-22 18:59:18,260 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: SUMMARY for call __CS_cs(); srcloc: null [2022-07-22 18:59:18,260 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-22 18:59:18,260 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume !(0 != ~__CS_ret~0 % 256); [2022-07-22 18:59:20,521 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 18:59:20,526 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 18:59:20,527 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-22 18:59:20,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 06:59:20 BoogieIcfgContainer [2022-07-22 18:59:20,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 18:59:20,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 18:59:20,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 18:59:20,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 18:59:20,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 06:59:17" (1/3) ... [2022-07-22 18:59:20,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e12b363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 06:59:20, skipping insertion in model container [2022-07-22 18:59:20,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:17" (2/3) ... [2022-07-22 18:59:20,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e12b363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 06:59:20, skipping insertion in model container [2022-07-22 18:59:20,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 06:59:20" (3/3) ... [2022-07-22 18:59:20,534 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_sync.i [2022-07-22 18:59:20,543 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 18:59:20,543 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 18:59:20,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 18:59:20,580 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@7ee6a694, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@283d13e9 [2022-07-22 18:59:20,580 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 18:59:20,585 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-22 18:59:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 18:59:20,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:20,604 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-22 18:59:20,605 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:20,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:20,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1902090431, now seen corresponding path program 1 times [2022-07-22 18:59:20,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:20,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084572607] [2022-07-22 18:59:20,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:20,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 18:59:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 18:59:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 18:59:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 18:59:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 18:59:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 18:59:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 18:59:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 18:59:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-22 18:59:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 18:59:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,052 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-22 18:59:21,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:21,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084572607] [2022-07-22 18:59:21,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084572607] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 18:59:21,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 18:59:21,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 18:59:21,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190793770] [2022-07-22 18:59:21,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 18:59:21,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 18:59:21,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:21,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 18:59:21,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 18:59:21,078 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-22 18:59:21,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:21,142 INFO L93 Difference]: Finished difference Result 390 states and 641 transitions. [2022-07-22 18:59:21,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 18:59:21,145 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-22 18:59:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:21,152 INFO L225 Difference]: With dead ends: 390 [2022-07-22 18:59:21,152 INFO L226 Difference]: Without dead ends: 194 [2022-07-22 18:59:21,157 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-22 18:59:21,159 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-22 18:59:21,160 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-22 18:59:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-22 18:59:21,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2022-07-22 18:59:21,216 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-22 18:59:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 285 transitions. [2022-07-22 18:59:21,223 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 285 transitions. Word has length 72 [2022-07-22 18:59:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:21,224 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 285 transitions. [2022-07-22 18:59:21,225 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-22 18:59:21,226 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 285 transitions. [2022-07-22 18:59:21,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-22 18:59:21,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:21,233 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-22 18:59:21,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 18:59:21,233 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:21,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:21,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1569921272, now seen corresponding path program 1 times [2022-07-22 18:59:21,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:21,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387250005] [2022-07-22 18:59:21,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:21,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 18:59:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 18:59:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 18:59:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 18:59:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 18:59:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 18:59:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 18:59:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-22 18:59:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 18:59:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 18:59:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,481 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-22 18:59:21,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:21,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387250005] [2022-07-22 18:59:21,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387250005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 18:59:21,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 18:59:21,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 18:59:21,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594915854] [2022-07-22 18:59:21,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 18:59:21,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 18:59:21,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:21,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 18:59:21,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 18:59:21,485 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-22 18:59:21,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:21,542 INFO L93 Difference]: Finished difference Result 381 states and 570 transitions. [2022-07-22 18:59:21,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 18:59:21,543 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-22 18:59:21,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:21,547 INFO L225 Difference]: With dead ends: 381 [2022-07-22 18:59:21,550 INFO L226 Difference]: Without dead ends: 193 [2022-07-22 18:59:21,551 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-22 18:59:21,552 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-22 18:59:21,552 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-22 18:59:21,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-22 18:59:21,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2022-07-22 18:59:21,562 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-22 18:59:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 286 transitions. [2022-07-22 18:59:21,564 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 286 transitions. Word has length 75 [2022-07-22 18:59:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:21,565 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 286 transitions. [2022-07-22 18:59:21,566 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-22 18:59:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 286 transitions. [2022-07-22 18:59:21,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-22 18:59:21,569 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:21,569 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-22 18:59:21,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 18:59:21,570 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:21,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:21,570 INFO L85 PathProgramCache]: Analyzing trace with hash 217866074, now seen corresponding path program 1 times [2022-07-22 18:59:21,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:21,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741215274] [2022-07-22 18:59:21,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:21,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 18:59:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 18:59:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 18:59:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 18:59:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 18:59:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 18:59:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 18:59:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 18:59:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 18:59:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-22 18:59:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:21,744 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-22 18:59:21,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:21,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741215274] [2022-07-22 18:59:21,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741215274] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 18:59:21,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015036333] [2022-07-22 18:59:21,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:21,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 18:59:21,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 18:59:21,752 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-22 18:59:21,753 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-22 18:59:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:22,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 1763 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 18:59:22,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 18:59:22,365 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-22 18:59:22,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 18:59:22,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-22 18:59:22,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015036333] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 18:59:22,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 18:59:22,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-22 18:59:22,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619995070] [2022-07-22 18:59:22,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 18:59:22,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 18:59:22,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:22,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 18:59:22,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-22 18:59:22,416 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-22 18:59:22,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:22,460 INFO L93 Difference]: Finished difference Result 385 states and 575 transitions. [2022-07-22 18:59:22,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 18:59:22,461 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-22 18:59:22,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:22,463 INFO L225 Difference]: With dead ends: 385 [2022-07-22 18:59:22,464 INFO L226 Difference]: Without dead ends: 196 [2022-07-22 18:59:22,466 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-22 18:59:22,467 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-22 18:59:22,467 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-22 18:59:22,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-22 18:59:22,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-07-22 18:59:22,476 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-22 18:59:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 290 transitions. [2022-07-22 18:59:22,478 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 290 transitions. Word has length 77 [2022-07-22 18:59:22,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:22,478 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 290 transitions. [2022-07-22 18:59:22,478 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-22 18:59:22,478 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 290 transitions. [2022-07-22 18:59:22,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-22 18:59:22,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:22,480 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-22 18:59:22,500 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-22 18:59:22,694 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-22 18:59:22,695 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:22,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:22,696 INFO L85 PathProgramCache]: Analyzing trace with hash 971561630, now seen corresponding path program 2 times [2022-07-22 18:59:22,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:22,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445405769] [2022-07-22 18:59:22,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:22,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:22,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 18:59:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:22,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 18:59:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:22,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 18:59:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:22,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 18:59:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:22,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 18:59:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:22,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 18:59:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:22,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-22 18:59:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:22,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 18:59:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:22,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 18:59:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:22,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 18:59:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:22,900 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-22 18:59:22,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:22,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445405769] [2022-07-22 18:59:22,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445405769] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 18:59:22,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887883497] [2022-07-22 18:59:22,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 18:59:22,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 18:59:22,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 18:59:22,905 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-22 18:59:22,906 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-22 18:59:23,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 18:59:23,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 18:59:23,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 18:59:23,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 18:59:23,696 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-22 18:59:23,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 18:59:23,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887883497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 18:59:23,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 18:59:23,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-22 18:59:23,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975744029] [2022-07-22 18:59:23,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 18:59:23,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 18:59:23,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:23,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 18:59:23,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 18:59:23,700 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-22 18:59:23,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:23,736 INFO L93 Difference]: Finished difference Result 377 states and 570 transitions. [2022-07-22 18:59:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 18:59:23,736 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-22 18:59:23,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:23,739 INFO L225 Difference]: With dead ends: 377 [2022-07-22 18:59:23,739 INFO L226 Difference]: Without dead ends: 351 [2022-07-22 18:59:23,740 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-22 18:59:23,740 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-22 18:59:23,741 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-22 18:59:23,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-22 18:59:23,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 350. [2022-07-22 18:59:23,755 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-22 18:59:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 531 transitions. [2022-07-22 18:59:23,757 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 531 transitions. Word has length 81 [2022-07-22 18:59:23,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:23,757 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 531 transitions. [2022-07-22 18:59:23,758 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-22 18:59:23,758 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 531 transitions. [2022-07-22 18:59:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-22 18:59:23,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:23,760 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-22 18:59:23,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-22 18:59:23,967 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-22 18:59:23,968 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:23,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:23,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1383247446, now seen corresponding path program 1 times [2022-07-22 18:59:23,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:23,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706573547] [2022-07-22 18:59:23,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:23,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 18:59:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 18:59:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 18:59:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 18:59:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 18:59:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 18:59:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 18:59:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 18:59:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-22 18:59:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-22 18:59:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 18:59:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-22 18:59:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-22 18:59:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-22 18:59:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-22 18:59:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-22 18:59:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-22 18:59:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,246 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-22 18:59:24,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:24,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706573547] [2022-07-22 18:59:24,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706573547] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 18:59:24,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699857193] [2022-07-22 18:59:24,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:24,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 18:59:24,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 18:59:24,250 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-22 18:59:24,251 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-22 18:59:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:24,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 2184 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 18:59:24,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 18:59:24,915 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-22 18:59:24,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 18:59:25,032 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-22 18:59:25,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699857193] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 18:59:25,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 18:59:25,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2022-07-22 18:59:25,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430557373] [2022-07-22 18:59:25,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 18:59:25,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 18:59:25,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:25,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 18:59:25,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-22 18:59:25,035 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-22 18:59:27,095 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 18:59:29,112 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 18:59:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:29,745 INFO L93 Difference]: Finished difference Result 719 states and 1092 transitions. [2022-07-22 18:59:29,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 18:59:29,746 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-22 18:59:29,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:29,748 INFO L225 Difference]: With dead ends: 719 [2022-07-22 18:59:29,749 INFO L226 Difference]: Without dead ends: 381 [2022-07-22 18:59:29,750 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-22 18:59:29,751 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 108 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 175 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-22 18:59:29,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 929 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 556 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2022-07-22 18:59:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-07-22 18:59:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 363. [2022-07-22 18:59:29,766 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-22 18:59:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 547 transitions. [2022-07-22 18:59:29,768 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 547 transitions. Word has length 183 [2022-07-22 18:59:29,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:29,768 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 547 transitions. [2022-07-22 18:59:29,768 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-22 18:59:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 547 transitions. [2022-07-22 18:59:29,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-22 18:59:29,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:29,771 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-22 18:59:29,809 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-22 18:59:29,988 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-22 18:59:29,988 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:29,989 INFO L85 PathProgramCache]: Analyzing trace with hash -945252521, now seen corresponding path program 2 times [2022-07-22 18:59:29,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:29,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406972905] [2022-07-22 18:59:29,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:29,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 18:59:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 18:59:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 18:59:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 18:59:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 18:59:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 18:59:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 18:59:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-22 18:59:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-22 18:59:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-22 18:59:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 18:59:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-22 18:59:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-22 18:59:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-22 18:59:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-22 18:59:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-22 18:59:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-22 18:59:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:43,581 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-22 18:59:43,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:43,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406972905] [2022-07-22 18:59:43,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406972905] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 18:59:43,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482975895] [2022-07-22 18:59:43,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 18:59:43,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 18:59:43,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 18:59:43,586 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-22 18:59:43,587 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-22 18:59:44,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 18:59:44,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 18:59:44,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 18:59:44,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 18:59:44,420 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-22 18:59:44,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 18:59:44,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482975895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 18:59:44,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 18:59:44,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-22 18:59:44,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856409811] [2022-07-22 18:59:44,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 18:59:44,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 18:59:44,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:44,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 18:59:44,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-22 18:59:44,422 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-22 18:59:44,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:44,441 INFO L93 Difference]: Finished difference Result 695 states and 1053 transitions. [2022-07-22 18:59:44,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 18:59:44,442 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-22 18:59:44,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:44,445 INFO L225 Difference]: With dead ends: 695 [2022-07-22 18:59:44,445 INFO L226 Difference]: Without dead ends: 363 [2022-07-22 18:59:44,446 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-22 18:59:44,457 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-22 18:59:44,457 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-22 18:59:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-22 18:59:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2022-07-22 18:59:44,491 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-22 18:59:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 546 transitions. [2022-07-22 18:59:44,493 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 546 transitions. Word has length 192 [2022-07-22 18:59:44,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:44,493 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 546 transitions. [2022-07-22 18:59:44,493 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-22 18:59:44,493 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 546 transitions. [2022-07-22 18:59:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-22 18:59:44,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:44,496 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-22 18:59:44,519 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-22 18:59:44,711 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-22 18:59:44,711 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:44,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:44,712 INFO L85 PathProgramCache]: Analyzing trace with hash 342116215, now seen corresponding path program 1 times [2022-07-22 18:59:44,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:44,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006417212] [2022-07-22 18:59:44,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:44,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 18:59:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 18:59:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-22 18:59:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 18:59:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 18:59:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 18:59:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 18:59:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 18:59:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 18:59:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-22 18:59:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-22 18:59:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-22 18:59:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-22 18:59:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-22 18:59:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-22 18:59:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-22 18:59:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-22 18:59:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-22 18:59:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-22 18:59:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:45,221 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-22 18:59:45,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:45,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006417212] [2022-07-22 18:59:45,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006417212] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 18:59:45,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113024835] [2022-07-22 18:59:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:45,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 18:59:45,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 18:59:45,223 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-22 18:59:45,254 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-22 18:59:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:46,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 2532 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 18:59:46,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 18:59:46,117 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-22 18:59:46,143 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-22 18:59:46,198 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-22 18:59:46,203 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-22 18:59:46,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 18:59:46,267 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-22 18:59:46,424 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-22 18:59:46,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113024835] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 18:59:46,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 18:59:46,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2022-07-22 18:59:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880317783] [2022-07-22 18:59:46,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 18:59:46,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 18:59:46,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:46,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 18:59:46,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-22 18:59:46,425 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-22 18:59:48,450 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-22 18:59:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:50,087 INFO L93 Difference]: Finished difference Result 845 states and 1305 transitions. [2022-07-22 18:59:50,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 18:59:50,094 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-22 18:59:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:50,104 INFO L225 Difference]: With dead ends: 845 [2022-07-22 18:59:50,104 INFO L226 Difference]: Without dead ends: 815 [2022-07-22 18:59:50,107 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-22 18:59:50,107 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 673 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 663 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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.4s IncrementalHoareTripleChecker+Time [2022-07-22 18:59:50,108 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.4s Time] [2022-07-22 18:59:50,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2022-07-22 18:59:50,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 754. [2022-07-22 18:59:50,141 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-22 18:59:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1170 transitions. [2022-07-22 18:59:50,147 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1170 transitions. Word has length 220 [2022-07-22 18:59:50,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:50,147 INFO L495 AbstractCegarLoop]: Abstraction has 754 states and 1170 transitions. [2022-07-22 18:59:50,147 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-22 18:59:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1170 transitions. [2022-07-22 18:59:50,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-22 18:59:50,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:50,151 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-22 18:59:50,173 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-22 18:59:50,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-22 18:59:50,351 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:50,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:50,352 INFO L85 PathProgramCache]: Analyzing trace with hash -26567542, now seen corresponding path program 1 times [2022-07-22 18:59:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:50,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185546589] [2022-07-22 18:59:50,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:50,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 18:59:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 18:59:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 18:59:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 18:59:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 18:59:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 18:59:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 18:59:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 18:59:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 18:59:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-22 18:59:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-22 18:59:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-22 18:59:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-22 18:59:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-22 18:59:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-22 18:59:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-22 18:59:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-22 18:59:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-22 18:59:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-22 18:59:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:55,384 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-22 18:59:55,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:55,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185546589] [2022-07-22 18:59:55,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185546589] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 18:59:55,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424904386] [2022-07-22 18:59:55,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:55,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 18:59:55,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 18:59:55,394 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-22 18:59:55,396 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-22 18:59:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:56,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 2496 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 18:59:56,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 18:59:56,551 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-22 18:59:56,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 18:59:56,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424904386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 18:59:56,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 18:59:56,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 15 [2022-07-22 18:59:56,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85641282] [2022-07-22 18:59:56,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 18:59:56,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 18:59:56,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:56,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 18:59:56,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-22 18:59:56,554 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-22 18:59:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:57,147 INFO L93 Difference]: Finished difference Result 1731 states and 2851 transitions. [2022-07-22 18:59:57,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 18:59:57,148 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-22 18:59:57,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:57,153 INFO L225 Difference]: With dead ends: 1731 [2022-07-22 18:59:57,153 INFO L226 Difference]: Without dead ends: 1001 [2022-07-22 18:59:57,158 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-22 18:59:57,158 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-22 18:59:57,158 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-22 18:59:57,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2022-07-22 18:59:57,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 963. [2022-07-22 18:59:57,218 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-22 18:59:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1518 transitions. [2022-07-22 18:59:57,224 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1518 transitions. Word has length 221 [2022-07-22 18:59:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:57,224 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1518 transitions. [2022-07-22 18:59:57,224 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-22 18:59:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1518 transitions. [2022-07-22 18:59:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-22 18:59:57,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:57,228 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-22 18:59:57,253 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-22 18:59:57,443 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-22 18:59:57,443 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:57,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:57,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2076186120, now seen corresponding path program 1 times [2022-07-22 18:59:57,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:57,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804103066] [2022-07-22 18:59:57,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:57,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 18:59:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 18:59:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 18:59:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 18:59:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 18:59:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 18:59:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 18:59:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 18:59:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 18:59:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 18:59:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-22 18:59:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-22 18:59:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-22 18:59:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-22 18:59:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-22 18:59:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-22 18:59:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-22 18:59:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-22 18:59:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-22 18:59:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-22 18:59:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:57,791 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-22 18:59:57,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:57,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804103066] [2022-07-22 18:59:57,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804103066] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 18:59:57,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730641993] [2022-07-22 18:59:57,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:57,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 18:59:57,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 18:59:57,793 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-22 18:59:57,794 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-22 18:59:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:58,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 2471 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 18:59:58,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 18:59:58,787 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-22 18:59:58,790 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-22 18:59:58,817 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-22 18:59:58,826 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-22 18:59:58,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 18:59:58,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730641993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 18:59:58,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 18:59:58,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-22 18:59:58,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605511121] [2022-07-22 18:59:58,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 18:59:58,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 18:59:58,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:58,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 18:59:58,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-22 18:59:58,830 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-22 18:59:58,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:58,989 INFO L93 Difference]: Finished difference Result 1940 states and 3040 transitions. [2022-07-22 18:59:58,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 18:59:58,990 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-22 18:59:58,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:58,995 INFO L225 Difference]: With dead ends: 1940 [2022-07-22 18:59:58,995 INFO L226 Difference]: Without dead ends: 1017 [2022-07-22 18:59:58,998 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-22 18:59:59,000 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-22 18:59:59,001 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-22 18:59:59,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2022-07-22 18:59:59,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 975. [2022-07-22 18:59:59,059 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-22 18:59:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1532 transitions. [2022-07-22 18:59:59,064 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1532 transitions. Word has length 221 [2022-07-22 18:59:59,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:59,065 INFO L495 AbstractCegarLoop]: Abstraction has 975 states and 1532 transitions. [2022-07-22 18:59:59,066 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-22 18:59:59,066 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1532 transitions. [2022-07-22 18:59:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-22 18:59:59,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:59,070 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-22 18:59:59,106 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-22 18:59:59,287 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-22 18:59:59,287 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:59,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:59,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1342111146, now seen corresponding path program 1 times [2022-07-22 18:59:59,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:59,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28905838] [2022-07-22 18:59:59,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:59,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 19:00:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 19:00:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 19:00:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-22 19:00:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 19:00:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 19:00:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 19:00:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 19:00:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 19:00:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 19:00:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-22 19:00:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-22 19:00:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-22 19:00:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-22 19:00:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-22 19:00:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-22 19:00:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-22 19:00:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-22 19:00:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-22 19:00:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-22 19:00:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:06,523 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-22 19:00:06,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 19:00:06,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28905838] [2022-07-22 19:00:06,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28905838] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 19:00:06,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796768183] [2022-07-22 19:00:06,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 19:00:06,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 19:00:06,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 19:00:06,525 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-22 19:00:06,526 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-22 19:00:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:07,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 2499 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 19:00:07,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 19:00:07,745 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-22 19:00:07,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 19:00:07,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796768183] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 19:00:07,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 19:00:07,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2022-07-22 19:00:07,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494208751] [2022-07-22 19:00:07,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 19:00:07,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 19:00:07,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 19:00:07,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 19:00:07,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-07-22 19:00:07,747 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-22 19:00:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 19:00:08,951 INFO L93 Difference]: Finished difference Result 2599 states and 4124 transitions. [2022-07-22 19:00:08,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 19:00:08,951 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-22 19:00:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 19:00:08,960 INFO L225 Difference]: With dead ends: 2599 [2022-07-22 19:00:08,960 INFO L226 Difference]: Without dead ends: 1648 [2022-07-22 19:00:08,966 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-22 19:00:08,966 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-22 19:00:08,967 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-22 19:00:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2022-07-22 19:00:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1440. [2022-07-22 19:00:09,063 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-22 19:00:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2257 transitions. [2022-07-22 19:00:09,068 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2257 transitions. Word has length 220 [2022-07-22 19:00:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 19:00:09,069 INFO L495 AbstractCegarLoop]: Abstraction has 1440 states and 2257 transitions. [2022-07-22 19:00:09,069 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-22 19:00:09,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2257 transitions. [2022-07-22 19:00:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-22 19:00:09,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 19:00:09,073 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-22 19:00:09,096 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-22 19:00:09,296 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-22 19:00:09,296 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 19:00:09,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 19:00:09,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2117807204, now seen corresponding path program 1 times [2022-07-22 19:00:09,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 19:00:09,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612558562] [2022-07-22 19:00:09,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 19:00:09,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 19:00:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 19:00:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 19:00:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-22 19:00:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 19:00:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 19:00:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 19:00:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 19:00:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-22 19:00:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 19:00:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-22 19:00:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-22 19:00:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-22 19:00:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-22 19:00:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-22 19:00:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-22 19:00:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-22 19:00:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-22 19:00:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-22 19:00:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-22 19:00:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:21,941 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-22 19:00:21,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 19:00:21,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612558562] [2022-07-22 19:00:21,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612558562] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 19:00:21,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795533517] [2022-07-22 19:00:21,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 19:00:21,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 19:00:21,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 19:00:21,943 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-22 19:00:21,944 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-22 19:00:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:23,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 107 conjunts are in the unsatisfiable core [2022-07-22 19:00:23,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 19:00:23,507 INFO L356 Elim1Store]: treesize reduction 144, result has 14.8 percent of original size [2022-07-22 19:00:23,507 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-22 19:00:23,695 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-22 19:00:23,861 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-22 19:00:24,111 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-22 19:00:24,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-22 19:00:25,078 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-22 19:00:25,150 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-22 19:00:25,245 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-22 19:00:25,358 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-22 19:00:25,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:00:25,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:00:25,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:00:25,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:00:25,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:00:25,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:00:25,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:00:25,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:00:25,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:00:25,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:00:25,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:00:25,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:00:25,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:00:25,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:00:25,746 INFO L356 Elim1Store]: treesize reduction 315, result has 24.1 percent of original size [2022-07-22 19:00:25,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-22 19:00:25,784 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-22 19:00:25,784 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-22 19:00:26,008 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-22 19:00:26,123 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-22 19:00:26,142 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-22 19:00:26,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 19:00:26,473 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-22 19:00:26,528 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-22 19:00:26,564 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-22 19:00:26,594 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-22 19:00:26,620 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-22 19:00:26,694 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-22 19:00:26,741 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-22 19:00:26,785 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-22 19:00:26,822 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-22 19:00:27,039 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-22 19:00:27,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795533517] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 19:00:27,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 19:00:27,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 15] total 33 [2022-07-22 19:00:27,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213407838] [2022-07-22 19:00:27,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 19:00:27,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-22 19:00:27,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 19:00:27,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-22 19:00:27,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=455, Unknown=9, NotChecked=468, Total=1056 [2022-07-22 19:00:27,042 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-22 19:00:29,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 19:00:31,793 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-22 19:00:33,805 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 19:00:35,825 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-22 19:00:38,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 19:00:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 19:00:40,970 INFO L93 Difference]: Finished difference Result 3186 states and 4945 transitions. [2022-07-22 19:00:40,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-22 19:00:40,970 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-22 19:00:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 19:00:40,981 INFO L225 Difference]: With dead ends: 3186 [2022-07-22 19:00:40,981 INFO L226 Difference]: Without dead ends: 1709 [2022-07-22 19:00:40,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 487 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=393, Invalid=1356, Unknown=9, NotChecked=792, Total=2550 [2022-07-22 19:00:40,991 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 690 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 1765 mSolverCounterSat, 588 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 6163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 588 IncrementalHoareTripleChecker+Valid, 1765 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 3805 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-07-22 19:00:40,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1123 Invalid, 6163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [588 Valid, 1765 Invalid, 5 Unknown, 3805 Unchecked, 12.6s Time] [2022-07-22 19:00:40,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2022-07-22 19:00:41,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1627. [2022-07-22 19:00:41,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1125 states have (on average 1.2622222222222221) internal successors, (1420), 1034 states have internal predecessors, (1420), 370 states have call successors, (370), 77 states have call predecessors, (370), 131 states have return successors, (727), 515 states have call predecessors, (727), 370 states have call successors, (727) [2022-07-22 19:00:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 2517 transitions. [2022-07-22 19:00:41,144 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 2517 transitions. Word has length 221 [2022-07-22 19:00:41,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 19:00:41,144 INFO L495 AbstractCegarLoop]: Abstraction has 1627 states and 2517 transitions. [2022-07-22 19:00:41,144 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-22 19:00:41,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2517 transitions. [2022-07-22 19:00:41,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-07-22 19:00:41,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 19:00:41,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:00:41,179 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-22 19:00:41,367 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-22 19:00:41,367 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 19:00:41,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 19:00:41,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1833265775, now seen corresponding path program 1 times [2022-07-22 19:00:41,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 19:00:41,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005522470] [2022-07-22 19:00:41,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 19:00:41,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 19:00:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 19:00:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 19:00:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 19:00:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 19:00:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 19:00:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 19:00:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 19:00:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-22 19:00:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 19:00:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-22 19:00:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-22 19:00:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-22 19:00:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-22 19:00:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-22 19:00:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-22 19:00:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-22 19:00:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-22 19:00:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-22 19:00:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-22 19:00:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2022-07-22 19:00:41,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 19:00:41,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005522470] [2022-07-22 19:00:41,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005522470] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 19:00:41,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375678509] [2022-07-22 19:00:41,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 19:00:41,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 19:00:41,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 19:00:41,765 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-22 19:00:41,768 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-22 19:00:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:42,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 19:00:42,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 19:00:42,985 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-22 19:00:43,012 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-22 19:00:43,055 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-22 19:00:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 400 proven. 6 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2022-07-22 19:00:43,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 19:00:43,114 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-22 19:00:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2022-07-22 19:00:43,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375678509] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 19:00:43,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 19:00:43,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2022-07-22 19:00:43,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924940333] [2022-07-22 19:00:43,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 19:00:43,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 19:00:43,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 19:00:43,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 19:00:43,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-22 19:00:43,282 INFO L87 Difference]: Start difference. First operand 1627 states and 2517 transitions. Second operand has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 8 states have internal predecessors, (110), 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-22 19:00:45,306 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-22 19:00:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 19:00:46,823 INFO L93 Difference]: Finished difference Result 3184 states and 4859 transitions. [2022-07-22 19:00:46,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 19:00:46,823 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 8 states have internal predecessors, (110), 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 222 [2022-07-22 19:00:46,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 19:00:46,831 INFO L225 Difference]: With dead ends: 3184 [2022-07-22 19:00:46,831 INFO L226 Difference]: Without dead ends: 1418 [2022-07-22 19:00:46,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2022-07-22 19:00:46,839 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 581 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 470 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-22 19:00:46,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1106 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 1373 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-07-22 19:00:46,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2022-07-22 19:00:46,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1302. [2022-07-22 19:00:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 908 states have (on average 1.2411894273127753) internal successors, (1127), 842 states have internal predecessors, (1127), 284 states have call successors, (284), 70 states have call predecessors, (284), 109 states have return successors, (519), 389 states have call predecessors, (519), 284 states have call successors, (519) [2022-07-22 19:00:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1930 transitions. [2022-07-22 19:00:46,927 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1930 transitions. Word has length 222 [2022-07-22 19:00:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 19:00:46,927 INFO L495 AbstractCegarLoop]: Abstraction has 1302 states and 1930 transitions. [2022-07-22 19:00:46,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 8 states have internal predecessors, (110), 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-22 19:00:46,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1930 transitions. [2022-07-22 19:00:46,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-07-22 19:00:46,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 19:00:46,932 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, 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] [2022-07-22 19:00:46,960 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-22 19:00:47,151 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-22 19:00:47,151 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 19:00:47,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 19:00:47,152 INFO L85 PathProgramCache]: Analyzing trace with hash 708976617, now seen corresponding path program 1 times [2022-07-22 19:00:47,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 19:00:47,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364276471] [2022-07-22 19:00:47,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 19:00:47,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 19:00:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 19:00:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 19:00:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 19:00:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 19:00:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 19:00:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 19:00:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 19:00:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-22 19:00:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 19:00:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:00:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:00:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-22 19:00:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-22 19:00:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-22 19:00:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-22 19:00:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-22 19:00:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-22 19:00:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-22 19:00:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-22 19:00:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-22 19:00:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-22 19:00:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:54,497 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-07-22 19:00:54,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 19:00:54,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364276471] [2022-07-22 19:00:54,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364276471] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 19:00:54,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731011811] [2022-07-22 19:00:54,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 19:00:54,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 19:00:54,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 19:00:54,499 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-22 19:00:54,500 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-22 19:00:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:00:55,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 2479 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 19:00:55,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 19:00:55,753 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-22 19:00:55,756 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-22 19:00:55,760 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-22 19:00:55,763 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-22 19:00:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2022-07-22 19:00:55,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 19:00:55,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731011811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 19:00:55,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 19:00:55,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2022-07-22 19:00:55,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103624192] [2022-07-22 19:00:55,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 19:00:55,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 19:00:55,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 19:00:55,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 19:00:55,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-22 19:00:55,786 INFO L87 Difference]: Start difference. First operand 1302 states and 1930 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, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-22 19:00:55,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 19:00:55,932 INFO L93 Difference]: Finished difference Result 1998 states and 2839 transitions. [2022-07-22 19:00:55,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 19:00:55,933 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, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 222 [2022-07-22 19:00:55,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 19:00:55,939 INFO L225 Difference]: With dead ends: 1998 [2022-07-22 19:00:55,939 INFO L226 Difference]: Without dead ends: 1279 [2022-07-22 19:00:55,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-22 19:00:55,942 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 223 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 19:00:55,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 804 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 19:00:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2022-07-22 19:00:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1224. [2022-07-22 19:00:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 848 states have (on average 1.2429245283018868) internal successors, (1054), 785 states have internal predecessors, (1054), 274 states have call successors, (274), 66 states have call predecessors, (274), 101 states have return successors, (483), 372 states have call predecessors, (483), 274 states have call successors, (483) [2022-07-22 19:00:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1811 transitions. [2022-07-22 19:00:56,050 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1811 transitions. Word has length 222 [2022-07-22 19:00:56,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 19:00:56,050 INFO L495 AbstractCegarLoop]: Abstraction has 1224 states and 1811 transitions. [2022-07-22 19:00:56,051 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, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-22 19:00:56,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1811 transitions. [2022-07-22 19:00:56,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-22 19:00:56,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 19:00:56,056 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-22 19:00:56,084 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-22 19:00:56,271 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-22 19:00:56,272 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 19:00:56,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 19:00:56,272 INFO L85 PathProgramCache]: Analyzing trace with hash 884162958, now seen corresponding path program 1 times [2022-07-22 19:00:56,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 19:00:56,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432277653] [2022-07-22 19:00:56,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 19:00:56,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 19:01:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 19:01:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 19:01:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:01:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:01:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 19:01:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 19:01:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:01:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:01:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 19:01:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 19:01:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:01:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:01:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 19:01:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:01:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:01:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-22 19:01:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 19:01:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:01:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:01:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-22 19:01:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-22 19:01:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-22 19:01:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-22 19:01:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-22 19:01:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-22 19:01:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-22 19:01:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-22 19:01:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-22 19:01:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-22 19:01:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 4 proven. 47 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2022-07-22 19:01:22,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 19:01:22,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432277653] [2022-07-22 19:01:22,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432277653] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 19:01:22,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669023498] [2022-07-22 19:01:22,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 19:01:22,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 19:01:22,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 19:01:22,335 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 19:01:22,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 19:01:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:01:23,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 103 conjunts are in the unsatisfiable core [2022-07-22 19:01:23,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 19:01:24,042 INFO L356 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2022-07-22 19:01:24,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 101 treesize of output 133 [2022-07-22 19:01:24,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 22 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-22 19:01:24,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 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-22 19:01:24,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 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-22 19:01:25,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 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-22 19:01:26,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 22 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-22 19:01:26,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-22 19:01:26,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-22 19:01:26,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-22 19:01:26,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:01:26,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:01:26,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:01:26,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:01:26,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:01:26,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:01:26,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:01:26,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:01:26,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:01:26,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:01:26,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:01:26,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:01:26,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:01:26,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:01:27,053 INFO L356 Elim1Store]: treesize reduction 315, result has 24.1 percent of original size [2022-07-22 19:01:27,054 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 1440 treesize of output 526 [2022-07-22 19:01:27,080 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-22 19:01:27,081 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-22 19:01:27,295 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-22 19:01:27,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-22 19:01:27,430 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-22 19:01:27,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 19:01:27,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#num~0.offset| Int) (v_ArrVal_25121 (Array Int Int)) (v_ArrVal_25109 (Array Int Int)) (v_ArrVal_25119 (Array Int Int)) (v_ArrVal_25118 (Array Int Int)) (v_ArrVal_25107 (Array Int Int)) (v_ArrVal_25128 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_25123 (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_25123) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_25121))) (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_25128) |c_~#empty~0.base| v_ArrVal_25109) |c_~#full~0.base| v_ArrVal_25118) |c_~#__CS_thread_born_round~0.base| v_ArrVal_25107) |c_~#__CS_thread_status~0.base| v_ArrVal_25119) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-22 19:01:27,755 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_25121 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_25109 (Array Int Int)) (v_ArrVal_25119 (Array Int Int)) (v_ArrVal_25118 (Array Int Int)) (v_ArrVal_25107 (Array Int Int)) (v_ArrVal_25106 (Array Int Int)) (v_ArrVal_25128 (Array Int Int)) (v_ArrVal_25105 (Array Int Int)) (v_ArrVal_25123 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 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_25106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25105) |c_~#__CS_thread_status~0.base| v_ArrVal_25123) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_25121))) (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_25128) |c_~#empty~0.base| v_ArrVal_25109) |c_~#full~0.base| v_ArrVal_25118) |c_~#__CS_thread_born_round~0.base| v_ArrVal_25107) |c_~#__CS_thread_status~0.base| v_ArrVal_25119) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-22 19:01:27,777 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_25121 (Array Int Int)) (v_ArrVal_25118 (Array Int Int)) (v_ArrVal_25107 (Array Int Int)) (v_ArrVal_25106 (Array Int Int)) (v_ArrVal_25128 (Array Int Int)) (v_ArrVal_25105 (Array Int Int)) (v_ArrVal_25104 (Array Int Int)) (v_ArrVal_25103 (Array Int Int)) (v_ArrVal_25123 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_25109 (Array Int Int)) (v_ArrVal_25119 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 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_25104) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25105) |c_~#__CS_thread_status~0.base| v_ArrVal_25123) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_25121))) (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_25128) |c_~#empty~0.base| v_ArrVal_25109) |c_~#full~0.base| v_ArrVal_25118) |c_~#__CS_thread_born_round~0.base| v_ArrVal_25107) |c_~#__CS_thread_status~0.base| v_ArrVal_25119) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-22 19:01:27,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_25121 (Array Int Int)) (v_ArrVal_25118 (Array Int Int)) (v_ArrVal_25107 (Array Int Int)) (v_ArrVal_25106 (Array Int Int)) (v_ArrVal_25128 (Array Int Int)) (v_ArrVal_25105 (Array Int Int)) (v_ArrVal_25104 (Array Int Int)) (v_ArrVal_25103 (Array Int Int)) (v_ArrVal_25102 (Array Int Int)) (v_ArrVal_25101 (Array Int Int)) (v_ArrVal_25123 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_25109 (Array Int Int)) (v_ArrVal_25119 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 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_25102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25104) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25105) |c_~#__CS_thread_status~0.base| v_ArrVal_25123) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_25121))) (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_25128) |c_~#empty~0.base| v_ArrVal_25109) |c_~#full~0.base| v_ArrVal_25118) |c_~#__CS_thread_born_round~0.base| v_ArrVal_25107) |c_~#__CS_thread_status~0.base| v_ArrVal_25119) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-22 19:01:27,816 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_25099 (Array Int Int)) (v_ArrVal_25121 (Array Int Int)) (v_ArrVal_25098 (Array Int Int)) (v_ArrVal_25097 (Array Int Int)) (v_ArrVal_25118 (Array Int Int)) (v_ArrVal_25107 (Array Int Int)) (v_ArrVal_25106 (Array Int Int)) (v_ArrVal_25128 (Array Int Int)) (v_ArrVal_25105 (Array Int Int)) (v_ArrVal_25104 (Array Int Int)) (v_ArrVal_25103 (Array Int Int)) (v_ArrVal_25102 (Array Int Int)) (v_ArrVal_25101 (Array Int Int)) (v_ArrVal_25123 (Array Int Int)) (v_ArrVal_25100 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_25109 (Array Int Int)) (v_ArrVal_25119 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 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_25100) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_25098) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_25099) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_25097) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25104) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25105) |c_~#__CS_thread_status~0.base| v_ArrVal_25123) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_25121))) (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_25128) |c_~#empty~0.base| v_ArrVal_25109) |c_~#full~0.base| v_ArrVal_25118) |c_~#__CS_thread_born_round~0.base| v_ArrVal_25107) |c_~#__CS_thread_status~0.base| v_ArrVal_25119) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-22 19:01:27,870 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_25099 (Array Int Int)) (v_ArrVal_25121 (Array Int Int)) (v_ArrVal_25098 (Array Int Int)) (v_ArrVal_25097 (Array Int Int)) (v_ArrVal_25096 (Array Int Int)) (v_ArrVal_25095 (Array Int Int)) (v_ArrVal_25118 (Array Int Int)) (v_ArrVal_25107 (Array Int Int)) (v_ArrVal_25106 (Array Int Int)) (v_ArrVal_25128 (Array Int Int)) (v_ArrVal_25105 (Array Int Int)) (v_ArrVal_25104 (Array Int Int)) (v_ArrVal_25103 (Array Int Int)) (v_ArrVal_25102 (Array Int Int)) (v_ArrVal_25101 (Array Int Int)) (v_ArrVal_25123 (Array Int Int)) (v_ArrVal_25100 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_25109 (Array Int Int)) (v_ArrVal_25119 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 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_25096) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25095) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_25100) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_25098) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_25099) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_25097) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25104) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25105) |c_~#__CS_thread_status~0.base| v_ArrVal_25123) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_25121))) (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_25128) |c_~#empty~0.base| v_ArrVal_25109) |c_~#full~0.base| v_ArrVal_25118) |c_~#__CS_thread_born_round~0.base| v_ArrVal_25107) |c_~#__CS_thread_status~0.base| v_ArrVal_25119) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-22 19:01:27,907 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_25099 (Array Int Int)) (v_ArrVal_25121 (Array Int Int)) (v_ArrVal_25098 (Array Int Int)) (v_ArrVal_25097 (Array Int Int)) (v_ArrVal_25096 (Array Int Int)) (v_ArrVal_25095 (Array Int Int)) (v_ArrVal_25094 (Array Int Int)) (v_ArrVal_25093 (Array Int Int)) (v_ArrVal_25118 (Array Int Int)) (v_ArrVal_25107 (Array Int Int)) (v_ArrVal_25106 (Array Int Int)) (v_ArrVal_25128 (Array Int Int)) (v_ArrVal_25105 (Array Int Int)) (v_ArrVal_25104 (Array Int Int)) (v_ArrVal_25103 (Array Int Int)) (v_ArrVal_25102 (Array Int Int)) (v_ArrVal_25101 (Array Int Int)) (v_ArrVal_25123 (Array Int Int)) (v_ArrVal_25100 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_25109 (Array Int Int)) (v_ArrVal_25119 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 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_25094) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25093) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25096) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25095) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_25100) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_25098) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_25099) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_25097) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25104) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25105) |c_~#__CS_thread_status~0.base| v_ArrVal_25123) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_25121))) (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_25128) |c_~#empty~0.base| v_ArrVal_25109) |c_~#full~0.base| v_ArrVal_25118) |c_~#__CS_thread_born_round~0.base| v_ArrVal_25107) |c_~#__CS_thread_status~0.base| v_ArrVal_25119) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-22 19:01:27,948 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_25121 (Array Int Int)) (v_ArrVal_25107 (Array Int Int)) (v_ArrVal_25106 (Array Int Int)) (v_ArrVal_25128 (Array Int Int)) (v_ArrVal_25105 (Array Int Int)) (v_ArrVal_25104 (Array Int Int)) (v_ArrVal_25103 (Array Int Int)) (v_ArrVal_25102 (Array Int Int)) (v_ArrVal_25101 (Array Int Int)) (v_ArrVal_25123 (Array Int Int)) (v_ArrVal_25100 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_25119 (Array Int Int)) (v_ArrVal_25099 (Array Int Int)) (v_ArrVal_25098 (Array Int Int)) (v_ArrVal_25097 (Array Int Int)) (v_ArrVal_25096 (Array Int Int)) (v_ArrVal_25095 (Array Int Int)) (v_ArrVal_25094 (Array Int Int)) (v_ArrVal_25093 (Array Int Int)) (v_ArrVal_25092 (Array Int Int)) (v_ArrVal_25118 (Array Int Int)) (v_ArrVal_25109 (Array Int Int)) (v_ArrVal_25091 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 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_25092) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25091) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25094) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25093) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25096) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25095) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_25100) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_25098) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_25099) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_25097) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25104) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25105) |c_~#__CS_thread_status~0.base| v_ArrVal_25123) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_25121))) (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_25128) |c_~#empty~0.base| v_ArrVal_25109) |c_~#full~0.base| v_ArrVal_25118) |c_~#__CS_thread_born_round~0.base| v_ArrVal_25107) |c_~#__CS_thread_status~0.base| v_ArrVal_25119) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-22 19:01:27,984 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_25088 (Array Int Int)) (v_ArrVal_25121 (Array Int Int)) (v_ArrVal_25087 (Array Int Int)) (v_ArrVal_25107 (Array Int Int)) (v_ArrVal_25106 (Array Int Int)) (v_ArrVal_25128 (Array Int Int)) (v_ArrVal_25105 (Array Int Int)) (v_ArrVal_25104 (Array Int Int)) (v_ArrVal_25103 (Array Int Int)) (v_ArrVal_25102 (Array Int Int)) (v_ArrVal_25101 (Array Int Int)) (v_ArrVal_25123 (Array Int Int)) (v_ArrVal_25089 (Array Int Int)) (v_ArrVal_25100 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_25119 (Array Int Int)) (v_ArrVal_25099 (Array Int Int)) (v_ArrVal_25098 (Array Int Int)) (v_ArrVal_25097 (Array Int Int)) (v_ArrVal_25096 (Array Int Int)) (v_ArrVal_25095 (Array Int Int)) (v_ArrVal_25094 (Array Int Int)) (v_ArrVal_25093 (Array Int Int)) (v_ArrVal_25092 (Array Int Int)) (v_ArrVal_25118 (Array Int Int)) (v_ArrVal_25109 (Array Int Int)) (v_ArrVal_25091 (Array Int Int)) (v_ArrVal_25090 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 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 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_25088) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_25090) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_25087) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_25089) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25092) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25091) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25094) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25093) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25096) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25095) |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_25100) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_25098) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_25099) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_25097) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25102) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25101) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25104) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25103) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_25106) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_25105) |c_~#__CS_thread_status~0.base| v_ArrVal_25123) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_25121))) (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_25128) |c_~#empty~0.base| v_ArrVal_25109) |c_~#full~0.base| v_ArrVal_25118) |c_~#__CS_thread_born_round~0.base| v_ArrVal_25107) |c_~#__CS_thread_status~0.base| v_ArrVal_25119) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-07-22 19:01:28,210 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-22 19:01:28,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669023498] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 19:01:28,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 19:01:28,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 15] total 43 [2022-07-22 19:01:28,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134039615] [2022-07-22 19:01:28,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 19:01:28,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-22 19:01:28,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 19:01:28,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-22 19:01:28,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=928, Unknown=10, NotChecked=648, Total=1806 [2022-07-22 19:01:28,213 INFO L87 Difference]: Start difference. First operand 1224 states and 1811 transitions. Second operand has 43 states, 43 states have (on average 4.3023255813953485) internal successors, (185), 39 states have internal predecessors, (185), 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-22 19:01:46,418 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 19:02:04,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 19:02:04,783 INFO L93 Difference]: Finished difference Result 1691 states and 2423 transitions. [2022-07-22 19:02:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-22 19:02:04,783 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 4.3023255813953485) internal successors, (185), 39 states have internal predecessors, (185), 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-22 19:02:04,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 19:02:04,793 INFO L225 Difference]: With dead ends: 1691 [2022-07-22 19:02:04,794 INFO L226 Difference]: Without dead ends: 1289 [2022-07-22 19:02:04,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 487 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=517, Invalid=2350, Unknown=31, NotChecked=1008, Total=3906 [2022-07-22 19:02:04,797 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 295 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 1946 mSolverCounterSat, 209 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 5289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1946 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 3133 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2022-07-22 19:02:04,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1302 Invalid, 5289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1946 Invalid, 1 Unknown, 3133 Unchecked, 17.1s Time] [2022-07-22 19:02:04,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2022-07-22 19:02:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1229. [2022-07-22 19:02:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 852 states have (on average 1.2406103286384977) internal successors, (1057), 790 states have internal predecessors, (1057), 274 states have call successors, (274), 66 states have call predecessors, (274), 102 states have return successors, (483), 372 states have call predecessors, (483), 274 states have call successors, (483) [2022-07-22 19:02:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1814 transitions. [2022-07-22 19:02:04,882 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1814 transitions. Word has length 221 [2022-07-22 19:02:04,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 19:02:04,882 INFO L495 AbstractCegarLoop]: Abstraction has 1229 states and 1814 transitions. [2022-07-22 19:02:04,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.3023255813953485) internal successors, (185), 39 states have internal predecessors, (185), 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-22 19:02:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1814 transitions. [2022-07-22 19:02:04,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-22 19:02:04,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 19:02:04,886 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-22 19:02:04,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-22 19:02:05,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-22 19:02:05,111 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 19:02:05,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 19:02:05,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1993197326, now seen corresponding path program 1 times [2022-07-22 19:02:05,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 19:02:05,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957907868] [2022-07-22 19:02:05,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 19:02:05,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 19:02:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:13,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 19:02:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 19:02:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:02:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:02:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 19:02:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 19:02:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:02:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:02:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 19:02:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 19:02:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:02:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:02:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 19:02:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:02:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:02:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-22 19:02:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 19:02:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 19:02:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 19:02:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-22 19:02:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-22 19:02:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-22 19:02:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-22 19:02:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-22 19:02:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-22 19:02:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-22 19:02:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-22 19:02:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-22 19:02:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-22 19:02:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2022-07-22 19:02:14,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 19:02:14,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957907868] [2022-07-22 19:02:14,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957907868] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 19:02:14,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812334189] [2022-07-22 19:02:14,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 19:02:14,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 19:02:14,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 19:02:14,791 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 19:02:14,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-22 19:02:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 19:02:16,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 2519 conjuncts, 174 conjunts are in the unsatisfiable core [2022-07-22 19:02:16,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 19:02:19,746 INFO L356 Elim1Store]: treesize reduction 312, result has 38.2 percent of original size [2022-07-22 19:02:19,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 28 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 63 case distinctions, treesize of input 131 treesize of output 295 [2022-07-22 19:02:23,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 46 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 31 [2022-07-22 19:02:24,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 25 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-22 19:02:27,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 25 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-22 19:02:30,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 25 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-22 19:02:39,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-22 19:02:39,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 36 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-22 19:02:40,944 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-22 19:02:42,016 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-22 19:02:43,350 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-22 19:02:46,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:02:46,450 INFO L356 Elim1Store]: treesize reduction 120, result has 13.7 percent of original size [2022-07-22 19:02:46,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 168 treesize of output 111 [2022-07-22 19:02:46,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:02:46,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:02:46,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 45 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 98 [2022-07-22 19:02:46,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:02:46,556 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 22 treesize of output 26 [2022-07-22 19:02:46,585 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-22 19:02:46,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 28 [2022-07-22 19:02:47,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:02:47,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2022-07-22 19:02:50,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2022-07-22 19:02:51,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 19:02:51,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2022-07-22 19:02:54,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 19:02:55,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 19:02:57,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 19:03:08,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2022-07-22 19:03:25,166 INFO L356 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-07-22 19:03:25,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 27 [2022-07-22 19:03:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 282 proven. 446 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-07-22 19:03:26,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 19:03:29,252 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_27237 (Array Int Int)) (|aux_mod_v_old(~__CS_round~0)_127_36| Int)) (let ((.cse1 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_27237))) (let ((.cse0 (select .cse1 |c_~#num~0.base|))) (or (< |aux_mod_v_old(~__CS_round~0)_127_36| 0) (<= (select .cse0 (+ (* (mod |aux_mod_v_old(~__CS_round~0)_127_36| 256) 4) |c_~#num~0.offset|)) 0) (<= 2 |aux_mod_v_old(~__CS_round~0)_127_36|) (not (= (select .cse0 |c_~#num~0.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4)))))))) is different from false [2022-07-22 19:03:29,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812334189] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 19:03:29,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 19:03:29,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 29] total 39 [2022-07-22 19:03:29,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859543214] [2022-07-22 19:03:29,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 19:03:29,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-22 19:03:29,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 19:03:29,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-22 19:03:29,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1525, Unknown=54, NotChecked=80, Total=1806 [2022-07-22 19:03:29,263 INFO L87 Difference]: Start difference. First operand 1229 states and 1814 transitions. Second operand has 39 states, 36 states have (on average 4.833333333333333) internal successors, (174), 34 states have internal predecessors, (174), 16 states have call successors, (47), 13 states have call predecessors, (47), 15 states have return successors, (47), 13 states have call predecessors, (47), 16 states have call successors, (47)