./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/mods.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/mods.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 f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:08:22,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:08:22,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:08:22,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:08:22,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:08:22,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:08:22,325 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:08:22,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:08:22,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:08:22,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:08:22,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:08:22,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:08:22,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:08:22,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:08:22,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:08:22,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:08:22,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:08:22,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:08:22,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:08:22,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:08:22,354 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:08:22,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:08:22,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:08:22,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:08:22,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:08:22,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:08:22,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:08:22,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:08:22,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:08:22,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:08:22,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:08:22,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:08:22,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:08:22,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:08:22,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:08:22,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:08:22,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:08:22,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:08:22,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:08:22,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:08:22,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:08:22,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:08:22,373 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:08:22,401 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:08:22,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:08:22,402 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:08:22,402 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:08:22,402 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:08:22,403 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:08:22,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:08:22,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:08:22,404 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:08:22,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:08:22,404 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:08:22,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:08:22,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:08:22,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:08:22,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:08:22,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:08:22,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:08:22,405 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:08:22,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:08:22,406 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:08:22,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:08:22,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:08:22,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:08:22,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:08:22,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:08:22,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:08:22,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:08:22,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:08:22,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:08:22,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:08:22,408 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:08:22,408 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:08:22,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:08:22,408 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 -> f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba [2022-07-13 11:08:22,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:08:22,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:08:22,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:08:22,614 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:08:22,614 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:08:22,615 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/mods.c [2022-07-13 11:08:22,674 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afcb2211e/011880a7dde742aaa105171e53a4364d/FLAG1cf58c8a2 [2022-07-13 11:08:23,044 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:08:23,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c [2022-07-13 11:08:23,049 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afcb2211e/011880a7dde742aaa105171e53a4364d/FLAG1cf58c8a2 [2022-07-13 11:08:23,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afcb2211e/011880a7dde742aaa105171e53a4364d [2022-07-13 11:08:23,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:08:23,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:08:23,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:08:23,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:08:23,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:08:23,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:08:23" (1/1) ... [2022-07-13 11:08:23,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b71be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:08:23, skipping insertion in model container [2022-07-13 11:08:23,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:08:23" (1/1) ... [2022-07-13 11:08:23,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:08:23,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:08:23,625 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/mods.c[587,600] [2022-07-13 11:08:23,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:08:23,647 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:08:23,658 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/mods.c[587,600] [2022-07-13 11:08:23,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:08:23,676 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:08:23,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:08:23 WrapperNode [2022-07-13 11:08:23,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:08:23,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:08:23,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:08:23,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:08:23,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:08:23" (1/1) ... [2022-07-13 11:08:23,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:08:23" (1/1) ... [2022-07-13 11:08:23,715 INFO L137 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2022-07-13 11:08:23,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:08:23,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:08:23,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:08:23,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:08:23,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:08:23" (1/1) ... [2022-07-13 11:08:23,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:08:23" (1/1) ... [2022-07-13 11:08:23,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:08:23" (1/1) ... [2022-07-13 11:08:23,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:08:23" (1/1) ... [2022-07-13 11:08:23,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:08:23" (1/1) ... [2022-07-13 11:08:23,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:08:23" (1/1) ... [2022-07-13 11:08:23,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:08:23" (1/1) ... [2022-07-13 11:08:23,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:08:23,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:08:23,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:08:23,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:08:23,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:08:23" (1/1) ... [2022-07-13 11:08:23,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:08:23,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:08:23,780 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-13 11:08:23,807 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-13 11:08:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:08:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:08:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 11:08:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:08:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:08:23,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:08:23,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:08:23,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:08:23,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 11:08:23,889 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:08:23,890 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:08:24,073 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:08:24,079 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:08:24,079 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-13 11:08:24,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:08:24 BoogieIcfgContainer [2022-07-13 11:08:24,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:08:24,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:08:24,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:08:24,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:08:24,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:08:23" (1/3) ... [2022-07-13 11:08:24,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336df1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:08:24, skipping insertion in model container [2022-07-13 11:08:24,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:08:23" (2/3) ... [2022-07-13 11:08:24,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336df1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:08:24, skipping insertion in model container [2022-07-13 11:08:24,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:08:24" (3/3) ... [2022-07-13 11:08:24,089 INFO L111 eAbstractionObserver]: Analyzing ICFG mods.c [2022-07-13 11:08:24,102 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:08:24,102 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:08:24,157 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:08:24,164 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@43608a3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1cecfdc7 [2022-07-13 11:08:24,165 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:08:24,176 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-13 11:08:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:08:24,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:08:24,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:08:24,182 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:08:24,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:08:24,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2022-07-13 11:08:24,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:08:24,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543823715] [2022-07-13 11:08:24,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:08:24,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:08:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:08:24,324 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-13 11:08:24,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:08:24,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543823715] [2022-07-13 11:08:24,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543823715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:08:24,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:08:24,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:08:24,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466782515] [2022-07-13 11:08:24,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:08:24,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 11:08:24,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:08:24,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 11:08:24,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:08:24,368 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-13 11:08:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:08:24,385 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-07-13 11:08:24,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 11:08:24,388 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-13 11:08:24,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:08:24,395 INFO L225 Difference]: With dead ends: 50 [2022-07-13 11:08:24,396 INFO L226 Difference]: Without dead ends: 23 [2022-07-13 11:08:24,400 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-13 11:08:24,404 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-13 11:08:24,405 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-13 11:08:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-13 11:08:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-13 11:08:24,432 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-13 11:08:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-13 11:08:24,435 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-07-13 11:08:24,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:08:24,435 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-13 11:08:24,436 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-13 11:08:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-13 11:08:24,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:08:24,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:08:24,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:08:24,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:08:24,438 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:08:24,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:08:24,439 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2022-07-13 11:08:24,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:08:24,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856417509] [2022-07-13 11:08:24,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:08:24,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:08:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:08:24,557 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-13 11:08:24,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:08:24,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856417509] [2022-07-13 11:08:24,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856417509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:08:24,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:08:24,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:08:24,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747922778] [2022-07-13 11:08:24,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:08:24,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:08:24,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:08:24,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:08:24,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:08:24,562 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-13 11:08:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:08:24,626 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-07-13 11:08:24,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:08:24,626 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-13 11:08:24,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:08:24,627 INFO L225 Difference]: With dead ends: 53 [2022-07-13 11:08:24,627 INFO L226 Difference]: Without dead ends: 37 [2022-07-13 11:08:24,628 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-13 11:08:24,629 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-13 11:08:24,630 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-13 11:08:24,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-13 11:08:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-07-13 11:08:24,635 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-13 11:08:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-13 11:08:24,636 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-07-13 11:08:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:08:24,636 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-13 11:08:24,636 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-13 11:08:24,637 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-13 11:08:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 11:08:24,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:08:24,638 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-13 11:08:24,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:08:24,638 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:08:24,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:08:24,639 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2022-07-13 11:08:24,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:08:24,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316084547] [2022-07-13 11:08:24,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:08:24,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:08:24,716 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:08:24,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1720770232] [2022-07-13 11:08:24,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:08:24,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:08:24,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:08:24,723 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-13 11:08:24,766 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-13 11:08:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:08:24,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-13 11:08:24,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:08:24,875 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 10 treesize of output 8 [2022-07-13 11:08:24,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-13 11:08:24,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-13 11:08:25,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-07-13 11:08:25,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-07-13 11:08:25,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 68 [2022-07-13 11:08:25,407 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-13 11:08:25,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:08:26,020 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-13 11:08:26,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:08:26,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316084547] [2022-07-13 11:08:26,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:08:26,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720770232] [2022-07-13 11:08:26,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720770232] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:08:26,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:08:26,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-07-13 11:08:26,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679885771] [2022-07-13 11:08:26,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:08:26,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 11:08:26,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:08:26,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 11:08:26,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-07-13 11:08:26,025 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 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-13 11:08:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:08:26,901 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-07-13 11:08:26,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 11:08:26,904 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 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 24 [2022-07-13 11:08:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:08:26,905 INFO L225 Difference]: With dead ends: 50 [2022-07-13 11:08:26,905 INFO L226 Difference]: Without dead ends: 48 [2022-07-13 11:08:26,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2022-07-13 11:08:26,906 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:08:26,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 128 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 214 Invalid, 0 Unknown, 11 Unchecked, 0.6s Time] [2022-07-13 11:08:26,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-13 11:08:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2022-07-13 11:08:26,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 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-13 11:08:26,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-07-13 11:08:26,923 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 24 [2022-07-13 11:08:26,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:08:26,924 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-07-13 11:08:26,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 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-13 11:08:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-07-13 11:08:26,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 11:08:26,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:08:26,925 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-13 11:08:26,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 11:08:27,148 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-13 11:08:27,148 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:08:27,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:08:27,149 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2022-07-13 11:08:27,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:08:27,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199206848] [2022-07-13 11:08:27,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:08:27,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:08:27,172 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:08:27,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848247382] [2022-07-13 11:08:27,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:08:27,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:08:27,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:08:27,177 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-13 11:08:27,184 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-13 11:08:27,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:08:27,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:08:27,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:08:27,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:08:27,283 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-13 11:08:27,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:08:27,312 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-13 11:08:27,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:08:27,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199206848] [2022-07-13 11:08:27,313 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:08:27,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848247382] [2022-07-13 11:08:27,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848247382] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:08:27,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:08:27,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-13 11:08:27,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961050876] [2022-07-13 11:08:27,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:08:27,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:08:27,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:08:27,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:08:27,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:08:27,315 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-13 11:08:27,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:08:27,457 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2022-07-13 11:08:27,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:08:27,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-13 11:08:27,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:08:27,458 INFO L225 Difference]: With dead ends: 106 [2022-07-13 11:08:27,459 INFO L226 Difference]: Without dead ends: 61 [2022-07-13 11:08:27,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:08:27,467 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:08:27,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 55 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:08:27,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-13 11:08:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2022-07-13 11:08:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 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-13 11:08:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-07-13 11:08:27,478 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 26 [2022-07-13 11:08:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:08:27,478 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-07-13 11:08:27,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-13 11:08:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-07-13 11:08:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 11:08:27,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:08:27,479 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:08:27,499 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-13 11:08:27,687 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-13 11:08:27,688 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:08:27,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:08:27,688 INFO L85 PathProgramCache]: Analyzing trace with hash -756951010, now seen corresponding path program 3 times [2022-07-13 11:08:27,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:08:27,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896880798] [2022-07-13 11:08:27,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:08:27,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:08:27,708 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:08:27,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [101103552] [2022-07-13 11:08:27,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:08:27,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:08:27,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:08:27,710 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-13 11:08:27,712 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-13 11:08:27,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 11:08:27,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:08:27,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:08:27,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:08:27,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:08:27,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:08:27,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:08:27,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:08:27,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896880798] [2022-07-13 11:08:27,857 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:08:27,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101103552] [2022-07-13 11:08:27,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101103552] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:08:27,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:08:27,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-13 11:08:27,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178213323] [2022-07-13 11:08:27,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:08:27,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:08:27,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:08:27,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:08:27,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:08:27,860 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-13 11:08:27,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:08:27,979 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-07-13 11:08:27,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:08:27,980 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 28 [2022-07-13 11:08:27,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:08:27,981 INFO L225 Difference]: With dead ends: 59 [2022-07-13 11:08:27,982 INFO L226 Difference]: Without dead ends: 50 [2022-07-13 11:08:27,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:08:27,984 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 74 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:08:27,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 38 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:08:27,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-13 11:08:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2022-07-13 11:08:27,992 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-13 11:08:27,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-07-13 11:08:27,993 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2022-07-13 11:08:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:08:27,994 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-07-13 11:08:27,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-13 11:08:27,994 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-07-13 11:08:27,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 11:08:27,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:08:27,995 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-13 11:08:28,020 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-13 11:08:28,196 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-13 11:08:28,196 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:08:28,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:08:28,197 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2022-07-13 11:08:28,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:08:28,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775105956] [2022-07-13 11:08:28,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:08:28,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:08:28,218 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:08:28,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1444618373] [2022-07-13 11:08:28,231 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:08:28,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:08:28,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:08:28,233 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-13 11:08:28,235 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-13 11:08:28,292 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:08:28,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:08:28,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-13 11:08:28,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:08:28,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:08:28,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:08:28,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 11:08:28,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:08:28,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:08:28,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-13 11:08:28,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:08:28,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:08:28,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:08:28,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2022-07-13 11:08:28,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:08:28,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:08:28,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2022-07-13 11:08:28,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:08:28,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:08:28,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:08:28,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2022-07-13 11:08:28,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:08:28,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:08:28,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:08:28,748 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-13 11:08:28,749 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 1 case distinctions, treesize of input 53 treesize of output 54 [2022-07-13 11:08:28,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:08:28,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:08:28,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 129 [2022-07-13 11:08:28,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:08:28,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:08:28,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2022-07-13 11:08:29,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:08:29,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 29 [2022-07-13 11:08:29,120 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-13 11:08:29,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:08:31,227 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)) (forall ((v_ArrVal_191 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) is different from false [2022-07-13 11:08:33,533 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (let ((.cse14 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse3 (< .cse14 0)) (.cse13 (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|)))) (let ((.cse9 (< .cse13 0)) (.cse8 (= (mod .cse13 .cse14) 0)) (.cse7 (not .cse3))) (and (or (and (or (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse0 (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|))) (store .cse0 .cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (- 1) (mod (select .cse0 .cse1) (+ .cse2 1)) (* (- 1) .cse2))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse3) (or (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse4 .cse5 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse6 (mod (select .cse4 .cse5) (+ .cse6 1)) 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse7)) .cse8 (not .cse9)) (or (and .cse9 (not .cse8)) (let ((.cse10 (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse11 .cse12 (mod (select .cse11 .cse12) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (and (or .cse7 .cse10) (or .cse3 .cse10)))))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)))) is different from false [2022-07-13 11:08:56,552 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_182 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (not (<= (+ (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_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_182)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_71|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_68|)) (and (forall ((v_ArrVal_186 Int)) (or (< (+ (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) 0) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse2 (store (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_186 Int)) (or (not (< (+ (select (select (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) 0)) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse7 (store (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_186 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse12 (store (let ((.cse13 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse10 0)) (= (mod .cse10 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))))))))) is different from false [2022-07-13 11:10:43,980 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_179 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (let ((.cse21 (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_179))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_71|)) (not (<= (+ v_ArrVal_180 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_180)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_182)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_68|)) (and (forall ((v_ArrVal_186 Int)) (let ((.cse3 (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|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_179)))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182))))) (let ((.cse4 (store (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse2 0)) (= (mod .cse2 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))))) (forall ((v_ArrVal_186 Int)) (or (< (+ (select (select (let ((.cse7 (let ((.cse9 (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|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_179)))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182))))) (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) 0) (forall ((v_ArrVal_191 Int)) (= (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|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_179)))) (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182))))) (let ((.cse10 (store (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_186 Int)) (or (not (< (+ (select (select (let ((.cse14 (let ((.cse16 (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|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_179)))) (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182))))) (store .cse14 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) 0)) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse18 (let ((.cse20 (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|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_179)))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182))))) (let ((.cse17 (store (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse18 |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (not (<= 1 v_ArrVal_179)) (not (<= (+ (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_180))))))) is different from false [2022-07-13 11:10:47,612 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_179 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (let ((.cse1 (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|) v_ArrVal_179))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1))) (let ((.cse0 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_180)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_71|)) (and (forall ((v_ArrVal_186 Int)) (or (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse3 (let ((.cse5 (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|) v_ArrVal_179)))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182))))) (let ((.cse2 (store (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (< (+ (select (select (let ((.cse6 (let ((.cse8 (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|) v_ArrVal_179)))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182))))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) 0)))) (forall ((v_ArrVal_186 Int)) (let ((.cse10 (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|) v_ArrVal_179)))) (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182))))) (let ((.cse11 (store (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse9 0)) (= (mod .cse9 (+ (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))))) (forall ((v_ArrVal_186 Int)) (or (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse15 (let ((.cse17 (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|) v_ArrVal_179)))) (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182))))) (let ((.cse14 (store (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (< (+ (select (select (let ((.cse18 (let ((.cse20 (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|) v_ArrVal_179)))) (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182))))) (store .cse18 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) 0)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_68|)) (not (<= (+ v_ArrVal_180 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_180)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_182)) (not (<= 1 v_ArrVal_179))))))) is different from false [2022-07-13 11:11:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-13 11:11:21,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:11:21,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775105956] [2022-07-13 11:11:21,901 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:11:21,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444618373] [2022-07-13 11:11:21,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444618373] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:11:21,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:11:21,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2022-07-13 11:11:21,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378862831] [2022-07-13 11:11:21,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:11:21,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-13 11:11:21,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:11:21,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-13 11:11:21,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=743, Unknown=65, NotChecked=310, Total=1260 [2022-07-13 11:11:21,908 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 36 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 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-13 11:11:39,055 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_71|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_68|)) (not (<= (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_180)) (not (<= (+ v_ArrVal_180 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_180)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_182)) (and (forall ((v_ArrVal_186 Int)) (or (< (+ (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) 0) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse3 (store (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_186 Int)) (or (not (< (+ (select (select (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) 0)) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse8 (store (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_186 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse13 (store (let ((.cse14 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse11 0)) (= (mod .cse11 (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse16 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (or (not (<= (+ (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_180)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_71|)) (not (<= (+ v_ArrVal_180 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_180)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_182)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_68|)) (and (forall ((v_ArrVal_186 Int)) (or (< (+ (select (select (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) 0) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse19 (store (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (store .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse19) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_186 Int)) (or (not (< (+ (select (select (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) 0)) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse24 (store (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (store .cse24 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse25 |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_186 Int)) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse29 (store (let ((.cse30 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse27 0)) (= (mod .cse27 (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))))))))))) is different from false [2022-07-13 11:12:02,542 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (+ (- 1) .cse0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 3 .cse0) (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (forall ((v_ArrVal_186 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_68|)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (let ((.cse2 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse4 (< .cse2 0)) (.cse5 (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse6 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (and (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse1 .cse2) 0) (not (< .cse1 0)))) (or (not .cse4) .cse5) (or .cse4 .cse5))))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_71|)))))) is different from false [2022-07-13 11:12:06,806 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (<= 2 .cse0) (= (let ((.cse1 (+ .cse0 1))) (mod .cse1 .cse1)) (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|)))) (<= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)) (forall ((v_ArrVal_191 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-13 11:12:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:12:06,853 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2022-07-13 11:12:06,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-13 11:12:06,854 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 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-13 11:12:06,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:12:06,856 INFO L225 Difference]: With dead ends: 85 [2022-07-13 11:12:06,856 INFO L226 Difference]: Without dead ends: 83 [2022-07-13 11:12:06,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 206.1s TimeCoverageRelationStatistics Valid=188, Invalid=1022, Unknown=82, NotChecked=600, Total=1892 [2022-07-13 11:12:06,857 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 538 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:12:06,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 205 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 174 Invalid, 0 Unknown, 538 Unchecked, 0.2s Time] [2022-07-13 11:12:06,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-13 11:12:06,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2022-07-13 11:12:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 71 states have internal predecessors, (83), 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-13 11:12:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2022-07-13 11:12:06,879 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 32 [2022-07-13 11:12:06,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:12:06,880 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2022-07-13 11:12:06,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 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-13 11:12:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-07-13 11:12:06,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 11:12:06,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:12:06,881 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-13 11:12:06,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 11:12:07,082 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-13 11:12:07,082 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:12:07,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:12:07,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2147373800, now seen corresponding path program 5 times [2022-07-13 11:12:07,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:12:07,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461571950] [2022-07-13 11:12:07,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:12:07,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:12:07,101 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:12:07,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1322488356] [2022-07-13 11:12:07,102 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:12:07,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:12:07,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:12:07,103 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-13 11:12:07,107 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-13 11:12:07,221 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-13 11:12:07,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:12:07,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:12:07,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:12:07,284 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-13 11:12:07,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:12:07,328 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-13 11:12:07,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:12:07,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461571950] [2022-07-13 11:12:07,329 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:12:07,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322488356] [2022-07-13 11:12:07,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322488356] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:12:07,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:12:07,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-07-13 11:12:07,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729136635] [2022-07-13 11:12:07,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:12:07,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 11:12:07,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:12:07,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 11:12:07,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:12:07,331 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 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-13 11:12:07,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:12:07,519 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2022-07-13 11:12:07,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:12:07,519 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 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 34 [2022-07-13 11:12:07,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:12:07,520 INFO L225 Difference]: With dead ends: 159 [2022-07-13 11:12:07,521 INFO L226 Difference]: Without dead ends: 124 [2022-07-13 11:12:07,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:12:07,522 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 107 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:12:07,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 63 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:12:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-13 11:12:07,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 91. [2022-07-13 11:12:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.1333333333333333) internal successors, (102), 90 states have internal predecessors, (102), 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-13 11:12:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2022-07-13 11:12:07,538 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 34 [2022-07-13 11:12:07,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:12:07,538 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2022-07-13 11:12:07,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 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-13 11:12:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-07-13 11:12:07,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 11:12:07,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:12:07,539 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-13 11:12:07,565 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-13 11:12:07,755 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-13 11:12:07,756 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:12:07,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:12:07,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2022-07-13 11:12:07,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:12:07,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885806095] [2022-07-13 11:12:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:12:07,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:12:07,777 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:12:07,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2061656470] [2022-07-13 11:12:07,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:12:07,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:12:07,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:12:07,794 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-13 11:12:07,795 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-13 11:12:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:12:07,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-13 11:12:07,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:12:07,864 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-13 11:12:07,868 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 10 treesize of output 8 [2022-07-13 11:12:07,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 11:12:07,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:07,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-13 11:12:07,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:07,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:07,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-07-13 11:12:08,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:08,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2022-07-13 11:12:08,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:08,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:08,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 43 [2022-07-13 11:12:08,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:08,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 39 [2022-07-13 11:12:08,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:08,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:08,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 105 [2022-07-13 11:12:08,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:08,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-07-13 11:12:08,662 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 0 case distinctions, treesize of input 54 treesize of output 30 [2022-07-13 11:12:08,691 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-13 11:12:08,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:12:17,856 WARN L233 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 76 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 11:12:43,049 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-13 11:12:43,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:12:43,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885806095] [2022-07-13 11:12:43,049 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:12:43,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061656470] [2022-07-13 11:12:43,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061656470] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:12:43,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:12:43,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2022-07-13 11:12:43,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968413810] [2022-07-13 11:12:43,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:12:43,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-13 11:12:43,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:12:43,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-13 11:12:43,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1386, Unknown=1, NotChecked=0, Total=1722 [2022-07-13 11:12:43,052 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 42 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 42 states have internal predecessors, (66), 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-13 11:12:49,109 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse90 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse26 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (+ .cse90 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse48 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select .cse26 .cse27))) (let ((.cse31 (+ .cse8 .cse9))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse31))) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse39 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (+ .cse8 1)) (.cse35 (+ .cse8 .cse39)) (.cse37 (select .cse26 .cse6)) (.cse23 (store .cse26 .cse27 1)) (.cse7 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse24 (+ .cse90 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (let ((.cse4 (+ .cse8 .cse9 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse4))) (let ((.cse1 (+ (select .cse7 .cse6) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse3 (store .cse5 .cse6 .cse1))) (let ((.cse0 (mod .cse4 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse0 0)) (= (mod .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))))))) (let ((.cse22 (store .cse23 .cse24 1))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse18 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse11 (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18 .cse19))))) (let ((.cse16 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse14 (+ .cse17 .cse18 .cse19 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| .cse14))) (let ((.cse10 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse16 .cse6)))) (let ((.cse12 (store .cse15 .cse6 .cse10))) (let ((.cse13 (mod .cse14 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse10 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| .cse13)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse13 0))))))))))))))) (let ((.cse25 (store .cse26 .cse27 (mod .cse9 .cse28)))) (or (= (select .cse25 .cse6) 0) (not (= (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (let ((.cse30 (store .cse26 .cse27 .cse31))) (let ((.cse29 (mod (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse29 0)) (= (mod (select .cse30 .cse6) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| .cse29)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))) (let ((.cse36 (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| .cse35))) (let ((.cse32 (+ .cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse33 (store .cse36 .cse6 .cse32))) (let ((.cse34 (mod .cse35 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= 0 (mod .cse32 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~a~0#1.offset| .cse34)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (not (= .cse34 0))))))) (let ((.cse38 (mod .cse39 .cse28))) (or (not (= .cse38 0)) (= (mod .cse37 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| .cse38)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (let ((.cse47 (select .cse26 .cse24))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse47))))) (let ((.cse46 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse44 (+ .cse8 .cse47 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse45 (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| .cse44))) (let ((.cse40 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse46 .cse6)))) (let ((.cse42 (store .cse45 .cse6 .cse40))) (let ((.cse43 (mod .cse44 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse40 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~a~0#1.offset| .cse43)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse43 0))))))))))) (let ((.cse56 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse35)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse56 .cse39))))) (let ((.cse55 (select .cse51 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse53 (+ .cse8 .cse56 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse39))) (let ((.cse54 (store .cse55 |c_ULTIMATE.start_main_~a~0#1.offset| .cse53))) (let ((.cse50 (+ (select .cse55 .cse6) (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse52 (store .cse54 .cse6 .cse50))) (let ((.cse49 (mod .cse53 (+ (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| .cse52) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse49 0)) (= (mod .cse50 (+ (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~a~0#1.offset| .cse49)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))))))))) (or (not (= 0 .cse39)) (= .cse37 0)) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse64 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse66 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse65 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse58 (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse65 .cse66))))) (let ((.cse63 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse61 (+ .cse64 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse65 .cse66))) (let ((.cse62 (store .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| .cse61))) (let ((.cse57 (+ (select .cse63 .cse6) (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| .cse62) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse59 (store .cse62 .cse6 .cse57))) (let ((.cse60 (mod .cse61 (+ (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| .cse59) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse57 (+ (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~a~0#1.offset| .cse60)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse60 0)))))))))))))) (let ((.cse81 (store .cse26 .cse24 1))) (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse81))) (let ((.cse80 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse76 (select .cse81 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse78 (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse77 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse71 (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77 .cse78))))) (let ((.cse75 (select .cse71 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse73 (+ (select .cse75 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse76 .cse77 .cse78))) (let ((.cse74 (store .cse75 |c_ULTIMATE.start_main_~a~0#1.offset| .cse73))) (let ((.cse70 (+ (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| .cse74) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse75 .cse6)))) (let ((.cse72 (store .cse74 .cse6 .cse70))) (let ((.cse69 (mod .cse73 (+ (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| .cse72) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse69 0)) (= (mod .cse70 (+ (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~a~0#1.offset| .cse69)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))))))))))))) (let ((.cse89 (select .cse7 .cse24))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse89))))) (let ((.cse88 (select .cse84 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse86 (+ .cse8 .cse9 (select .cse88 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse89))) (let ((.cse87 (store .cse88 |c_ULTIMATE.start_main_~a~0#1.offset| .cse86))) (let ((.cse83 (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| .cse87) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse88 .cse6)))) (let ((.cse85 (store .cse87 .cse6 .cse83))) (let ((.cse82 (mod .cse86 (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| .cse85) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse82 0)) (= (mod .cse83 (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~a~0#1.offset| .cse82)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))))))))))))))))) is different from false [2022-07-13 11:13:05,075 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse57 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse22 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse55 (+ .cse57 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse19 (select .cse17 .cse55)) (.cse21 (+ .cse22 1))) (let ((.cse15 (+ .cse57 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse56 (mod .cse19 .cse21))) (let ((.cse16 (store .cse17 .cse55 .cse56)) (.cse14 (store .cse17 .cse55 1)) (.cse25 (= .cse56 0)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse24 (< .cse19 0)) (.cse18 (select .cse17 .cse15))) (and (let ((.cse13 (store .cse14 .cse15 1))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse1 (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))))) (let ((.cse7 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (+ .cse8 .cse9 .cse10 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse4))) (let ((.cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 .cse6)))) (let ((.cse2 (store .cse5 .cse6 .cse0))) (let ((.cse3 (mod .cse4 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| .cse3)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse3 0))))))))))))))) (or (= (select .cse16 .cse6) 0) (not (= (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 3 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) (or (= .cse18 0) (not (= .cse19 0))) (let ((.cse20 (store .cse17 .cse15 (mod .cse18 .cse21)))) (or (not (= (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse20 .cse6) 0))) (= .cse22 2) (let ((.cse23 (store .cse16 .cse15 (mod .cse18 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (or (= (select .cse23 .cse6) 0) (not (= (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (and .cse24 (not .cse25)))) (let ((.cse27 (store .cse17 .cse15 (+ .cse22 .cse18)))) (let ((.cse26 (mod (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse27) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse26 0)) (= (mod (select .cse27 .cse6) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| .cse26)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))) (= (select .cse17 .cse6) .cse21) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse35 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse37 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse36 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse29 (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36 .cse37))))) (let ((.cse34 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse32 (+ .cse35 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse36 .cse37))) (let ((.cse33 (store .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| .cse32))) (let ((.cse28 (+ (select .cse34 .cse6) (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse30 (store .cse33 .cse6 .cse28))) (let ((.cse31 (mod .cse32 (+ (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse28 (+ (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse31 0)))))))))))))) (let ((.cse52 (store .cse17 .cse15 1))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse52))) (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse47 (select .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse49 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse48 (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse42 (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48 .cse49))))) (let ((.cse46 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse44 (+ (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse47 .cse48 .cse49))) (let ((.cse45 (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| .cse44))) (let ((.cse41 (+ (select (select (store .cse42 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse46 .cse6)))) (let ((.cse43 (store .cse45 .cse6 .cse41))) (let ((.cse40 (mod .cse44 (+ (select (select (store .cse42 |c_ULTIMATE.start_main_~a~0#1.base| .cse43) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse40 0)) (= (mod .cse41 (+ (select (select (store .cse42 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~a~0#1.offset| .cse40)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))))))))))))) (let ((.cse53 (let ((.cse54 (store .cse17 .cse55 (+ .cse22 .cse56 1)))) (store .cse54 .cse15 (mod .cse18 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))) (or .cse25 (= (select .cse53 .cse6) 0) (not .cse24) (not (= (select .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))))))) is different from true