./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ms4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/ms4.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 83260f11871b199c66fbefacd24c95d84ae219136106a5a3246a879f7c60a3e2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 10:48:06,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 10:48:06,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 10:48:06,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 10:48:06,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 10:48:06,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 10:48:06,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 10:48:06,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 10:48:06,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 10:48:06,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 10:48:06,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 10:48:06,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 10:48:06,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 10:48:06,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 10:48:06,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 10:48:06,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 10:48:06,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 10:48:06,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 10:48:06,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 10:48:06,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 10:48:06,984 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 10:48:06,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 10:48:06,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 10:48:06,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 10:48:06,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 10:48:06,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 10:48:06,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 10:48:06,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 10:48:06,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 10:48:06,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 10:48:06,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 10:48:06,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 10:48:06,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 10:48:06,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 10:48:06,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 10:48:06,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 10:48:06,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 10:48:07,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 10:48:07,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 10:48:07,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 10:48:07,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 10:48:07,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 10:48:07,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 10:48:07,021 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 10:48:07,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 10:48:07,022 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 10:48:07,022 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 10:48:07,023 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 10:48:07,023 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 10:48:07,023 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 10:48:07,024 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 10:48:07,024 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 10:48:07,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 10:48:07,025 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 10:48:07,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 10:48:07,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 10:48:07,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 10:48:07,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 10:48:07,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 10:48:07,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 10:48:07,026 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 10:48:07,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 10:48:07,026 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 10:48:07,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 10:48:07,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 10:48:07,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 10:48:07,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 10:48:07,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:48:07,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 10:48:07,028 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 10:48:07,028 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 10:48:07,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 10:48:07,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 10:48:07,029 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 10:48:07,029 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 10:48:07,029 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 10:48:07,030 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 -> 83260f11871b199c66fbefacd24c95d84ae219136106a5a3246a879f7c60a3e2 [2022-07-22 10:48:07,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 10:48:07,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 10:48:07,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 10:48:07,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 10:48:07,277 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 10:48:07,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ms4.c [2022-07-22 10:48:07,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85fbfbfbc/0f23bf240c7945698679942c6ed97a5f/FLAGf43d8c379 [2022-07-22 10:48:07,757 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 10:48:07,757 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ms4.c [2022-07-22 10:48:07,762 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85fbfbfbc/0f23bf240c7945698679942c6ed97a5f/FLAGf43d8c379 [2022-07-22 10:48:07,773 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85fbfbfbc/0f23bf240c7945698679942c6ed97a5f [2022-07-22 10:48:07,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 10:48:07,776 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 10:48:07,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 10:48:07,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 10:48:07,780 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 10:48:07,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:48:07" (1/1) ... [2022-07-22 10:48:07,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af242bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:07, skipping insertion in model container [2022-07-22 10:48:07,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:48:07" (1/1) ... [2022-07-22 10:48:07,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 10:48:07,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 10:48:07,928 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/ms4.c[586,599] [2022-07-22 10:48:07,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:48:07,961 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 10:48:07,976 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/ms4.c[586,599] [2022-07-22 10:48:07,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:48:08,010 INFO L208 MainTranslator]: Completed translation [2022-07-22 10:48:08,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:08 WrapperNode [2022-07-22 10:48:08,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 10:48:08,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 10:48:08,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 10:48:08,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 10:48:08,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:08" (1/1) ... [2022-07-22 10:48:08,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:08" (1/1) ... [2022-07-22 10:48:08,043 INFO L137 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2022-07-22 10:48:08,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 10:48:08,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 10:48:08,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 10:48:08,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 10:48:08,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:08" (1/1) ... [2022-07-22 10:48:08,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:08" (1/1) ... [2022-07-22 10:48:08,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:08" (1/1) ... [2022-07-22 10:48:08,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:08" (1/1) ... [2022-07-22 10:48:08,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:08" (1/1) ... [2022-07-22 10:48:08,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:08" (1/1) ... [2022-07-22 10:48:08,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:08" (1/1) ... [2022-07-22 10:48:08,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 10:48:08,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 10:48:08,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 10:48:08,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 10:48:08,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:08" (1/1) ... [2022-07-22 10:48:08,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:48:08,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:48:08,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 10:48:08,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 10:48:08,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 10:48:08,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 10:48:08,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 10:48:08,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 10:48:08,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 10:48:08,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 10:48:08,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 10:48:08,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 10:48:08,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 10:48:08,187 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 10:48:08,188 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 10:48:08,289 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 10:48:08,294 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 10:48:08,295 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 10:48:08,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:48:08 BoogieIcfgContainer [2022-07-22 10:48:08,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 10:48:08,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 10:48:08,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 10:48:08,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 10:48:08,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:48:07" (1/3) ... [2022-07-22 10:48:08,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6883e648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:48:08, skipping insertion in model container [2022-07-22 10:48:08,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:08" (2/3) ... [2022-07-22 10:48:08,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6883e648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:48:08, skipping insertion in model container [2022-07-22 10:48:08,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:48:08" (3/3) ... [2022-07-22 10:48:08,305 INFO L111 eAbstractionObserver]: Analyzing ICFG ms4.c [2022-07-22 10:48:08,317 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 10:48:08,318 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 10:48:08,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 10:48:08,385 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@4b91b4c0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@39e8c62a [2022-07-22 10:48:08,386 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 10:48:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 10:48:08,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:08,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:08,416 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:08,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:08,423 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2022-07-22 10:48:08,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:48:08,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534534130] [2022-07-22 10:48:08,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:08,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:48:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:08,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:08,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534534130] [2022-07-22 10:48:08,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534534130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:48:08,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:48:08,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 10:48:08,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573812764] [2022-07-22 10:48:08,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:48:08,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 10:48:08,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:48:08,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 10:48:08,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:48:08,659 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:08,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:08,674 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-07-22 10:48:08,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 10:48:08,677 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2022-07-22 10:48:08,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:08,685 INFO L225 Difference]: With dead ends: 34 [2022-07-22 10:48:08,686 INFO L226 Difference]: Without dead ends: 15 [2022-07-22 10:48:08,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:48:08,695 INFO L413 NwaCegarLoop]: 22 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, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:08,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:48:08,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-22 10:48:08,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-22 10:48:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-22 10:48:08,726 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-07-22 10:48:08,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:08,726 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-22 10:48:08,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-07-22 10:48:08,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 10:48:08,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:08,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:08,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 10:48:08,729 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:08,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2022-07-22 10:48:08,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:48:08,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94261789] [2022-07-22 10:48:08,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:08,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:48:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:08,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:08,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94261789] [2022-07-22 10:48:08,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94261789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:48:08,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:48:08,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 10:48:08,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42082210] [2022-07-22 10:48:08,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:48:08,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 10:48:08,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:48:08,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 10:48:08,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:48:08,856 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:08,950 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-07-22 10:48:08,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 10:48:08,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-07-22 10:48:08,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:08,952 INFO L225 Difference]: With dead ends: 28 [2022-07-22 10:48:08,952 INFO L226 Difference]: Without dead ends: 20 [2022-07-22 10:48:08,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:48:08,954 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:08,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 11 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:48:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-22 10:48:08,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-22 10:48:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:08,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-07-22 10:48:08,959 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2022-07-22 10:48:08,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:08,959 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-07-22 10:48:08,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:08,960 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-07-22 10:48:08,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 10:48:08,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:08,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:08,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 10:48:08,961 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:08,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:08,962 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2022-07-22 10:48:08,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:48:08,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780527841] [2022-07-22 10:48:08,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:08,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:48:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:48:09,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:09,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780527841] [2022-07-22 10:48:09,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780527841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:48:09,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:48:09,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 10:48:09,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785395184] [2022-07-22 10:48:09,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:48:09,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 10:48:09,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:48:09,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 10:48:09,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 10:48:09,064 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:09,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:09,105 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-07-22 10:48:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 10:48:09,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-22 10:48:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:09,106 INFO L225 Difference]: With dead ends: 25 [2022-07-22 10:48:09,106 INFO L226 Difference]: Without dead ends: 21 [2022-07-22 10:48:09,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-22 10:48:09,108 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:09,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 25 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:48:09,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-22 10:48:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-07-22 10:48:09,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:09,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-07-22 10:48:09,115 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2022-07-22 10:48:09,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:09,116 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-07-22 10:48:09,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:09,116 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-07-22 10:48:09,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 10:48:09,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:09,118 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:09,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 10:48:09,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:09,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:09,119 INFO L85 PathProgramCache]: Analyzing trace with hash -422196611, now seen corresponding path program 1 times [2022-07-22 10:48:09,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:48:09,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893024191] [2022-07-22 10:48:09,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:09,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:48:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:09,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:09,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893024191] [2022-07-22 10:48:09,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893024191] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:48:09,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734657098] [2022-07-22 10:48:09,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:09,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:09,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:48:09,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:48:09,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 10:48:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:09,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:48:09,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:48:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:09,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:48:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:09,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734657098] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:48:09,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:48:09,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-22 10:48:09,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160134220] [2022-07-22 10:48:09,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:48:09,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 10:48:09,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:48:09,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 10:48:09,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-22 10:48:09,472 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:09,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:09,552 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-07-22 10:48:09,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:48:09,552 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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) Word has length 19 [2022-07-22 10:48:09,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:09,555 INFO L225 Difference]: With dead ends: 39 [2022-07-22 10:48:09,555 INFO L226 Difference]: Without dead ends: 25 [2022-07-22 10:48:09,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-22 10:48:09,562 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:09,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 22 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:48:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-22 10:48:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-07-22 10:48:09,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-07-22 10:48:09,570 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2022-07-22 10:48:09,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:09,571 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-22 10:48:09,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-07-22 10:48:09,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-22 10:48:09,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:09,573 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:09,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 10:48:09,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:09,788 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:09,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:09,788 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 2 times [2022-07-22 10:48:09,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:48:09,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230148508] [2022-07-22 10:48:09,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:09,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:48:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:10,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:10,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230148508] [2022-07-22 10:48:10,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230148508] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:48:10,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182328490] [2022-07-22 10:48:10,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:48:10,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:10,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:48:10,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:48:10,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 10:48:10,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:48:10,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:48:10,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 10:48:10,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:48:10,445 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 13 treesize of output 9 [2022-07-22 10:48:10,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:10,527 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 21 treesize of output 20 [2022-07-22 10:48:10,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:10,617 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-22 10:48:10,618 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 1 case distinctions, treesize of input 45 treesize of output 39 [2022-07-22 10:48:10,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:10,861 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-07-22 10:48:10,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 13 [2022-07-22 10:48:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:10,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:48:15,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 106 [2022-07-22 10:48:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:15,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182328490] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:48:15,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:48:15,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2022-07-22 10:48:15,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178735652] [2022-07-22 10:48:15,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:48:15,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-22 10:48:15,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:48:15,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-22 10:48:15,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=888, Unknown=3, NotChecked=0, Total=1056 [2022-07-22 10:48:15,772 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:16,332 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-07-22 10:48:16,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 10:48:16,332 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-22 10:48:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:16,333 INFO L225 Difference]: With dead ends: 40 [2022-07-22 10:48:16,333 INFO L226 Difference]: Without dead ends: 29 [2022-07-22 10:48:16,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=318, Invalid=1571, Unknown=3, NotChecked=0, Total=1892 [2022-07-22 10:48:16,335 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:16,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 74 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 200 Invalid, 0 Unknown, 77 Unchecked, 0.1s Time] [2022-07-22 10:48:16,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-22 10:48:16,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-07-22 10:48:16,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-07-22 10:48:16,339 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-07-22 10:48:16,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:16,339 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-07-22 10:48:16,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:16,339 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-07-22 10:48:16,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 10:48:16,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:16,340 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:16,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 10:48:16,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:16,541 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:16,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:16,541 INFO L85 PathProgramCache]: Analyzing trace with hash -301520475, now seen corresponding path program 3 times [2022-07-22 10:48:16,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:48:16,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723303675] [2022-07-22 10:48:16,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:16,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:48:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:16,601 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:16,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:16,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723303675] [2022-07-22 10:48:16,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723303675] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:48:16,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421972090] [2022-07-22 10:48:16,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:48:16,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:16,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:48:16,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:48:16,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 10:48:16,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-22 10:48:16,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:48:16,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 10:48:16,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:48:16,730 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:16,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:48:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:16,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421972090] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:48:16,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:48:16,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-22 10:48:16,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719098656] [2022-07-22 10:48:16,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:48:16,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 10:48:16,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:48:16,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 10:48:16,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:48:16,762 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:16,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:16,838 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-07-22 10:48:16,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 10:48:16,839 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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) Word has length 24 [2022-07-22 10:48:16,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:16,841 INFO L225 Difference]: With dead ends: 56 [2022-07-22 10:48:16,841 INFO L226 Difference]: Without dead ends: 39 [2022-07-22 10:48:16,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:48:16,843 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:16,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 35 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:48:16,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-22 10:48:16,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2022-07-22 10:48:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-07-22 10:48:16,851 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2022-07-22 10:48:16,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:16,851 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-07-22 10:48:16,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-07-22 10:48:16,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 10:48:16,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:16,853 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:16,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-22 10:48:17,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:17,074 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:17,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:17,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1384678109, now seen corresponding path program 4 times [2022-07-22 10:48:17,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:48:17,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684861037] [2022-07-22 10:48:17,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:17,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:48:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:17,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:17,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684861037] [2022-07-22 10:48:17,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684861037] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:48:17,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453414546] [2022-07-22 10:48:17,514 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:48:17,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:17,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:48:17,520 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:48:17,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 10:48:17,578 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:48:17,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:48:17,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-22 10:48:17,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:48:17,636 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 15 treesize of output 11 [2022-07-22 10:48:17,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:17,692 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-22 10:48:17,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:17,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:17,784 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-22 10:48:17,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:17,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:17,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:17,885 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 54 treesize of output 42 [2022-07-22 10:48:17,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:17,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2022-07-22 10:48:18,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:18,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2022-07-22 10:48:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:18,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:49:04,870 WARN L233 SmtUtils]: Spent 34.47s on a formula simplification. DAG size of input: 58 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:49:24,605 WARN L233 SmtUtils]: Spent 18.13s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:49:24,694 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 10:49:24,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 4739 treesize of output 4619 [2022-07-22 10:49:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:49:33,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453414546] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:49:33,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:49:33,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 39 [2022-07-22 10:49:33,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763305421] [2022-07-22 10:49:33,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:49:33,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-22 10:49:33,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:49:33,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-22 10:49:33,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1261, Unknown=9, NotChecked=0, Total=1482 [2022-07-22 10:49:33,506 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:50,417 WARN L233 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:49:50,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:49:50,713 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2022-07-22 10:49:50,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-22 10:49:50,714 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-22 10:49:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:49:50,716 INFO L225 Difference]: With dead ends: 71 [2022-07-22 10:49:50,716 INFO L226 Difference]: Without dead ends: 59 [2022-07-22 10:49:50,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 84.6s TimeCoverageRelationStatistics Valid=361, Invalid=2176, Unknown=13, NotChecked=0, Total=2550 [2022-07-22 10:49:50,718 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:49:50,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 92 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 286 Invalid, 0 Unknown, 201 Unchecked, 0.2s Time] [2022-07-22 10:49:50,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-22 10:49:50,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2022-07-22 10:49:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-07-22 10:49:50,730 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 26 [2022-07-22 10:49:50,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:49:50,730 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-07-22 10:49:50,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-07-22 10:49:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 10:49:50,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:49:50,730 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:49:50,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 10:49:50,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:49:50,931 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:49:50,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:49:50,932 INFO L85 PathProgramCache]: Analyzing trace with hash -483356095, now seen corresponding path program 5 times [2022-07-22 10:49:50,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:49:50,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599461209] [2022-07-22 10:49:50,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:49:50,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:49:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:49:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:49:51,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:49:51,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599461209] [2022-07-22 10:49:51,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599461209] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:49:51,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477845060] [2022-07-22 10:49:51,010 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 10:49:51,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:49:51,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:49:51,012 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:49:51,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 10:49:51,100 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-22 10:49:51,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:49:51,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 10:49:51,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:49:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:49:51,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:49:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:49:51,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477845060] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:49:51,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:49:51,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-22 10:49:51,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158101925] [2022-07-22 10:49:51,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:49:51,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 10:49:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:49:51,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 10:49:51,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:49:51,223 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:49:51,354 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2022-07-22 10:49:51,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 10:49:51,355 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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 29 [2022-07-22 10:49:51,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:49:51,355 INFO L225 Difference]: With dead ends: 83 [2022-07-22 10:49:51,355 INFO L226 Difference]: Without dead ends: 63 [2022-07-22 10:49:51,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2022-07-22 10:49:51,357 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 71 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:49:51,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 42 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:49:51,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-22 10:49:51,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2022-07-22 10:49:51,363 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-22 10:49:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-07-22 10:49:51,364 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 29 [2022-07-22 10:49:51,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:49:51,364 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-07-22 10:49:51,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-07-22 10:49:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 10:49:51,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:49:51,365 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:49:51,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 10:49:51,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:49:51,588 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:49:51,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:49:51,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1914654111, now seen corresponding path program 6 times [2022-07-22 10:49:51,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:49:51,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635788017] [2022-07-22 10:49:51,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:49:51,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:49:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:49:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:49:51,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:49:51,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635788017] [2022-07-22 10:49:51,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635788017] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:49:51,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143798071] [2022-07-22 10:49:51,702 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 10:49:51,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:49:51,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:49:51,704 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:49:51,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 10:49:51,774 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-22 10:49:51,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:49:51,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 10:49:51,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:49:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:49:51,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:49:51,928 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:49:51,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143798071] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:49:51,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:49:51,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2022-07-22 10:49:51,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572997118] [2022-07-22 10:49:51,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:49:51,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 10:49:51,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:49:51,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 10:49:51,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-07-22 10:49:51,933 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:52,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:49:52,219 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-07-22 10:49:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 10:49:52,219 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-22 10:49:52,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:49:52,220 INFO L225 Difference]: With dead ends: 67 [2022-07-22 10:49:52,220 INFO L226 Difference]: Without dead ends: 55 [2022-07-22 10:49:52,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=814, Unknown=0, NotChecked=0, Total=1056 [2022-07-22 10:49:52,221 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 81 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:49:52,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 45 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 10:49:52,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-22 10:49:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-07-22 10:49:52,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:52,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-07-22 10:49:52,227 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 30 [2022-07-22 10:49:52,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:49:52,227 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-07-22 10:49:52,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:52,228 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-07-22 10:49:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-22 10:49:52,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:49:52,228 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:49:52,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 10:49:52,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:49:52,447 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:49:52,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:49:52,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1023492733, now seen corresponding path program 7 times [2022-07-22 10:49:52,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:49:52,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321603719] [2022-07-22 10:49:52,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:49:52,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:49:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:49:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:49:53,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:49:53,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321603719] [2022-07-22 10:49:53,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321603719] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:49:53,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610058224] [2022-07-22 10:49:53,192 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 10:49:53,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:49:53,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:49:53,193 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:49:53,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 10:49:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:49:53,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-22 10:49:53,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:49:53,258 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-22 10:49:53,296 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 15 treesize of output 11 [2022-07-22 10:49:53,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:53,394 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 32 treesize of output 31 [2022-07-22 10:49:53,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:53,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:53,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:53,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2022-07-22 10:49:54,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:54,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:54,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:54,296 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 90 treesize of output 95 [2022-07-22 10:49:54,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:54,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:54,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:54,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:49:54,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:54,661 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 114 treesize of output 103 [2022-07-22 10:49:54,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:54,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:54,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:54,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:54,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:49:55,000 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 132 treesize of output 103 [2022-07-22 10:49:55,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:55,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:55,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:49:55,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:55,348 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 143 treesize of output 102 [2022-07-22 10:49:56,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:56,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:56,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:56,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 144 treesize of output 34 [2022-07-22 10:49:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:49:56,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:50:09,722 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod |c_ULTIMATE.start_main_~i~0#1| 4) 0)) (.cse3 (< |c_ULTIMATE.start_main_~i~0#1| 0))) (and (or .cse0 (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (v_ArrVal_276 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_276)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (<= (+ v_ArrVal_281 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* 3 ~N~0)) (not (<= v_ArrVal_277 0)) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= (+ v_ArrVal_276 4) (mod |c_ULTIMATE.start_main_~i~0#1| 4))) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))))) (not .cse3)) (or (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (v_ArrVal_276 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_276)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (<= (+ v_ArrVal_281 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* 3 ~N~0)) (not (<= v_ArrVal_277 0)) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_276 (mod |c_ULTIMATE.start_main_~i~0#1| 4))) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))))) (and (not .cse0) .cse3)))) is different from false [2022-07-22 10:50:53,065 WARN L233 SmtUtils]: Spent 34.25s on a formula simplification. DAG size of input: 70 DAG size of output: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:50:55,268 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod |c_ULTIMATE.start_main_~i~0#1| 4) 0)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (< |c_ULTIMATE.start_main_~i~0#1| 0))) (and (or (and (not .cse0) .cse1) (and (or (< .cse2 0) (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (v_ArrVal_276 Int) (~N~0 Int) (v_ArrVal_273 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_273) (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_276))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (or (not (<= v_ArrVal_277 0)) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (< .cse5 ~N~0)) (not (<= v_ArrVal_273 (mod |c_ULTIMATE.start_main_~i~0#1| 4))) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (<= (+ v_ArrVal_281 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* 3 ~N~0)) (not (<= v_ArrVal_276 (mod .cse5 4)))))))) (forall ((v_ArrVal_273 Int)) (or (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (v_ArrVal_276 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse10 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_273) (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_276))))) (let ((.cse7 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= (+ v_ArrVal_276 4) (mod .cse7 4))) (not (<= v_ArrVal_277 0)) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (< .cse7 ~N~0)) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (<= (+ v_ArrVal_281 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* 3 ~N~0)))))) (not (<= v_ArrVal_273 (mod |c_ULTIMATE.start_main_~i~0#1| 4))))))) (or .cse0 (and (forall ((v_ArrVal_273 Int)) (or (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (v_ArrVal_276 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse14 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_273) (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_276))))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= (+ v_ArrVal_276 4) (mod .cse11 4))) (not (<= v_ArrVal_277 0)) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (< .cse11 ~N~0)) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (<= (+ v_ArrVal_281 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* 3 ~N~0)))))) (not (<= (+ v_ArrVal_273 4) (mod |c_ULTIMATE.start_main_~i~0#1| 4))))) (or (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (v_ArrVal_276 Int) (~N~0 Int) (v_ArrVal_273 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse18 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_273) (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_276))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse17 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (or (not (<= v_ArrVal_277 0)) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (< .cse17 ~N~0)) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= (+ v_ArrVal_273 4) (mod |c_ULTIMATE.start_main_~i~0#1| 4))) (<= (+ v_ArrVal_281 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* 3 ~N~0)) (not (<= v_ArrVal_276 (mod .cse17 4))))))) (not (= (mod .cse2 4) 0)))) (not .cse1)))) is different from false