./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/sina4.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 933eff495d93b07d12af9180ab5b75cc35fb173187f8af9883307194e1e7fea3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:33:39,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:33:39,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:33:39,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:33:39,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:33:39,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:33:39,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:33:39,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:33:39,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:33:39,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:33:39,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:33:39,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:33:39,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:33:39,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:33:39,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:33:39,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:33:39,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:33:39,384 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:33:39,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:33:39,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:33:39,393 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:33:39,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:33:39,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:33:39,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:33:39,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:33:39,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:33:39,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:33:39,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:33:39,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:33:39,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:33:39,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:33:39,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:33:39,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:33:39,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:33:39,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:33:39,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:33:39,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:33:39,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:33:39,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:33:39,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:33:39,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:33:39,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:33:39,413 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:33:39,447 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:33:39,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:33:39,448 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:33:39,449 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:33:39,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:33:39,449 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:33:39,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:33:39,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:33:39,450 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:33:39,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:33:39,451 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:33:39,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:33:39,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:33:39,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:33:39,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:33:39,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:33:39,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:33:39,453 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:33:39,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:33:39,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:33:39,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:33:39,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:33:39,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:33:39,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:33:39,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:33:39,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:33:39,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:33:39,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:33:39,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:33:39,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:33:39,455 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:33:39,455 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:33:39,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:33:39,456 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 -> 933eff495d93b07d12af9180ab5b75cc35fb173187f8af9883307194e1e7fea3 [2022-07-11 23:33:39,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:33:39,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:33:39,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:33:39,739 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:33:39,740 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:33:39,741 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina4.c [2022-07-11 23:33:39,806 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e84a69e98/8eb4bd54412f415e97aa8b115d772efe/FLAG0a63c4bf8 [2022-07-11 23:33:40,225 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:33:40,226 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina4.c [2022-07-11 23:33:40,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e84a69e98/8eb4bd54412f415e97aa8b115d772efe/FLAG0a63c4bf8 [2022-07-11 23:33:40,624 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e84a69e98/8eb4bd54412f415e97aa8b115d772efe [2022-07-11 23:33:40,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:33:40,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:33:40,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:33:40,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:33:40,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:33:40,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:33:40" (1/1) ... [2022-07-11 23:33:40,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@720ed271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:33:40, skipping insertion in model container [2022-07-11 23:33:40,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:33:40" (1/1) ... [2022-07-11 23:33:40,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:33:40,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:33:40,786 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/sina4.c[588,601] [2022-07-11 23:33:40,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:33:40,819 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:33:40,829 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/sina4.c[588,601] [2022-07-11 23:33:40,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:33:40,847 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:33:40,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:33:40 WrapperNode [2022-07-11 23:33:40,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:33:40,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:33:40,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:33:40,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:33:40,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:33:40" (1/1) ... [2022-07-11 23:33:40,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:33:40" (1/1) ... [2022-07-11 23:33:40,878 INFO L137 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2022-07-11 23:33:40,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:33:40,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:33:40,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:33:40,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:33:40,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:33:40" (1/1) ... [2022-07-11 23:33:40,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:33:40" (1/1) ... [2022-07-11 23:33:40,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:33:40" (1/1) ... [2022-07-11 23:33:40,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:33:40" (1/1) ... [2022-07-11 23:33:40,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:33:40" (1/1) ... [2022-07-11 23:33:40,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:33:40" (1/1) ... [2022-07-11 23:33:40,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:33:40" (1/1) ... [2022-07-11 23:33:40,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:33:40,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:33:40,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:33:40,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:33:40,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:33:40" (1/1) ... [2022-07-11 23:33:40,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:33:40,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:33:40,933 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-11 23:33:40,939 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-11 23:33:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:33:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:33:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 23:33:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:33:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:33:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:33:40,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:33:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:33:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 23:33:41,041 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:33:41,042 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:33:41,204 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:33:41,209 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:33:41,209 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-11 23:33:41,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:33:41 BoogieIcfgContainer [2022-07-11 23:33:41,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:33:41,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:33:41,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:33:41,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:33:41,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:33:40" (1/3) ... [2022-07-11 23:33:41,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295d467d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:33:41, skipping insertion in model container [2022-07-11 23:33:41,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:33:40" (2/3) ... [2022-07-11 23:33:41,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295d467d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:33:41, skipping insertion in model container [2022-07-11 23:33:41,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:33:41" (3/3) ... [2022-07-11 23:33:41,218 INFO L111 eAbstractionObserver]: Analyzing ICFG sina4.c [2022-07-11 23:33:41,229 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:33:41,230 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:33:41,265 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:33:41,271 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@4c57e185, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50cbf120 [2022-07-11 23:33:41,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:33:41,274 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-11 23:33:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-11 23:33:41,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:41,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:33:41,282 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:41,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:41,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2022-07-11 23:33:41,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:41,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407419388] [2022-07-11 23:33:41,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:41,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:41,425 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-11 23:33:41,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:33:41,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407419388] [2022-07-11 23:33:41,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407419388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:33:41,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:33:41,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:33:41,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952532367] [2022-07-11 23:33:41,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:33:41,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:33:41,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:33:41,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:33:41,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:33:41,465 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-11 23:33:41,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:33:41,480 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-07-11 23:33:41,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:33:41,482 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-11 23:33:41,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:33:41,487 INFO L225 Difference]: With dead ends: 50 [2022-07-11 23:33:41,487 INFO L226 Difference]: Without dead ends: 23 [2022-07-11 23:33:41,490 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-11 23:33:41,494 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-11 23:33:41,495 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-11 23:33:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-11 23:33:41,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-11 23:33:41,518 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-11 23:33:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-11 23:33:41,520 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-07-11 23:33:41,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:33:41,520 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-11 23:33:41,521 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-11 23:33:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-11 23:33:41,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-11 23:33:41,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:41,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:33:41,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:33:41,522 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:41,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:41,523 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2022-07-11 23:33:41,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:41,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868112568] [2022-07-11 23:33:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:41,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:41,600 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-11 23:33:41,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:33:41,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868112568] [2022-07-11 23:33:41,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868112568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:33:41,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:33:41,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:33:41,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524903803] [2022-07-11 23:33:41,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:33:41,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:33:41,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:33:41,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:33:41,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:33:41,603 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-11 23:33:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:33:41,663 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-07-11 23:33:41,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:33:41,663 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-11 23:33:41,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:33:41,664 INFO L225 Difference]: With dead ends: 53 [2022-07-11 23:33:41,664 INFO L226 Difference]: Without dead ends: 37 [2022-07-11 23:33:41,665 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-11 23:33:41,666 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-11 23:33:41,667 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-11 23:33:41,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-11 23:33:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-07-11 23:33:41,673 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-11 23:33:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-11 23:33:41,674 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-07-11 23:33:41,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:33:41,674 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-11 23:33:41,674 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-11 23:33:41,675 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-11 23:33:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-11 23:33:41,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:41,675 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-11 23:33:41,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:33:41,676 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:41,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2022-07-11 23:33:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:41,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859164648] [2022-07-11 23:33:41,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:41,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:42,369 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-11 23:33:42,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:33:42,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859164648] [2022-07-11 23:33:42,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859164648] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:33:42,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631788937] [2022-07-11 23:33:42,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:42,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:42,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:33:42,376 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-11 23:33:42,411 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-11 23:33:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:42,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-11 23:33:42,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:33:42,583 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-11 23:33:42,600 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-11 23:33:42,633 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-11 23:33:42,777 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 36 treesize of output 23 [2022-07-11 23:33:42,905 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-11 23:33:43,130 INFO L356 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2022-07-11 23:33:43,131 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 2 case distinctions, treesize of input 40 treesize of output 46 [2022-07-11 23:33:49,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:33:49,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 70 [2022-07-11 23:33:49,041 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-11 23:33:49,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:33:51,113 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.base| Int)) (= (select (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2))) is different from false [2022-07-11 23:33:51,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:33:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-11 23:33:51,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631788937] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:33:51,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:33:51,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2022-07-11 23:33:51,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52757030] [2022-07-11 23:33:51,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:33:51,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-11 23:33:51,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:33:51,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-11 23:33:51,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=916, Unknown=1, NotChecked=62, Total=1122 [2022-07-11 23:33:51,430 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 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-11 23:33:58,414 WARN L233 SmtUtils]: Spent 6.70s on a formula simplification. DAG size of input: 43 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:33:58,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:33:58,457 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-07-11 23:33:58,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-11 23:33:58,458 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 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-11 23:33:58,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:33:58,459 INFO L225 Difference]: With dead ends: 53 [2022-07-11 23:33:58,459 INFO L226 Difference]: Without dead ends: 51 [2022-07-11 23:33:58,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=178, Invalid=1085, Unknown=1, NotChecked=68, Total=1332 [2022-07-11 23:33:58,460 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:33:58,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 130 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 276 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2022-07-11 23:33:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-11 23:33:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2022-07-11 23:33:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-07-11 23:33:58,468 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2022-07-11 23:33:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:33:58,468 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-07-11 23:33:58,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 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-11 23:33:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-07-11 23:33:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-11 23:33:58,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:58,470 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-11 23:33:58,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:33:58,671 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-11 23:33:58,671 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:58,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2022-07-11 23:33:58,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:58,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684100919] [2022-07-11 23:33:58,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:58,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:58,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:33:58,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:33:58,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684100919] [2022-07-11 23:33:58,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684100919] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:33:58,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287412942] [2022-07-11 23:33:58,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:33:58,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:58,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:33:58,760 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-11 23:33:58,769 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-11 23:33:58,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:33:58,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:33:58,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:33:58,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:33:58,888 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-11 23:33:58,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:33:58,922 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-11 23:33:58,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287412942] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:33:58,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:33:58,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-11 23:33:58,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219928884] [2022-07-11 23:33:58,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:33:58,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:33:58,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:33:58,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:33:58,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:33:58,927 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:59,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:33:59,080 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-07-11 23:33:59,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:33:59,080 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-11 23:33:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:33:59,081 INFO L225 Difference]: With dead ends: 101 [2022-07-11 23:33:59,081 INFO L226 Difference]: Without dead ends: 66 [2022-07-11 23:33:59,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-11 23:33:59,083 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 69 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:33:59,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 56 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:33:59,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-11 23:33:59,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2022-07-11 23:33:59,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-07-11 23:33:59,090 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 26 [2022-07-11 23:33:59,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:33:59,090 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-07-11 23:33:59,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-07-11 23:33:59,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-11 23:33:59,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:59,091 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-11 23:33:59,119 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-11 23:33:59,307 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-11 23:33:59,307 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:59,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash -587916192, now seen corresponding path program 3 times [2022-07-11 23:33:59,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:59,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939584688] [2022-07-11 23:33:59,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:59,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:33:59,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:33:59,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939584688] [2022-07-11 23:33:59,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939584688] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:33:59,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645265462] [2022-07-11 23:33:59,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:33:59,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:59,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:33:59,384 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-11 23:33:59,407 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-11 23:33:59,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-11 23:33:59,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:33:59,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:33:59,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:33:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:33:59,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:33:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:33:59,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645265462] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:33:59,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:33:59,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-11 23:33:59,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660468008] [2022-07-11 23:33:59,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:33:59,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:33:59,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:33:59,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:33:59,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:33:59,538 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:33:59,668 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-07-11 23:33:59,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:33:59,668 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-11 23:33:59,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:33:59,669 INFO L225 Difference]: With dead ends: 63 [2022-07-11 23:33:59,669 INFO L226 Difference]: Without dead ends: 50 [2022-07-11 23:33:59,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-11 23:33:59,670 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 91 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:33:59,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 42 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:33:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-11 23:33:59,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2022-07-11 23:33:59,674 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-11 23:33:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-07-11 23:33:59,675 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2022-07-11 23:33:59,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:33:59,675 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-07-11 23:33:59,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:33:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-07-11 23:33:59,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-11 23:33:59,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:59,676 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-11 23:33:59,701 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-11 23:33:59,876 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-11 23:33:59,877 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:59,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:59,877 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2022-07-11 23:33:59,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:59,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433690079] [2022-07-11 23:33:59,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:59,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:34:01,111 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-11 23:34:01,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:34:01,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433690079] [2022-07-11 23:34:01,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433690079] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:34:01,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244160687] [2022-07-11 23:34:01,112 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:34:01,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:34:01,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:34:01,120 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-11 23:34:01,121 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-11 23:34:01,187 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:34:01,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:34:01,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-11 23:34:01,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:34:01,202 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-11 23:34:01,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:01,278 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-11 23:34:01,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:01,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:01,386 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 30 treesize of output 32 [2022-07-11 23:34:01,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:01,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:01,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:01,630 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-11 23:34:01,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:01,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:01,767 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 55 treesize of output 39 [2022-07-11 23:34:01,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:01,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:01,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:01,962 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 70 treesize of output 46 [2022-07-11 23:34:02,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:02,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:02,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:02,129 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-11 23:34:02,129 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 66 treesize of output 63 [2022-07-11 23:34:02,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:02,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:02,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:02,319 INFO L356 Elim1Store]: treesize reduction 38, result has 46.5 percent of original size [2022-07-11 23:34:02,319 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 3 case distinctions, treesize of input 38 treesize of output 52 [2022-07-11 23:34:02,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:02,641 INFO L356 Elim1Store]: treesize reduction 136, result has 27.3 percent of original size [2022-07-11 23:34:02,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 70 treesize of output 117 [2022-07-11 23:34:03,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:34:03,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 83 treesize of output 163 [2022-07-11 23:34:03,372 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-11 23:34:03,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:34:05,540 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_227 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) is different from false [2022-07-11 23:34:07,559 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_227 Int)) (or (= (+ c_~N~0 2) (select (store (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) is different from false [2022-07-11 23:34:09,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (forall ((v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_227 Int)) (or (= (+ c_~N~0 2) (select (store (let ((.cse0 (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_72| 8)) v_ArrVal_223))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_72|)))) is different from false [2022-07-11 23:34:10,416 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_72| Int) (v_ArrVal_227 Int)) (or (= (+ c_~N~0 2) (select (store (let ((.cse0 (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse2)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_72| 8)) v_ArrVal_223))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_72|)))) is different from false [2022-07-11 23:34:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-11 23:34:12,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244160687] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:34:12,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:34:12,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 22] total 64 [2022-07-11 23:34:12,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122212471] [2022-07-11 23:34:12,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:34:12,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-07-11 23:34:12,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:34:12,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-07-11 23:34:12,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=3250, Unknown=4, NotChecked=476, Total=4032 [2022-07-11 23:34:12,191 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 64 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:34:14,490 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (<= c_~N~0 2) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (forall ((v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_227 Int)) (or (= (+ c_~N~0 2) (select (store (let ((.cse1 (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_72| 8)) v_ArrVal_223))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_72|)))) (or (< 2 c_~N~0) (let ((.cse3 (select .cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse2 (+ c_~N~0 1))) (and (<= .cse2 .cse3) (<= .cse3 .cse2)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select .cse5 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (= (+ (* .cse4 2) (* (- 1) (select .cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* (- 1) .cse6)) 0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (+ (* (- 1) .cse4) .cse6) 1))))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (< 1 c_~N~0) (<= 2 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-11 23:34:16,614 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse0 (+ c_~N~0 2))) (and (<= c_~N~0 2) (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_227 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= .cse0 .cse1) (< 1 c_~N~0) (or (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (< (+ |ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~b~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (* 8 |c_ULTIMATE.start_main_~i~0#1|)) 3))) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (* 8 |c_ULTIMATE.start_main_~i~0#1|)) 3) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (< (+ |ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2)))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (< (+ |c_ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 4) (<= .cse1 .cse0))) is different from false [2022-07-11 23:34:18,804 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse0 (+ c_~N~0 2))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_227 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= .cse0 .cse1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse1 .cse0))) is different from false [2022-07-11 23:34:18,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:34:18,839 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-07-11 23:34:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-11 23:34:18,839 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-11 23:34:18,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:34:18,841 INFO L225 Difference]: With dead ends: 81 [2022-07-11 23:34:18,841 INFO L226 Difference]: Without dead ends: 79 [2022-07-11 23:34:18,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1636 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=357, Invalid=3824, Unknown=7, NotChecked=924, Total=5112 [2022-07-11 23:34:18,844 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 510 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:34:18,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 182 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 252 Invalid, 0 Unknown, 510 Unchecked, 0.2s Time] [2022-07-11 23:34:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-11 23:34:18,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 52. [2022-07-11 23:34:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 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-11 23:34:18,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-07-11 23:34:18,852 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 32 [2022-07-11 23:34:18,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:34:18,852 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-07-11 23:34:18,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:34:18,853 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-07-11 23:34:18,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:34:18,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:34:18,854 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-11 23:34:18,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:34:19,067 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-11 23:34:19,067 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:34:19,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:34:19,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2147373800, now seen corresponding path program 5 times [2022-07-11 23:34:19,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:34:19,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911564168] [2022-07-11 23:34:19,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:34:19,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:34:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:34:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 23:34:19,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:34:19,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911564168] [2022-07-11 23:34:19,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911564168] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:34:19,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679014470] [2022-07-11 23:34:19,140 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:34:19,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:34:19,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:34:19,143 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-11 23:34:19,155 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-11 23:34:19,276 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-11 23:34:19,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:34:19,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:34:19,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:34:19,352 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-11 23:34:19,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:34:19,396 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-11 23:34:19,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679014470] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:34:19,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:34:19,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-11 23:34:19,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272503756] [2022-07-11 23:34:19,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:34:19,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:34:19,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:34:19,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:34:19,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:34:19,400 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:34:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:34:19,549 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2022-07-11 23:34:19,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:34:19,550 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-11 23:34:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:34:19,551 INFO L225 Difference]: With dead ends: 129 [2022-07-11 23:34:19,551 INFO L226 Difference]: Without dead ends: 105 [2022-07-11 23:34:19,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:34:19,553 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 130 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:34:19,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 64 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:34:19,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-11 23:34:19,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2022-07-11 23:34:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.131578947368421) internal successors, (86), 76 states have internal predecessors, (86), 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-11 23:34:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-07-11 23:34:19,564 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 34 [2022-07-11 23:34:19,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:34:19,565 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-07-11 23:34:19,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:34:19,565 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-07-11 23:34:19,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-11 23:34:19,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:34:19,566 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-11 23:34:19,587 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-11 23:34:19,775 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-11 23:34:19,776 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:34:19,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:34:19,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2022-07-11 23:34:19,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:34:19,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808612940] [2022-07-11 23:34:19,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:34:19,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:34:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:34:21,066 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-11 23:34:21,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:34:21,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808612940] [2022-07-11 23:34:21,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808612940] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:34:21,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130288874] [2022-07-11 23:34:21,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:34:21,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:34:21,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:34:21,069 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-11 23:34:21,069 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-11 23:34:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:34:21,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-11 23:34:21,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:34:21,140 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-11 23:34:21,145 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-11 23:34:21,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2022-07-11 23:34:21,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:34:21,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:21,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-11 23:34:21,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:21,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:21,424 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:21,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 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-11 23:34:21,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:21,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:21,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:21,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2022-07-11 23:34:21,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:21,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:21,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 46 [2022-07-11 23:34:21,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:21,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:21,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:21,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 46 [2022-07-11 23:34:22,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:22,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:22,097 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-11 23:34:22,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 65 [2022-07-11 23:34:22,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:22,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:22,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:22,282 INFO L356 Elim1Store]: treesize reduction 51, result has 27.1 percent of original size [2022-07-11 23:34:22,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 57 [2022-07-11 23:34:22,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:22,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:22,769 INFO L356 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2022-07-11 23:34:22,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 38 [2022-07-11 23:34:22,813 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-11 23:34:22,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:34:26,315 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-11 23:34:26,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130288874] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:34:26,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:34:26,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 23] total 66 [2022-07-11 23:34:26,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051142266] [2022-07-11 23:34:26,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:34:26,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-11 23:34:26,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:34:26,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-11 23:34:26,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=3975, Unknown=0, NotChecked=0, Total=4290 [2022-07-11 23:34:26,318 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 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-11 23:34:32,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:34:32,090 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-07-11 23:34:32,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-11 23:34:32,091 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-11 23:34:32,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:34:32,091 INFO L225 Difference]: With dead ends: 126 [2022-07-11 23:34:32,091 INFO L226 Difference]: Without dead ends: 81 [2022-07-11 23:34:32,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2341 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=707, Invalid=7849, Unknown=0, NotChecked=0, Total=8556 [2022-07-11 23:34:32,094 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:34:32,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 236 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 285 Invalid, 0 Unknown, 149 Unchecked, 0.4s Time] [2022-07-11 23:34:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-11 23:34:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-07-11 23:34:32,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.1375) internal successors, (91), 80 states have internal predecessors, (91), 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-11 23:34:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2022-07-11 23:34:32,105 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 36 [2022-07-11 23:34:32,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:34:32,105 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2022-07-11 23:34:32,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 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-11 23:34:32,105 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2022-07-11 23:34:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-11 23:34:32,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:34:32,106 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:34:32,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-11 23:34:32,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:34:32,315 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:34:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:34:32,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1245131882, now seen corresponding path program 6 times [2022-07-11 23:34:32,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:34:32,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153705430] [2022-07-11 23:34:32,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:34:32,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:34:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:34:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-11 23:34:32,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:34:32,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153705430] [2022-07-11 23:34:32,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153705430] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:34:32,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847662725] [2022-07-11 23:34:32,381 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 23:34:32,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:34:32,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:34:32,384 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:34:32,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-11 23:34:32,472 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-11 23:34:32,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:34:32,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:34:32,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:34:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-11 23:34:32,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:34:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-11 23:34:32,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847662725] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:34:32,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:34:32,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-11 23:34:32,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645697886] [2022-07-11 23:34:32,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:34:32,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:34:32,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:34:32,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:34:32,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:34:32,582 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:34:32,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:34:32,765 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2022-07-11 23:34:32,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:34:32,765 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-11 23:34:32,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:34:32,766 INFO L225 Difference]: With dead ends: 104 [2022-07-11 23:34:32,766 INFO L226 Difference]: Without dead ends: 74 [2022-07-11 23:34:32,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-11 23:34:32,767 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 101 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:34:32,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 71 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:34:32,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-11 23:34:32,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 43. [2022-07-11 23:34:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:34:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-07-11 23:34:32,773 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 36 [2022-07-11 23:34:32,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:34:32,773 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-07-11 23:34:32,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:34:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-07-11 23:34:32,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-11 23:34:32,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:34:32,774 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:34:32,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-11 23:34:32,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:34:33,000 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:34:33,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:34:33,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221586, now seen corresponding path program 7 times [2022-07-11 23:34:33,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:34:33,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000374512] [2022-07-11 23:34:33,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:34:33,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:34:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:34:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:34:34,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:34:34,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000374512] [2022-07-11 23:34:34,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000374512] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:34:34,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206627279] [2022-07-11 23:34:34,134 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 23:34:34,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:34:34,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:34:34,135 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:34:34,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-11 23:34:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:34:34,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-11 23:34:34,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:34:34,216 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-11 23:34:34,223 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-11 23:34:34,246 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-11 23:34:34,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-11 23:34:34,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-11 23:34:34,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2022-07-11 23:34:34,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:34,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2022-07-11 23:34:34,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 49 [2022-07-11 23:34:34,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:34,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 61 [2022-07-11 23:34:34,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:34,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:34,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2022-07-11 23:34:35,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:35,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:35,083 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-11 23:34:35,083 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 39 treesize of output 50 [2022-07-11 23:34:35,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:35,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:35,225 INFO L356 Elim1Store]: treesize reduction 38, result has 46.5 percent of original size [2022-07-11 23:34:35,226 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 3 case distinctions, treesize of input 38 treesize of output 52 [2022-07-11 23:34:41,023 WARN L233 SmtUtils]: Spent 5.72s on a formula simplification. DAG size of input: 45 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:34:42,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:42,300 INFO L356 Elim1Store]: treesize reduction 53, result has 26.4 percent of original size [2022-07-11 23:34:42,300 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 62 [2022-07-11 23:34:43,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:43,717 INFO L356 Elim1Store]: treesize reduction 53, result has 26.4 percent of original size [2022-07-11 23:34:43,717 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 62 [2022-07-11 23:34:45,142 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:34:45,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 70 [2022-07-11 23:34:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:34:45,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:34:47,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (forall ((v_ArrVal_519 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|))))) is different from false [2022-07-11 23:34:47,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int)) (or (= (+ c_~N~0 2) (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_149|)))) is different from false [2022-07-11 23:34:49,782 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (= (+ c_~N~0 2) (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) is different from false [2022-07-11 23:34:51,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (= (+ c_~N~0 2) (select (store (store (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)))) is different from false [2022-07-11 23:34:54,478 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (= (+ c_~N~0 2) (select (store (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_153|)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_150|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_153|)))) is different from false