./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina3.c --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/array-fpi/sina3.c -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 2aebf3cfbf85ca5d76e40b9ce94a108ab82985532ad1ea09b88a009b3e11ff5a --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 10:57:24,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 10:57:24,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 10:57:24,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 10:57:24,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 10:57:24,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 10:57:24,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 10:57:24,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 10:57:24,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 10:57:24,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 10:57:24,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 10:57:24,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 10:57:24,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 10:57:24,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 10:57:24,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 10:57:24,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 10:57:24,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 10:57:24,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 10:57:24,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 10:57:24,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 10:57:24,364 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 10:57:24,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 10:57:24,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 10:57:24,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 10:57:24,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 10:57:24,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 10:57:24,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 10:57:24,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 10:57:24,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 10:57:24,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 10:57:24,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 10:57:24,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 10:57:24,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 10:57:24,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 10:57:24,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 10:57:24,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 10:57:24,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 10:57:24,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 10:57:24,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 10:57:24,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 10:57:24,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 10:57:24,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 10:57:24,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 10:57:24,414 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 10:57:24,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 10:57:24,415 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 10:57:24,415 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 10:57:24,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 10:57:24,416 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 10:57:24,416 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 10:57:24,417 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 10:57:24,417 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 10:57:24,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 10:57:24,417 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 10:57:24,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 10:57:24,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 10:57:24,418 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 10:57:24,418 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 10:57:24,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 10:57:24,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 10:57:24,419 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 10:57:24,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 10:57:24,419 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 10:57:24,419 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 10:57:24,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 10:57:24,420 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 10:57:24,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 10:57:24,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:57:24,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 10:57:24,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 10:57:24,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 10:57:24,421 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 10:57:24,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 10:57:24,421 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 10:57:24,421 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 10:57:24,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 10:57:24,422 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 -> 2aebf3cfbf85ca5d76e40b9ce94a108ab82985532ad1ea09b88a009b3e11ff5a [2022-07-22 10:57:24,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 10:57:24,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 10:57:24,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 10:57:24,666 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 10:57:24,666 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 10:57:24,667 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina3.c [2022-07-22 10:57:24,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/703cf2b02/73b0f655f05b46c4a8f7a3f9e3fb559f/FLAGd87ce3a9a [2022-07-22 10:57:25,157 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 10:57:25,158 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina3.c [2022-07-22 10:57:25,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/703cf2b02/73b0f655f05b46c4a8f7a3f9e3fb559f/FLAGd87ce3a9a [2022-07-22 10:57:25,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/703cf2b02/73b0f655f05b46c4a8f7a3f9e3fb559f [2022-07-22 10:57:25,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 10:57:25,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 10:57:25,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 10:57:25,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 10:57:25,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 10:57:25,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:57:25" (1/1) ... [2022-07-22 10:57:25,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e72ec87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:25, skipping insertion in model container [2022-07-22 10:57:25,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:57:25" (1/1) ... [2022-07-22 10:57:25,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 10:57:25,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 10:57:25,374 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/array-fpi/sina3.c[588,601] [2022-07-22 10:57:25,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:57:25,407 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 10:57:25,419 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/array-fpi/sina3.c[588,601] [2022-07-22 10:57:25,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:57:25,453 INFO L208 MainTranslator]: Completed translation [2022-07-22 10:57:25,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:25 WrapperNode [2022-07-22 10:57:25,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 10:57:25,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 10:57:25,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 10:57:25,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 10:57:25,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:25" (1/1) ... [2022-07-22 10:57:25,476 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:25" (1/1) ... [2022-07-22 10:57:25,498 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2022-07-22 10:57:25,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 10:57:25,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 10:57:25,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 10:57:25,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 10:57:25,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:25" (1/1) ... [2022-07-22 10:57:25,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:25" (1/1) ... [2022-07-22 10:57:25,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:25" (1/1) ... [2022-07-22 10:57:25,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:25" (1/1) ... [2022-07-22 10:57:25,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:25" (1/1) ... [2022-07-22 10:57:25,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:25" (1/1) ... [2022-07-22 10:57:25,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:25" (1/1) ... [2022-07-22 10:57:25,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 10:57:25,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 10:57:25,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 10:57:25,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 10:57:25,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:25" (1/1) ... [2022-07-22 10:57:25,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:57:25,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:57:25,572 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 10:57:25,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 10:57:25,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 10:57:25,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 10:57:25,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 10:57:25,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 10:57:25,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 10:57:25,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 10:57:25,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 10:57:25,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 10:57:25,628 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 10:57:25,690 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 10:57:25,691 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 10:57:25,840 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 10:57:25,845 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 10:57:25,845 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-22 10:57:25,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:57:25 BoogieIcfgContainer [2022-07-22 10:57:25,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 10:57:25,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 10:57:25,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 10:57:25,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 10:57:25,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:57:25" (1/3) ... [2022-07-22 10:57:25,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17cd107f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:57:25, skipping insertion in model container [2022-07-22 10:57:25,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:57:25" (2/3) ... [2022-07-22 10:57:25,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17cd107f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:57:25, skipping insertion in model container [2022-07-22 10:57:25,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:57:25" (3/3) ... [2022-07-22 10:57:25,854 INFO L111 eAbstractionObserver]: Analyzing ICFG sina3.c [2022-07-22 10:57:25,865 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 10:57:25,865 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 10:57:25,900 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 10:57:25,906 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@e19554d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a558b90 [2022-07-22 10:57:25,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 10:57:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 10:57:25,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:25,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:57:25,915 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:25,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:25,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2022-07-22 10:57:25,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:25,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448383917] [2022-07-22 10:57:25,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:25,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:26,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:26,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:26,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448383917] [2022-07-22 10:57:26,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448383917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:57:26,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:57:26,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 10:57:26,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36690948] [2022-07-22 10:57:26,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:57:26,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 10:57:26,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:26,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 10:57:26,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:57:26,115 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:57:26,129 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-07-22 10:57:26,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 10:57:26,130 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-22 10:57:26,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:57:26,137 INFO L225 Difference]: With dead ends: 50 [2022-07-22 10:57:26,137 INFO L226 Difference]: Without dead ends: 23 [2022-07-22 10:57:26,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:57:26,144 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:57:26,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:57:26,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-22 10:57:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-22 10:57:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-22 10:57:26,167 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-07-22 10:57:26,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:57:26,168 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-22 10:57:26,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:26,168 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-22 10:57:26,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 10:57:26,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:26,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:57:26,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 10:57:26,170 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:26,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:26,171 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2022-07-22 10:57:26,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:26,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310157960] [2022-07-22 10:57:26,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:26,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:26,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:26,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310157960] [2022-07-22 10:57:26,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310157960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:57:26,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:57:26,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 10:57:26,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460884052] [2022-07-22 10:57:26,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:57:26,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 10:57:26,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:26,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 10:57:26,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:57:26,279 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:57:26,338 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-07-22 10:57:26,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 10:57:26,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-22 10:57:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:57:26,339 INFO L225 Difference]: With dead ends: 53 [2022-07-22 10:57:26,339 INFO L226 Difference]: Without dead ends: 37 [2022-07-22 10:57:26,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:57:26,341 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:57:26,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 17 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:57:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-22 10:57:26,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-07-22 10:57:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-22 10:57:26,348 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-07-22 10:57:26,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:57:26,349 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-22 10:57:26,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:26,349 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-22 10:57:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 10:57:26,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:26,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:57:26,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 10:57:26,351 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:26,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:26,351 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2022-07-22 10:57:26,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:26,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511662280] [2022-07-22 10:57:26,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:26,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:27,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:27,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511662280] [2022-07-22 10:57:27,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511662280] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:57:27,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093055086] [2022-07-22 10:57:27,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:27,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:57:27,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:57:27,355 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 10:57:27,382 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 10:57:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:27,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-22 10:57:27,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:57:27,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:27,525 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 18 treesize of output 16 [2022-07-22 10:57:27,563 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 11 treesize of output 7 [2022-07-22 10:57:27,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:27,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 10:57:27,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:27,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:27,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-22 10:57:28,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:28,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:28,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-07-22 10:57:28,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:28,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:28,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-07-22 10:57:28,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:28,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:28,484 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 10:57:28,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 36 [2022-07-22 10:57:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:28,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:57:28,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:57:28,984 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 20 treesize of output 18 [2022-07-22 10:57:28,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:57:28,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:57:28,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:57:28,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:28,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093055086] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:57:28,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:57:28,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-07-22 10:57:28,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001814692] [2022-07-22 10:57:28,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:57:29,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-22 10:57:29,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:29,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-22 10:57:29,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2022-07-22 10:57:29,002 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:57:29,484 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-07-22 10:57:29,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 10:57:29,484 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-22 10:57:29,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:57:29,485 INFO L225 Difference]: With dead ends: 55 [2022-07-22 10:57:29,485 INFO L226 Difference]: Without dead ends: 53 [2022-07-22 10:57:29,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=281, Invalid=1441, Unknown=0, NotChecked=0, Total=1722 [2022-07-22 10:57:29,487 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 10:57:29,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 114 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 334 Invalid, 0 Unknown, 11 Unchecked, 0.3s Time] [2022-07-22 10:57:29,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-22 10:57:29,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-07-22 10:57:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-07-22 10:57:29,496 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2022-07-22 10:57:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:57:29,497 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-07-22 10:57:29,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-07-22 10:57:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 10:57:29,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:29,498 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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 10:57:29,527 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 10:57:29,721 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 10:57:29,722 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:29,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:29,722 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2022-07-22 10:57:29,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:29,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283088759] [2022-07-22 10:57:29,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:29,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:57:29,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:29,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283088759] [2022-07-22 10:57:29,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283088759] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:57:29,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41584394] [2022-07-22 10:57:29,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:57:29,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:57:29,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:57:29,800 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 10:57:29,829 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 10:57:29,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:57:29,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:57:29,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:57:29,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:57:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:57:29,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:57:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:57:29,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41584394] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:57:29,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:57:29,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-22 10:57:29,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742365430] [2022-07-22 10:57:29,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:57:29,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 10:57:29,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:29,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 10:57:29,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-22 10:57:29,962 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:30,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:57:30,096 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-07-22 10:57:30,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:57:30,097 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-22 10:57:30,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:57:30,098 INFO L225 Difference]: With dead ends: 110 [2022-07-22 10:57:30,098 INFO L226 Difference]: Without dead ends: 66 [2022-07-22 10:57:30,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-22 10:57:30,099 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 56 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:57:30,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 61 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:57:30,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-22 10:57:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2022-07-22 10:57:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-07-22 10:57:30,107 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 26 [2022-07-22 10:57:30,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:57:30,107 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-07-22 10:57:30,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:30,108 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-07-22 10:57:30,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 10:57:30,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:30,109 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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 10:57:30,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 10:57:30,322 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 10:57:30,323 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:30,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:30,323 INFO L85 PathProgramCache]: Analyzing trace with hash -587916192, now seen corresponding path program 3 times [2022-07-22 10:57:30,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:30,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256023691] [2022-07-22 10:57:30,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:30,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:30,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:57:30,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:30,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256023691] [2022-07-22 10:57:30,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256023691] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:57:30,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510006740] [2022-07-22 10:57:30,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:57:30,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:57:30,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:57:30,408 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 10:57:30,434 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 10:57:30,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 10:57:30,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:57:30,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:57:30,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:57:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:57:30,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:57:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:57:30,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510006740] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:57:30,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:57:30,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-22 10:57:30,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881305803] [2022-07-22 10:57:30,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:57:30,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 10:57:30,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:57:30,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 10:57:30,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-22 10:57:30,555 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:30,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:57:30,677 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-07-22 10:57:30,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:57:30,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-22 10:57:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:57:30,678 INFO L225 Difference]: With dead ends: 63 [2022-07-22 10:57:30,678 INFO L226 Difference]: Without dead ends: 50 [2022-07-22 10:57:30,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-22 10:57:30,680 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 60 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:57:30,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 53 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:57:30,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-22 10:57:30,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2022-07-22 10:57:30,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:30,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-07-22 10:57:30,685 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2022-07-22 10:57:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:57:30,685 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-07-22 10:57:30,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:57:30,686 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-07-22 10:57:30,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 10:57:30,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:57:30,686 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:57:30,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 10:57:30,907 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 10:57:30,907 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:57:30,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:57:30,908 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2022-07-22 10:57:30,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:57:30,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465230427] [2022-07-22 10:57:30,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:57:30,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:57:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:57:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:32,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:57:32,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465230427] [2022-07-22 10:57:32,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465230427] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:57:32,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854552133] [2022-07-22 10:57:32,000 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:57:32,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:57:32,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:57:32,002 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 10:57:32,010 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 10:57:32,064 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:57:32,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:57:32,066 WARN L261 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-22 10:57:32,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:57:32,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,101 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 18 treesize of output 16 [2022-07-22 10:57:32,113 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 11 treesize of output 7 [2022-07-22 10:57:32,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 10:57:32,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-22 10:57:32,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-22 10:57:32,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-07-22 10:57:32,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:57:32,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:32,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2022-07-22 10:57:33,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:33,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:33,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:33,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2022-07-22 10:57:33,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:33,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:33,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:57:33,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:33,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:57:33,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 53 [2022-07-22 10:57:33,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:33,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:33,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:33,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:33,497 INFO L356 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2022-07-22 10:57:33,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 66 [2022-07-22 10:57:33,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:33,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:57:33,700 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 10:57:33,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2022-07-22 10:57:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:57:33,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:57:35,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_229 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) is different from false [2022-07-22 10:57:48,384 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_75| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_75|)) (forall ((v_ArrVal_221 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (v_ArrVal_229 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)) (= (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_221)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse2 .cse3))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))))) is different from false [2022-07-22 10:57:50,416 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_221 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_75| Int) (v_ArrVal_229 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_75|)) (= (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_221)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)))) is different from false [2022-07-22 10:57:51,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_221 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_75| Int) (v_ArrVal_229 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_75|)) (= (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_221)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse3))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)))) is different from false [2022-07-22 10:59:04,978 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:59:07,021 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_75| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_75|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_221 Int) (v_ArrVal_229 Int)) (<= (select (store (let ((.cse4 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse6 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_221))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse3))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 3 |c_ULTIMATE.start_main_~i~0#1|))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_75| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_75|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)) (forall ((v_ArrVal_221 Int) (v_ArrVal_229 Int)) (<= (+ 3 |c_ULTIMATE.start_main_~i~0#1|) (select (store (let ((.cse11 (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse13 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_221))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse7 (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))))) (store (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse8 .cse9 (select (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse10))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) is different from false [2022-07-22 11:00:45,363 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 11:00:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-22 11:00:45,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854552133] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:00:45,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:00:45,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 60 [2022-07-22 11:00:45,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469025508] [2022-07-22 11:00:45,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:00:45,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-22 11:00:45,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:00:45,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-22 11:00:45,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=2617, Unknown=87, NotChecked=550, Total=3540 [2022-07-22 11:00:45,399 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 60 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:00:50,002 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (<= c_~N~0 2) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_75| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_75|)) (forall ((v_ArrVal_221 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (v_ArrVal_229 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)) (= (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_221)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse2 (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse3 .cse4))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (< 1 c_~N~0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) 1) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ |c_ULTIMATE.start_main_~b~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-22 11:00:54,320 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (select .cse4 .cse1))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (+ c_~N~0 1)) (.cse5 (+ (- 2) .cse3))) (and (<= c_~N~0 .cse0) (<= c_~N~0 2) (= .cse1 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= .cse2 .cse3) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (< (+ |ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (* |c_ULTIMATE.start_main_~i~0#1| 4)) 1))) (= (select .cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse5) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (< 1 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse0 c_~N~0) (= (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse3 .cse2) (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_229 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) (= .cse5 1))))) is different from false [2022-07-22 11:00:58,393 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~N~0 2) (= 3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< 1 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_229 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (< (+ |ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-07-22 11:01:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:01:02,577 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2022-07-22 11:01:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-22 11:01:02,577 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 11:01:02,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:01:02,578 INFO L225 Difference]: With dead ends: 68 [2022-07-22 11:01:02,578 INFO L226 Difference]: Without dead ends: 66 [2022-07-22 11:01:02,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1395 ImplicationChecksByTransitivity, 209.5s TimeCoverageRelationStatistics Valid=370, Invalid=3350, Unknown=94, NotChecked=1016, Total=4830 [2022-07-22 11:01:02,580 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 550 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:01:02,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 158 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 290 Invalid, 0 Unknown, 550 Unchecked, 0.2s Time] [2022-07-22 11:01:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-22 11:01:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2022-07-22 11:01:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:01:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-07-22 11:01:02,590 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 32 [2022-07-22 11:01:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:01:02,590 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-07-22 11:01:02,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:01:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-07-22 11:01:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 11:01:02,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:01:02,592 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:01:02,614 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 11:01:02,811 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 11:01:02,811 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:01:02,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:01:02,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1696042328, now seen corresponding path program 5 times [2022-07-22 11:01:02,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:01:02,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016751549] [2022-07-22 11:01:02,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:01:02,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:01:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:01:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 11:01:02,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:01:02,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016751549] [2022-07-22 11:01:02,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016751549] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:01:02,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934258818] [2022-07-22 11:01:02,892 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 11:01:02,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:01:02,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:01:02,894 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 11:01:02,895 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 11:01:02,997 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-22 11:01:02,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:01:02,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 11:01:03,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:01:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 11:01:03,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:01:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 11:01:03,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934258818] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:01:03,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:01:03,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-22 11:01:03,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756570485] [2022-07-22 11:01:03,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:01:03,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 11:01:03,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:01:03,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 11:01:03,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-22 11:01:03,101 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:01:03,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:01:03,273 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2022-07-22 11:01:03,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 11:01:03,273 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-22 11:01:03,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:01:03,274 INFO L225 Difference]: With dead ends: 148 [2022-07-22 11:01:03,274 INFO L226 Difference]: Without dead ends: 111 [2022-07-22 11:01:03,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-22 11:01:03,276 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 77 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:01:03,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 90 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:01:03,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-22 11:01:03,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 83. [2022-07-22 11:01:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.1219512195121952) internal successors, (92), 82 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:01:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2022-07-22 11:01:03,287 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 34 [2022-07-22 11:01:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:01:03,288 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2022-07-22 11:01:03,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:01:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2022-07-22 11:01:03,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 11:01:03,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:01:03,289 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:01:03,316 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 11:01:03,514 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 11:01:03,514 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:01:03,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:01:03,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1205583320, now seen corresponding path program 6 times [2022-07-22 11:01:03,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:01:03,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997051347] [2022-07-22 11:01:03,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:01:03,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:01:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:01:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 11:01:03,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:01:03,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997051347] [2022-07-22 11:01:03,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997051347] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:01:03,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698754228] [2022-07-22 11:01:03,574 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 11:01:03,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:01:03,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:01:03,575 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 11:01:03,576 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 11:01:03,651 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-22 11:01:03,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:01:03,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 11:01:03,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:01:03,725 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 11:01:03,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:01:03,761 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 11:01:03,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698754228] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:01:03,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:01:03,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-22 11:01:03,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304461677] [2022-07-22 11:01:03,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:01:03,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 11:01:03,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:01:03,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 11:01:03,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-22 11:01:03,764 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:01:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:01:03,999 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2022-07-22 11:01:03,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 11:01:03,999 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-22 11:01:04,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:01:04,000 INFO L225 Difference]: With dead ends: 112 [2022-07-22 11:01:04,000 INFO L226 Difference]: Without dead ends: 91 [2022-07-22 11:01:04,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-22 11:01:04,001 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 124 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:01:04,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 101 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 11:01:04,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-22 11:01:04,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 68. [2022-07-22 11:01:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:01:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2022-07-22 11:01:04,010 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 34 [2022-07-22 11:01:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:01:04,010 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2022-07-22 11:01:04,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:01:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-07-22 11:01:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-22 11:01:04,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:01:04,012 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:01:04,035 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 11:01:04,235 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 11:01:04,236 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:01:04,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:01:04,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2022-07-22 11:01:04,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:01:04,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803830505] [2022-07-22 11:01:04,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:01:04,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:01:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:01:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 11:01:05,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:01:05,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803830505] [2022-07-22 11:01:05,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803830505] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:01:05,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502107595] [2022-07-22 11:01:05,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:01:05,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:01:05,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:01:05,012 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 11:01:05,039 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 11:01:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:01:05,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 81 conjunts are in the unsatisfiable core [2022-07-22 11:01:05,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:01:05,108 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 11 treesize of output 7 [2022-07-22 11:01:05,119 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 11:01:05,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-07-22 11:01:05,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 11:01:05,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:05,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-22 11:01:05,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:05,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-22 11:01:05,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:05,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:05,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2022-07-22 11:01:05,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 11:01:05,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:05,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:05,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2022-07-22 11:01:05,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:05,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:05,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2022-07-22 11:01:06,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:06,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 11:01:06,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 11:01:06,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:06,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2022-07-22 11:01:06,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:06,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:06,136 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 11:01:06,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 59 [2022-07-22 11:01:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:01:06,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:01:09,196 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:01:09,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502107595] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:01:09,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:01:09,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 63 [2022-07-22 11:01:09,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042990862] [2022-07-22 11:01:09,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:01:09,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-22 11:01:09,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:01:09,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-22 11:01:09,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=3438, Unknown=0, NotChecked=0, Total=3906 [2022-07-22 11:01:09,199 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 63 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 63 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:01:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:01:16,717 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2022-07-22 11:01:16,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-22 11:01:16,717 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 63 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-22 11:01:16,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:01:16,718 INFO L225 Difference]: With dead ends: 102 [2022-07-22 11:01:16,718 INFO L226 Difference]: Without dead ends: 75 [2022-07-22 11:01:16,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2780 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1436, Invalid=8266, Unknown=0, NotChecked=0, Total=9702 [2022-07-22 11:01:16,722 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 110 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:01:16,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 206 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 927 Invalid, 0 Unknown, 128 Unchecked, 1.0s Time] [2022-07-22 11:01:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-22 11:01:16,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 49. [2022-07-22 11:01:16,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:01:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-07-22 11:01:16,730 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 36 [2022-07-22 11:01:16,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:01:16,730 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-07-22 11:01:16,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 63 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:01:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-07-22 11:01:16,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-22 11:01:16,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:01:16,731 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:01:16,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 11:01:16,956 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 11:01:16,956 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:01:16,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:01:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221586, now seen corresponding path program 7 times [2022-07-22 11:01:16,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:01:16,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971753618] [2022-07-22 11:01:16,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:01:16,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:01:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:01:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:01:18,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:01:18,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971753618] [2022-07-22 11:01:18,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971753618] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:01:18,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657495312] [2022-07-22 11:01:18,587 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 11:01:18,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:01:18,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:01:18,588 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 11:01:18,589 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 11:01:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:01:18,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-22 11:01:18,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:01:18,682 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 11 treesize of output 7 [2022-07-22 11:01:18,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:18,690 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 11:01:18,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2022-07-22 11:01:18,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 11:01:18,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:18,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-07-22 11:01:18,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:18,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:18,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:18,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-22 11:01:19,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-07-22 11:01:19,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-07-22 11:01:19,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-07-22 11:01:19,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 11:01:19,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2022-07-22 11:01:19,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:19,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 11:01:19,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2022-07-22 11:01:20,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:20,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:20,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:20,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:20,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2022-07-22 11:01:20,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:20,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:20,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 11:01:20,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:20,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 11:01:20,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:20,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 73 [2022-07-22 11:01:20,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:20,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:20,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:20,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:20,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:20,554 INFO L356 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-07-22 11:01:20,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 84 [2022-07-22 11:01:20,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:20,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:20,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:21,092 INFO L356 Elim1Store]: treesize reduction 332, result has 22.8 percent of original size [2022-07-22 11:01:21,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 121 treesize of output 166 [2022-07-22 11:01:21,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 11:01:21,847 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 11:01:21,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 36 [2022-07-22 11:01:21,897 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:01:21,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:01:24,062 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((v_ArrVal_520 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_146|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_520) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)))) is different from false [2022-07-22 11:01:24,494 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_520 Int) (v_ArrVal_517 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_517) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_146|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_520) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) is different from false [2022-07-22 11:01:26,504 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_520 Int) (v_ArrVal_517 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) v_ArrVal_517) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_146|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_520) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_147|)))) is different from false [2022-07-22 11:01:28,527 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_520 Int) (v_ArrVal_517 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) v_ArrVal_517) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_146|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_520) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_147|)))) is different from false [2022-07-22 11:01:43,453 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_154| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_154|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_520 Int) (v_ArrVal_507 Int) (v_ArrVal_517 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_147|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (= (select (store (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_154| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_507)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) v_ArrVal_517) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_146|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_520) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))))) is different from false [2022-07-22 11:01:45,498 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_520 Int) (|v_ULTIMATE.start_main_~i~0#1_154| Int) (v_ArrVal_507 Int) (v_ArrVal_517 Int) (v_ArrVal_505 Int)) (or (= (select (store (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_505) (+ (* |v_ULTIMATE.start_main_~i~0#1_154| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_507)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse1 .cse2 .cse3 .cse4)))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) v_ArrVal_517) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_146|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_520) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_154|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_147|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)))) is different from false [2022-07-22 11:01:47,546 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_155| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_520 Int) (|v_ULTIMATE.start_main_~i~0#1_154| Int) (v_ArrVal_507 Int) (v_ArrVal_517 Int) (v_ArrVal_505 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_147|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_155| 1) |v_ULTIMATE.start_main_~i~0#1_154|)) (= (select (store (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_155| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_505) (+ (* |v_ULTIMATE.start_main_~i~0#1_154| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_507)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse1 .cse2 .cse3 .cse4)))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) v_ArrVal_517) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_146|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_520) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_155|)))) is different from false [2022-07-22 11:01:49,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_520 Int) (|v_ULTIMATE.start_main_~i~0#1_154| Int) (|v_ULTIMATE.start_main_~i~0#1_155| Int) (v_ArrVal_507 Int) (v_ArrVal_517 Int) (v_ArrVal_505 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_147|)) (= (select (store (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_155| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_505) (+ (* |v_ULTIMATE.start_main_~i~0#1_154| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_507)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse1 .cse2 .cse3 .cse4)))))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) v_ArrVal_517) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_146|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_520) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_155| 1) |v_ULTIMATE.start_main_~i~0#1_154|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_155|)))) is different from false