./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/nsqm.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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/nsqm.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 b64d5f0150faeb5d8c80a790953ff0d0f860fa8f91611b25d82154854354bbd0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:06:50,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:06:50,282 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:06:50,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:06:50,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:06:50,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:06:50,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:06:50,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:06:50,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:06:50,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:06:50,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:06:50,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:06:50,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:06:50,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:06:50,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:06:50,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:06:50,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:06:50,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:06:50,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:06:50,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:06:50,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:06:50,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:06:50,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:06:50,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:06:50,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:06:50,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:06:50,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:06:50,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:06:50,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:06:50,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:06:50,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:06:50,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:06:50,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:06:50,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:06:50,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:06:50,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:06:50,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:06:50,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:06:50,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:06:50,356 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:06:50,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:06:50,357 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:06:50,379 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:06:50,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:06:50,380 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:06:50,380 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:06:50,380 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:06:50,381 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:06:50,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:06:50,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:06:50,381 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:06:50,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:06:50,382 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:06:50,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:06:50,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:06:50,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:06:50,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:06:50,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:06:50,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:06:50,383 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:06:50,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:06:50,383 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:06:50,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:06:50,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:06:50,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:06:50,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:06:50,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:06:50,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:06:50,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:06:50,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:06:50,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:06:50,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:06:50,385 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:06:50,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:06:50,385 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:06:50,385 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:06:50,386 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:06:50,386 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> b64d5f0150faeb5d8c80a790953ff0d0f860fa8f91611b25d82154854354bbd0 [2023-02-15 10:06:50,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:06:50,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:06:50,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:06:50,616 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:06:50,616 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:06:50,617 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/nsqm.c [2023-02-15 10:06:51,590 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:06:51,742 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:06:51,743 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/nsqm.c [2023-02-15 10:06:51,747 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1886a13/13839eca2b3942ec8661aeb41d28d9d8/FLAG096b0a1e0 [2023-02-15 10:06:51,767 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1886a13/13839eca2b3942ec8661aeb41d28d9d8 [2023-02-15 10:06:51,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:06:51,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:06:51,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:06:51,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:06:51,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:06:51,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:06:51" (1/1) ... [2023-02-15 10:06:51,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d5381d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:06:51, skipping insertion in model container [2023-02-15 10:06:51,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:06:51" (1/1) ... [2023-02-15 10:06:51,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:06:51,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:06:51,921 WARN L237 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/nsqm.c[587,600] [2023-02-15 10:06:51,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:06:51,951 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:06:51,962 WARN L237 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/nsqm.c[587,600] [2023-02-15 10:06:51,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:06:51,980 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:06:51,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:06:51 WrapperNode [2023-02-15 10:06:51,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:06:51,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:06:51,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:06:51,982 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:06:51,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:06:51" (1/1) ... [2023-02-15 10:06:51,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:06:51" (1/1) ... [2023-02-15 10:06:52,015 INFO L138 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2023-02-15 10:06:52,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:06:52,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:06:52,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:06:52,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:06:52,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:06:51" (1/1) ... [2023-02-15 10:06:52,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:06:51" (1/1) ... [2023-02-15 10:06:52,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:06:51" (1/1) ... [2023-02-15 10:06:52,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:06:51" (1/1) ... [2023-02-15 10:06:52,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:06:51" (1/1) ... [2023-02-15 10:06:52,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:06:51" (1/1) ... [2023-02-15 10:06:52,043 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:06:51" (1/1) ... [2023-02-15 10:06:52,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:06:51" (1/1) ... [2023-02-15 10:06:52,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:06:52,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:06:52,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:06:52,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:06:52,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:06:51" (1/1) ... [2023-02-15 10:06:52,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:06:52,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:06:52,070 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) [2023-02-15 10:06:52,109 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 [2023-02-15 10:06:52,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:06:52,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:06:52,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:06:52,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:06:52,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:06:52,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:06:52,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:06:52,204 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:06:52,206 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:06:52,328 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:06:52,331 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:06:52,332 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 10:06:52,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:06:52 BoogieIcfgContainer [2023-02-15 10:06:52,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:06:52,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:06:52,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:06:52,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:06:52,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:06:51" (1/3) ... [2023-02-15 10:06:52,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575694fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:06:52, skipping insertion in model container [2023-02-15 10:06:52,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:06:51" (2/3) ... [2023-02-15 10:06:52,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575694fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:06:52, skipping insertion in model container [2023-02-15 10:06:52,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:06:52" (3/3) ... [2023-02-15 10:06:52,339 INFO L112 eAbstractionObserver]: Analyzing ICFG nsqm.c [2023-02-15 10:06:52,351 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:06:52,351 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:06:52,381 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:06:52,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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@695d777, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:06:52,386 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:06:52,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 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) [2023-02-15 10:06:52,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 10:06:52,393 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:06:52,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:06:52,393 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:06:52,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:06:52,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1828546148, now seen corresponding path program 1 times [2023-02-15 10:06:52,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:06:52,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901092082] [2023-02-15 10:06:52,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:06:52,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:06:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:06:52,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:06:52,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901092082] [2023-02-15 10:06:52,491 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 10:06:52,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769073872] [2023-02-15 10:06:52,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:06:52,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:06:52,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:06:52,495 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) [2023-02-15 10:06:52,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:06:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:06:52,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 10:06:52,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:06:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:06:52,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:06:52,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769073872] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:06:52,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:06:52,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:06:52,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095527244] [2023-02-15 10:06:52,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:06:52,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:06:52,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:06:52,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:06:52,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:06:52,637 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 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) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2023-02-15 10:06:52,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:06:52,649 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2023-02-15 10:06:52,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:06:52,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2023-02-15 10:06:52,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:06:52,655 INFO L225 Difference]: With dead ends: 38 [2023-02-15 10:06:52,656 INFO L226 Difference]: Without dead ends: 17 [2023-02-15 10:06:52,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:06:52,661 INFO L413 NwaCegarLoop]: 24 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, 24 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 [2023-02-15 10:06:52,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:06:52,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-02-15 10:06:52,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-02-15 10:06:52,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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) [2023-02-15 10:06:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-02-15 10:06:52,686 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2023-02-15 10:06:52,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:06:52,686 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-02-15 10:06:52,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2023-02-15 10:06:52,687 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-02-15 10:06:52,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 10:06:52,687 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:06:52,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:06:52,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 10:06:52,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-15 10:06:52,894 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:06:52,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:06:52,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1148487778, now seen corresponding path program 1 times [2023-02-15 10:06:52,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:06:52,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768829278] [2023-02-15 10:06:52,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:06:52,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:06:52,933 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:06:52,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1196908814] [2023-02-15 10:06:52,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:06:52,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:06:52,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:06:52,952 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) [2023-02-15 10:06:53,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:06:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:06:53,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 10:06:53,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:06:53,110 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2023-02-15 10:06:53,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2023-02-15 10:06:53,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 10:06:53,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 10:06:53,195 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:06:53,208 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 5 [2023-02-15 10:06:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:06:53,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:06:53,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:06:53,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768829278] [2023-02-15 10:06:53,250 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:06:53,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196908814] [2023-02-15 10:06:53,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196908814] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:06:53,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:06:53,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:06:53,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892586231] [2023-02-15 10:06:53,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:06:53,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:06:53,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:06:53,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:06:53,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:06:53,258 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-02-15 10:06:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:06:53,358 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-02-15 10:06:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 10:06:53,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2023-02-15 10:06:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:06:53,360 INFO L225 Difference]: With dead ends: 34 [2023-02-15 10:06:53,360 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 10:06:53,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:06:53,361 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:06:53,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 48 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:06:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 10:06:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2023-02-15 10:06:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:06:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-15 10:06:53,378 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2023-02-15 10:06:53,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:06:53,378 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-15 10:06:53,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-02-15 10:06:53,378 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-15 10:06:53,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 10:06:53,379 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:06:53,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:06:53,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:06:53,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-15 10:06:53,584 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:06:53,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:06:53,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1755224028, now seen corresponding path program 1 times [2023-02-15 10:06:53,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:06:53,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409489378] [2023-02-15 10:06:53,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:06:53,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:06:53,616 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:06:53,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [707525605] [2023-02-15 10:06:53,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:06:53,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:06:53,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:06:53,634 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) [2023-02-15 10:06:53,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:06:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:06:53,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 10:06:53,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:06:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:06:53,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:06:53,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:06:53,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409489378] [2023-02-15 10:06:53,710 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:06:53,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707525605] [2023-02-15 10:06:53,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707525605] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:06:53,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:06:53,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:06:53,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864234192] [2023-02-15 10:06:53,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:06:53,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:06:53,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:06:53,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:06:53,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:06:53,713 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2023-02-15 10:06:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:06:53,761 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2023-02-15 10:06:53,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 10:06:53,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2023-02-15 10:06:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:06:53,762 INFO L225 Difference]: With dead ends: 49 [2023-02-15 10:06:53,762 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 10:06:53,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:06:53,763 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:06:53,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:06:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 10:06:53,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2023-02-15 10:06:53,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 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) [2023-02-15 10:06:53,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-02-15 10:06:53,766 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2023-02-15 10:06:53,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:06:53,767 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-02-15 10:06:53,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2023-02-15 10:06:53,767 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-02-15 10:06:53,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 10:06:53,767 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:06:53,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:06:53,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:06:53,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:06:53,972 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:06:53,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:06:53,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1842440164, now seen corresponding path program 1 times [2023-02-15 10:06:53,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:06:53,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668492963] [2023-02-15 10:06:53,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:06:53,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:06:53,989 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:06:53,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [497367210] [2023-02-15 10:06:53,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:06:53,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:06:53,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:06:53,991 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) [2023-02-15 10:06:54,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:06:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:06:54,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 10:06:54,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:06:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:06:54,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:06:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:06:54,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:06:54,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668492963] [2023-02-15 10:06:54,090 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:06:54,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497367210] [2023-02-15 10:06:54,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497367210] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:06:54,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:06:54,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-02-15 10:06:54,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958693033] [2023-02-15 10:06:54,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:06:54,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:06:54,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:06:54,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:06:54,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:06:54,093 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2023-02-15 10:06:54,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:06:54,160 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2023-02-15 10:06:54,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 10:06:54,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 14 [2023-02-15 10:06:54,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:06:54,161 INFO L225 Difference]: With dead ends: 44 [2023-02-15 10:06:54,161 INFO L226 Difference]: Without dead ends: 37 [2023-02-15 10:06:54,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-02-15 10:06:54,162 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:06:54,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 41 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:06:54,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-15 10:06:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2023-02-15 10:06:54,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 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) [2023-02-15 10:06:54,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-02-15 10:06:54,166 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 14 [2023-02-15 10:06:54,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:06:54,166 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-02-15 10:06:54,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2023-02-15 10:06:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-02-15 10:06:54,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:06:54,167 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:06:54,167 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:06:54,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 10:06:54,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:06:54,371 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:06:54,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:06:54,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1667884396, now seen corresponding path program 1 times [2023-02-15 10:06:54,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:06:54,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375121051] [2023-02-15 10:06:54,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:06:54,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:06:54,394 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:06:54,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1700746254] [2023-02-15 10:06:54,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:06:54,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:06:54,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:06:54,412 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) [2023-02-15 10:06:54,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 10:06:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:06:54,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 10:06:54,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:06:54,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:06:54,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:06:54,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:06:54,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375121051] [2023-02-15 10:06:54,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:06:54,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700746254] [2023-02-15 10:06:54,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700746254] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:06:54,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:06:54,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 10:06:54,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777294430] [2023-02-15 10:06:54,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:06:54,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:06:54,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:06:54,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:06:54,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:06:54,571 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2023-02-15 10:06:54,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:06:54,634 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2023-02-15 10:06:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 10:06:54,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 [2023-02-15 10:06:54,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:06:54,635 INFO L225 Difference]: With dead ends: 41 [2023-02-15 10:06:54,635 INFO L226 Difference]: Without dead ends: 27 [2023-02-15 10:06:54,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:06:54,636 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:06:54,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:06:54,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-15 10:06:54,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2023-02-15 10:06:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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) [2023-02-15 10:06:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-02-15 10:06:54,638 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2023-02-15 10:06:54,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:06:54,639 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-02-15 10:06:54,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2023-02-15 10:06:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2023-02-15 10:06:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:06:54,639 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:06:54,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:06:54,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 10:06:54,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:06:54,845 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:06:54,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:06:54,846 INFO L85 PathProgramCache]: Analyzing trace with hash 586911962, now seen corresponding path program 1 times [2023-02-15 10:06:54,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:06:54,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866128929] [2023-02-15 10:06:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:06:54,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:06:54,876 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:06:54,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [312483128] [2023-02-15 10:06:54,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:06:54,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:06:54,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:06:54,883 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) [2023-02-15 10:06:54,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 10:06:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:06:54,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 10:06:54,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:06:54,969 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:06:54,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:06:54,973 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 16 [2023-02-15 10:06:54,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 10:06:54,995 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2023-02-15 10:06:55,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:06:55,035 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:06:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:06:55,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:06:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:06:55,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:06:55,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866128929] [2023-02-15 10:06:55,237 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:06:55,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312483128] [2023-02-15 10:06:55,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312483128] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:06:55,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:06:55,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-15 10:06:55,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166060403] [2023-02-15 10:06:55,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:06:55,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 10:06:55,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:06:55,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 10:06:55,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=94, Unknown=5, NotChecked=0, Total=132 [2023-02-15 10:06:55,238 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 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) [2023-02-15 10:06:55,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:06:55,483 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2023-02-15 10:06:55,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 10:06:55,483 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 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) Word has length 16 [2023-02-15 10:06:55,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:06:55,484 INFO L225 Difference]: With dead ends: 54 [2023-02-15 10:06:55,484 INFO L226 Difference]: Without dead ends: 52 [2023-02-15 10:06:55,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=261, Unknown=5, NotChecked=0, Total=380 [2023-02-15 10:06:55,485 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 127 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:06:55,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 55 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:06:55,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-15 10:06:55,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 26. [2023-02-15 10:06:55,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:06:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-02-15 10:06:55,489 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2023-02-15 10:06:55,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:06:55,489 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-02-15 10:06:55,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 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) [2023-02-15 10:06:55,489 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-02-15 10:06:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 10:06:55,489 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:06:55,489 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:06:55,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 10:06:55,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:06:55,695 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:06:55,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:06:55,695 INFO L85 PathProgramCache]: Analyzing trace with hash 798963152, now seen corresponding path program 1 times [2023-02-15 10:06:55,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:06:55,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641925483] [2023-02-15 10:06:55,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:06:55,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:06:55,724 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:06:55,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [486694197] [2023-02-15 10:06:55,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:06:55,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:06:55,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:06:55,741 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) [2023-02-15 10:06:55,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 10:06:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:06:55,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 10:06:55,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:06:55,840 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:06:55,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:06:55,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2023-02-15 10:06:55,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 10:06:55,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 10:06:55,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 10:06:55,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:06:55,896 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:06:55,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:06:55,948 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 35 [2023-02-15 10:06:56,108 INFO L350 Elim1Store]: Elim1 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 50 treesize of output 26 [2023-02-15 10:06:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:06:56,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:06:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:06:56,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:06:56,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641925483] [2023-02-15 10:06:56,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:06:56,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486694197] [2023-02-15 10:06:56,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486694197] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:06:56,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:06:56,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2023-02-15 10:06:56,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973341295] [2023-02-15 10:06:56,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:06:56,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 10:06:56,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:06:56,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 10:06:56,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:06:56,539 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 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) [2023-02-15 10:06:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:06:58,054 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2023-02-15 10:06:58,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 10:06:58,055 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 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 20 [2023-02-15 10:06:58,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:06:58,055 INFO L225 Difference]: With dead ends: 82 [2023-02-15 10:06:58,055 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 10:06:58,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2023-02-15 10:06:58,056 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 115 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:06:58,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 107 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 10:06:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 10:06:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 46. [2023-02-15 10:06:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 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) [2023-02-15 10:06:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2023-02-15 10:06:58,063 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 20 [2023-02-15 10:06:58,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:06:58,063 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2023-02-15 10:06:58,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 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) [2023-02-15 10:06:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2023-02-15 10:06:58,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 10:06:58,064 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:06:58,064 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:06:58,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 10:06:58,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:06:58,265 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:06:58,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:06:58,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1334592554, now seen corresponding path program 2 times [2023-02-15 10:06:58,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:06:58,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073215258] [2023-02-15 10:06:58,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:06:58,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:06:58,300 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:06:58,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1482980225] [2023-02-15 10:06:58,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:06:58,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:06:58,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:06:58,306 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:06:58,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 10:06:58,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:06:58,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:06:58,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:06:58,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:06:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:06:58,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:06:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:06:58,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:06:58,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073215258] [2023-02-15 10:06:58,443 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:06:58,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482980225] [2023-02-15 10:06:58,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482980225] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:06:58,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:06:58,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-15 10:06:58,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105556019] [2023-02-15 10:06:58,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:06:58,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 10:06:58,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:06:58,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 10:06:58,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:06:58,446 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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) [2023-02-15 10:06:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:06:58,539 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2023-02-15 10:06:58,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 10:06:58,541 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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 20 [2023-02-15 10:06:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:06:58,543 INFO L225 Difference]: With dead ends: 103 [2023-02-15 10:06:58,543 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 10:06:58,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:06:58,544 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:06:58,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 56 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:06:58,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 10:06:58,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 50. [2023-02-15 10:06:58,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 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) [2023-02-15 10:06:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2023-02-15 10:06:58,561 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 20 [2023-02-15 10:06:58,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:06:58,561 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2023-02-15 10:06:58,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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) [2023-02-15 10:06:58,561 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2023-02-15 10:06:58,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 10:06:58,562 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:06:58,562 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:06:58,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-15 10:06:58,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-15 10:06:58,767 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:06:58,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:06:58,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1146782124, now seen corresponding path program 3 times [2023-02-15 10:06:58,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:06:58,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112821956] [2023-02-15 10:06:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:06:58,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:06:58,785 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:06:58,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [608769314] [2023-02-15 10:06:58,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:06:58,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:06:58,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:06:58,787 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:06:58,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 10:06:58,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 10:06:58,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:06:58,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 10:06:58,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:06:58,999 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:06:58,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:06:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:06:59,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:06:59,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112821956] [2023-02-15 10:06:59,035 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:06:59,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608769314] [2023-02-15 10:06:59,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608769314] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:06:59,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:06:59,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-02-15 10:06:59,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962395212] [2023-02-15 10:06:59,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:06:59,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 10:06:59,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:06:59,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 10:06:59,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:06:59,037 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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) [2023-02-15 10:06:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:06:59,234 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2023-02-15 10:06:59,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 10:06:59,234 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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 22 [2023-02-15 10:06:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:06:59,234 INFO L225 Difference]: With dead ends: 113 [2023-02-15 10:06:59,235 INFO L226 Difference]: Without dead ends: 81 [2023-02-15 10:06:59,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2023-02-15 10:06:59,235 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 82 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:06:59,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 86 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:06:59,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-15 10:06:59,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 48. [2023-02-15 10:06:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:06:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2023-02-15 10:06:59,241 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 22 [2023-02-15 10:06:59,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:06:59,242 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2023-02-15 10:06:59,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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) [2023-02-15 10:06:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2023-02-15 10:06:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:06:59,242 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:06:59,242 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:06:59,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 10:06:59,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:06:59,448 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:06:59,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:06:59,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1083970380, now seen corresponding path program 2 times [2023-02-15 10:06:59,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:06:59,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958208804] [2023-02-15 10:06:59,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:06:59,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:06:59,466 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:06:59,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583342403] [2023-02-15 10:06:59,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:06:59,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:06:59,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:06:59,486 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:06:59,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 10:06:59,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:06:59,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:06:59,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:06:59,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:06:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 10:06:59,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:06:59,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 10:06:59,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:06:59,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958208804] [2023-02-15 10:06:59,598 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:06:59,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583342403] [2023-02-15 10:06:59,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583342403] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:06:59,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:06:59,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-15 10:06:59,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706175122] [2023-02-15 10:06:59,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:06:59,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 10:06:59,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:06:59,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 10:06:59,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:06:59,600 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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) [2023-02-15 10:06:59,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:06:59,792 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2023-02-15 10:06:59,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 10:06:59,792 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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) Word has length 24 [2023-02-15 10:06:59,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:06:59,793 INFO L225 Difference]: With dead ends: 64 [2023-02-15 10:06:59,793 INFO L226 Difference]: Without dead ends: 55 [2023-02-15 10:06:59,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-02-15 10:06:59,794 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:06:59,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 39 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:06:59,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-15 10:06:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2023-02-15 10:06:59,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.125) internal successors, (45), 40 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) [2023-02-15 10:06:59,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2023-02-15 10:06:59,799 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 24 [2023-02-15 10:06:59,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:06:59,799 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2023-02-15 10:06:59,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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) [2023-02-15 10:06:59,800 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2023-02-15 10:06:59,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:06:59,807 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:06:59,807 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:06:59,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 10:07:00,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-15 10:07:00,013 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:00,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:00,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1049585326, now seen corresponding path program 4 times [2023-02-15 10:07:00,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:00,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214673193] [2023-02-15 10:07:00,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:00,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:00,046 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:07:00,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [341165892] [2023-02-15 10:07:00,046 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:07:00,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:00,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:00,053 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:00,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 10:07:00,342 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:07:00,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:07:00,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-15 10:07:00,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:00,352 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:07:00,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:00,356 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 16 [2023-02-15 10:07:00,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 10:07:00,370 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2023-02-15 10:07:00,389 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2023-02-15 10:07:00,405 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2023-02-15 10:07:00,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2023-02-15 10:07:00,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:00,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:00,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 102 [2023-02-15 10:07:00,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:00,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:00,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 26 [2023-02-15 10:07:00,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2023-02-15 10:07:00,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:00,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:00,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 102 [2023-02-15 10:07:00,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:00,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:00,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 17 [2023-02-15 10:07:00,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:00,519 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:07:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:00,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:07:00,919 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_375 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_375) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) is different from false [2023-02-15 10:07:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2023-02-15 10:07:00,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:00,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214673193] [2023-02-15 10:07:00,935 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:07:00,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341165892] [2023-02-15 10:07:00,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341165892] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:07:00,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:07:00,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-02-15 10:07:00,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568482088] [2023-02-15 10:07:00,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:07:00,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 10:07:00,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:00,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 10:07:00,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=248, Unknown=1, NotChecked=34, Total=380 [2023-02-15 10:07:00,936 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:03,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:03,694 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2023-02-15 10:07:03,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 10:07:03,695 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-15 10:07:03,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:03,696 INFO L225 Difference]: With dead ends: 106 [2023-02-15 10:07:03,696 INFO L226 Difference]: Without dead ends: 104 [2023-02-15 10:07:03,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=284, Invalid=772, Unknown=4, NotChecked=62, Total=1122 [2023-02-15 10:07:03,697 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 117 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 30 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:03,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 142 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 217 Invalid, 6 Unknown, 37 Unchecked, 0.4s Time] [2023-02-15 10:07:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-15 10:07:03,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 49. [2023-02-15 10:07:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2023-02-15 10:07:03,704 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 24 [2023-02-15 10:07:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:03,704 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2023-02-15 10:07:03,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2023-02-15 10:07:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 10:07:03,704 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:03,705 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:07:03,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-02-15 10:07:03,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-15 10:07:03,911 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:03,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:03,911 INFO L85 PathProgramCache]: Analyzing trace with hash 149788298, now seen corresponding path program 3 times [2023-02-15 10:07:03,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:03,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124094934] [2023-02-15 10:07:03,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:03,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:03,947 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:07:03,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [295799930] [2023-02-15 10:07:03,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:07:03,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:03,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:03,951 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:03,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 10:07:04,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 10:07:04,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:07:04,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 10:07:04,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:04,158 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:07:04,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:07:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:07:04,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:04,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124094934] [2023-02-15 10:07:04,199 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:07:04,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295799930] [2023-02-15 10:07:04,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295799930] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:07:04,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:07:04,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-02-15 10:07:04,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519533360] [2023-02-15 10:07:04,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:07:04,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 10:07:04,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:04,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 10:07:04,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:07:04,200 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 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) [2023-02-15 10:07:04,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:04,358 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2023-02-15 10:07:04,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 10:07:04,358 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 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 26 [2023-02-15 10:07:04,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:04,359 INFO L225 Difference]: With dead ends: 84 [2023-02-15 10:07:04,359 INFO L226 Difference]: Without dead ends: 75 [2023-02-15 10:07:04,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2023-02-15 10:07:04,359 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 61 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:04,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 71 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:07:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-15 10:07:04,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 49. [2023-02-15 10:07:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 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) [2023-02-15 10:07:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2023-02-15 10:07:04,364 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 26 [2023-02-15 10:07:04,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:04,365 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2023-02-15 10:07:04,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 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) [2023-02-15 10:07:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2023-02-15 10:07:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 10:07:04,365 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:04,365 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:07:04,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 10:07:04,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-15 10:07:04,566 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:04,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:04,566 INFO L85 PathProgramCache]: Analyzing trace with hash -55017726, now seen corresponding path program 4 times [2023-02-15 10:07:04,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:04,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413163269] [2023-02-15 10:07:04,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:04,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:04,581 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:07:04,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [665216736] [2023-02-15 10:07:04,588 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:07:04,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:04,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:04,589 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:04,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 10:07:04,791 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:07:04,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:07:04,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-15 10:07:04,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:04,800 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:07:04,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:04,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2023-02-15 10:07:04,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 10:07:04,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 10:07:04,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 10:07:04,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 111 [2023-02-15 10:07:04,840 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:07:04,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:04,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:04,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:04,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:04,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 172 [2023-02-15 10:07:04,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:04,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:04,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 74 [2023-02-15 10:07:04,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:04,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:04,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-02-15 10:07:04,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 153 [2023-02-15 10:07:05,000 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:07:05,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:05,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:05,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:05,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 201 [2023-02-15 10:07:05,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:05,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:05,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:05,114 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:07:05,116 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-02-15 10:07:05,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 60 [2023-02-15 10:07:05,328 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-02-15 10:07:05,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 47 [2023-02-15 10:07:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:05,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:07:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:12,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:12,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413163269] [2023-02-15 10:07:12,792 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:07:12,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665216736] [2023-02-15 10:07:12,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665216736] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:07:12,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:07:12,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2023-02-15 10:07:12,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082523096] [2023-02-15 10:07:12,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:07:12,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 10:07:12,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:12,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 10:07:12,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2023-02-15 10:07:12,794 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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) [2023-02-15 10:07:28,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:07:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:37,217 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2023-02-15 10:07:37,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-15 10:07:37,217 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-15 10:07:37,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:37,218 INFO L225 Difference]: With dead ends: 128 [2023-02-15 10:07:37,218 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 10:07:37,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=449, Invalid=1903, Unknown=0, NotChecked=0, Total=2352 [2023-02-15 10:07:37,219 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 281 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 68 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:37,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 161 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 403 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2023-02-15 10:07:37,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 10:07:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 78. [2023-02-15 10:07:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 77 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2023-02-15 10:07:37,233 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 28 [2023-02-15 10:07:37,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:37,246 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2023-02-15 10:07:37,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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) [2023-02-15 10:07:37,247 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2023-02-15 10:07:37,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 10:07:37,249 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:37,249 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:07:37,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 10:07:37,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-15 10:07:37,454 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:37,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:37,455 INFO L85 PathProgramCache]: Analyzing trace with hash -412561416, now seen corresponding path program 5 times [2023-02-15 10:07:37,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:37,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073684176] [2023-02-15 10:07:37,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:37,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:37,474 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:07:37,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078548711] [2023-02-15 10:07:37,476 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 10:07:37,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:37,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:37,486 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:37,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 10:07:38,233 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-15 10:07:38,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:07:38,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 10:07:38,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 10:07:38,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:07:38,368 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 10:07:38,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:38,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073684176] [2023-02-15 10:07:38,369 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:07:38,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078548711] [2023-02-15 10:07:38,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078548711] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:07:38,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:07:38,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2023-02-15 10:07:38,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497694030] [2023-02-15 10:07:38,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:07:38,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 10:07:38,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:38,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 10:07:38,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:07:38,370 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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) [2023-02-15 10:07:38,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:38,518 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2023-02-15 10:07:38,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 10:07:38,518 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-15 10:07:38,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:38,519 INFO L225 Difference]: With dead ends: 118 [2023-02-15 10:07:38,519 INFO L226 Difference]: Without dead ends: 92 [2023-02-15 10:07:38,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2023-02-15 10:07:38,520 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 37 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:38,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 71 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:07:38,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-15 10:07:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2023-02-15 10:07:38,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 71 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2023-02-15 10:07:38,552 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 32 [2023-02-15 10:07:38,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:38,552 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2023-02-15 10:07:38,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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) [2023-02-15 10:07:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2023-02-15 10:07:38,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 10:07:38,557 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:38,557 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:07:38,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 10:07:38,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:38,765 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:38,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:38,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1680698556, now seen corresponding path program 6 times [2023-02-15 10:07:38,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:38,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505619864] [2023-02-15 10:07:38,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:38,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:38,789 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:07:38,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2006591162] [2023-02-15 10:07:38,792 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 10:07:38,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:38,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:38,795 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:38,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 10:07:39,268 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-02-15 10:07:39,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:07:39,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 10:07:39,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 10:07:39,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:07:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 10:07:39,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:39,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505619864] [2023-02-15 10:07:39,414 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:07:39,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006591162] [2023-02-15 10:07:39,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006591162] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:07:39,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:07:39,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2023-02-15 10:07:39,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001581747] [2023-02-15 10:07:39,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:07:39,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 10:07:39,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:39,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 10:07:39,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-02-15 10:07:39,416 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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) [2023-02-15 10:07:39,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:39,609 INFO L93 Difference]: Finished difference Result 169 states and 188 transitions. [2023-02-15 10:07:39,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 10:07:39,609 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-15 10:07:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:39,610 INFO L225 Difference]: With dead ends: 169 [2023-02-15 10:07:39,610 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 10:07:39,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2023-02-15 10:07:39,611 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 78 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:39,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 82 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:07:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 10:07:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 80. [2023-02-15 10:07:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 79 states have internal predecessors, (93), 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) [2023-02-15 10:07:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2023-02-15 10:07:39,622 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 32 [2023-02-15 10:07:39,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:39,622 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2023-02-15 10:07:39,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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) [2023-02-15 10:07:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2023-02-15 10:07:39,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 10:07:39,623 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:39,623 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:07:39,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-02-15 10:07:39,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 10:07:39,830 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:39,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:39,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1021371332, now seen corresponding path program 7 times [2023-02-15 10:07:39,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:39,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8284697] [2023-02-15 10:07:39,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:39,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:39,849 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:07:39,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [701702879] [2023-02-15 10:07:39,849 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 10:07:39,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:39,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:39,850 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:39,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 10:07:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:07:39,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 10:07:39,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:07:39,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:07:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:07:40,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:40,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8284697] [2023-02-15 10:07:40,058 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:07:40,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701702879] [2023-02-15 10:07:40,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701702879] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:07:40,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:07:40,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2023-02-15 10:07:40,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435738526] [2023-02-15 10:07:40,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:07:40,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 10:07:40,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:40,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 10:07:40,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2023-02-15 10:07:40,059 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 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) [2023-02-15 10:07:40,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:40,526 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2023-02-15 10:07:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 10:07:40,527 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 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 32 [2023-02-15 10:07:40,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:40,527 INFO L225 Difference]: With dead ends: 169 [2023-02-15 10:07:40,527 INFO L226 Difference]: Without dead ends: 151 [2023-02-15 10:07:40,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=438, Invalid=1368, Unknown=0, NotChecked=0, Total=1806 [2023-02-15 10:07:40,528 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 142 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:40,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 264 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 10:07:40,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-15 10:07:40,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 80. [2023-02-15 10:07:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.139240506329114) internal successors, (90), 79 states have internal predecessors, (90), 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) [2023-02-15 10:07:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2023-02-15 10:07:40,541 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 32 [2023-02-15 10:07:40,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:40,541 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2023-02-15 10:07:40,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 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) [2023-02-15 10:07:40,541 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2023-02-15 10:07:40,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 10:07:40,542 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:40,542 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:07:40,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-15 10:07:40,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-15 10:07:40,747 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:40,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:40,748 INFO L85 PathProgramCache]: Analyzing trace with hash 351176898, now seen corresponding path program 8 times [2023-02-15 10:07:40,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:40,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754201995] [2023-02-15 10:07:40,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:40,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:40,761 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:07:40,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226457453] [2023-02-15 10:07:40,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:07:40,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:40,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:40,763 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:40,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-15 10:07:40,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:07:40,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:07:40,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 10:07:40,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:07:40,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:07:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:07:41,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:41,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754201995] [2023-02-15 10:07:41,043 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:07:41,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226457453] [2023-02-15 10:07:41,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226457453] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:07:41,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:07:41,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2023-02-15 10:07:41,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469756787] [2023-02-15 10:07:41,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:07:41,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 10:07:41,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:41,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 10:07:41,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-02-15 10:07:41,046 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 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) [2023-02-15 10:07:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:41,430 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2023-02-15 10:07:41,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 10:07:41,431 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-02-15 10:07:41,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:41,431 INFO L225 Difference]: With dead ends: 155 [2023-02-15 10:07:41,431 INFO L226 Difference]: Without dead ends: 128 [2023-02-15 10:07:41,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=354, Invalid=1052, Unknown=0, NotChecked=0, Total=1406 [2023-02-15 10:07:41,432 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 190 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:41,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 114 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:07:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-15 10:07:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 84. [2023-02-15 10:07:41,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 83 states have internal predecessors, (90), 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) [2023-02-15 10:07:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-02-15 10:07:41,444 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 34 [2023-02-15 10:07:41,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:41,444 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-02-15 10:07:41,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 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) [2023-02-15 10:07:41,445 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-02-15 10:07:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 10:07:41,445 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:41,445 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:07:41,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-02-15 10:07:41,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-15 10:07:41,650 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:41,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:41,651 INFO L85 PathProgramCache]: Analyzing trace with hash -831401164, now seen corresponding path program 9 times [2023-02-15 10:07:41,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:41,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565213042] [2023-02-15 10:07:41,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:41,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:41,665 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:07:41,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1994629504] [2023-02-15 10:07:41,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:07:41,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:41,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:41,667 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:41,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-15 10:07:42,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 10:07:42,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:07:42,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-15 10:07:42,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:42,375 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2023-02-15 10:07:42,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 58 [2023-02-15 10:07:42,396 INFO L321 Elim1Store]: treesize reduction 39, result has 31.6 percent of original size [2023-02-15 10:07:42,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 75 [2023-02-15 10:07:42,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 10:07:42,426 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 5 [2023-02-15 10:07:42,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 10:07:42,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:42,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 55 [2023-02-15 10:07:42,446 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:07:42,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2023-02-15 10:07:42,458 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:07:42,495 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:07:42,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 47 [2023-02-15 10:07:42,499 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:07:42,501 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 12 [2023-02-15 10:07:42,503 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:07:42,507 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:07:42,568 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:07:42,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 111 [2023-02-15 10:07:42,572 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:07:42,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:42,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:42,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:42,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:42,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 172 [2023-02-15 10:07:42,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:42,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:42,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 84 [2023-02-15 10:07:42,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:42,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:42,681 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:07:42,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 46 [2023-02-15 10:07:42,751 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:07:42,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 86 [2023-02-15 10:07:42,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:42,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:42,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:42,767 INFO L321 Elim1Store]: treesize reduction 89, result has 1.1 percent of original size [2023-02-15 10:07:42,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 117 [2023-02-15 10:07:42,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:42,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:42,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:42,870 INFO L321 Elim1Store]: treesize reduction 82, result has 37.9 percent of original size [2023-02-15 10:07:42,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 72 [2023-02-15 10:07:43,336 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:07:43,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 215 treesize of output 193 [2023-02-15 10:07:43,354 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:07:43,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 201 [2023-02-15 10:07:43,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 120 [2023-02-15 10:07:43,611 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:07:43,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 235 treesize of output 207 [2023-02-15 10:07:43,634 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:07:43,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 221 [2023-02-15 10:07:43,977 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:07:43,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 255 treesize of output 219 [2023-02-15 10:07:43,983 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:07:43,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:43,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 247 [2023-02-15 10:07:44,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:44,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:44,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:44,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:44,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:44,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:44,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:44,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:44,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:44,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:44,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:44,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 81 [2023-02-15 10:07:44,718 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-02-15 10:07:44,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 141 treesize of output 61 [2023-02-15 10:07:44,741 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:44,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:08:00,265 WARN L233 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:08:14,579 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse69 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse70 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse66 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse19 (<= .cse70 2147483647)) (.cse68 (* .cse70 8)) (.cse67 (* .cse69 8)) (.cse18 (<= .cse69 2147483647))) (let ((.cse38 (not .cse18)) (.cse37 (+ .cse67 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse35 (+ .cse68 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse36 (not .cse19)) (.cse6 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 16 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse9 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse11 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (+ .cse68 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (+ c_~N~0 10)) (.cse14 (+ .cse67 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse40 (* 8 .cse66)) (.cse0 (<= .cse66 2147483647))) (and (or (not .cse0) (let ((.cse39 (select .cse13 (+ .cse40 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (let ((.cse17 (+ .cse39 4)) (.cse15 (+ 2 .cse39))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= .cse1 (let ((.cse12 (store (store (store .cse13 .cse14 .cse15) .cse16 .cse17) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse12))) (let ((.cse10 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse5 (store .cse10 .cse11 (+ .cse3 2 .cse7)))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse5 .cse6 (+ .cse2 .cse3 .cse7 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse7)))))))))) .cse18) (or (let ((.cse27 (store .cse13 .cse37 .cse15))) (and (or .cse19 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse26 (store (store .cse27 .cse16 .cse17) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse26))) (let ((.cse25 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse20 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse21 (select .cse26 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse24 (store .cse25 .cse11 (+ .cse20 .cse21 2)))) (let ((.cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9))) (+ .cse20 .cse21 .cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse24 .cse6 (+ .cse20 .cse21 .cse22 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8)))))))) .cse1)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= .cse1 (let ((.cse34 (store (store .cse27 .cse35 .cse17) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse34))) (let ((.cse33 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse31 (select .cse34 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse32 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse29 (store .cse33 .cse11 (+ 2 .cse31 .cse32)))) (let ((.cse30 (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9))) (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse29 .cse6 (+ .cse30 .cse31 4 .cse32))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse30 .cse31 .cse32)))))))))) .cse36))) .cse38))))) (or (let ((.cse65 (select .cse13 (+ (- 34359738368) .cse40 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (let ((.cse49 (+ .cse65 4)) (.cse48 (+ .cse65 2))) (and (or .cse38 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse47 (store (store (store .cse13 .cse37 .cse48) .cse35 .cse49) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse47))) (let ((.cse46 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse41 (select .cse47 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse45 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse44 (store .cse46 .cse11 (+ .cse41 2 .cse45)))) (let ((.cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| .cse44) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9))) (+ .cse41 .cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse44 .cse6 (+ .cse41 .cse42 4 .cse45))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse45))))))) .cse1)))) (or .cse18 (let ((.cse57 (store .cse13 .cse14 .cse48))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= .cse1 (let ((.cse56 (store (store .cse57 .cse35 .cse49) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse56))) (let ((.cse55 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse52 (select .cse56 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse53 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse51 (store .cse55 .cse11 (+ .cse52 2 .cse53)))) (let ((.cse54 (select (select (store .cse50 |c_ULTIMATE.start_main_~a~0#1.base| .cse51) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9))) (+ (select (select (store .cse50 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse51 .cse6 (+ .cse52 .cse53 .cse54 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse52 .cse53 .cse54)))))))))) .cse36) (or .cse19 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse64 (store (store .cse57 .cse16 .cse49) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse64))) (let ((.cse63 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse61 (select .cse64 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse62 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse59 (store .cse63 .cse11 (+ .cse61 2 .cse62)))) (let ((.cse60 (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| .cse59) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9))) (+ (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse59 .cse6 (+ .cse60 .cse61 4 .cse62))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse60 .cse61 .cse62))))))) .cse1)))))))))) .cse0))))) (< 4 c_~N~0) (not (< 3 c_~N~0)) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) is different from true [2023-02-15 10:08:14,589 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:08:14,591 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:08:14,595 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-15 10:08:14,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1618 treesize of output 1 [2023-02-15 10:08:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-15 10:08:14,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:08:14,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565213042] [2023-02-15 10:08:14,599 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:08:14,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994629504] [2023-02-15 10:08:14,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994629504] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:08:14,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:08:14,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2023-02-15 10:08:14,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223513664] [2023-02-15 10:08:14,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:08:14,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-15 10:08:14,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:08:14,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-15 10:08:14,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1579, Unknown=2, NotChecked=84, Total=1980 [2023-02-15 10:08:14,601 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 45 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 45 states have internal predecessors, (70), 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) [2023-02-15 10:08:16,677 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse108 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse103 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (let ((.cse104 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse87 (* 8 .cse103)) (.cse106 (* .cse108 8)) (.cse110 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse69 (mod .cse110 4294967296)) (.cse109 (+ .cse106 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (select .cse27 (+ .cse87 |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse11 (select .cse104 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse87)))) (let ((.cse31 (store .cse104 .cse109 (+ 2 .cse9 .cse11))) (.cse68 (* .cse69 8)) (.cse107 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse86 (+ .cse106 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse30 (< .cse110 c_~N~0)) (.cse14 (select .cse27 .cse86)) (.cse15 (select .cse104 .cse109)) (.cse51 (<= .cse108 2147483647)) (.cse0 (< .cse107 c_~N~0)) (.cse105 (+ .cse68 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse31) |c_ULTIMATE.start_main_~b~0#1.base|) .cse86))) (let ((.cse1 (store .cse31 .cse105 (+ .cse8 .cse9 4 .cse11))) (.cse6 (not .cse0)) (.cse7 (+ (* 8 (mod .cse107 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse10 (+ .cse68 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse29 (< 4 c_~N~0)) (.cse67 (not .cse51)) (.cse28 (+ c_~N~0 10)) (.cse18 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse22 (+ 16 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse23 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse25 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse50 (+ .cse106 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse4 (not (< 3 c_~N~0))) (.cse3 (+ c_~N~0 16)) (.cse13 (store .cse104 .cse105 (+ 2 .cse14 .cse15))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24)) (.cse5 (not .cse30))) (and (or .cse0 (= (select .cse1 .cse2) .cse3) .cse4 .cse5) (or .cse4 .cse6 (= .cse3 (select (store .cse1 .cse7 (+ .cse8 6 .cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10) .cse11)) .cse2)) .cse12) (or .cse4 .cse6 (= (select (store .cse13 .cse7 (+ .cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10) 4 .cse15)) .cse2) .cse3) .cse12) (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_736 Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)) (= (let ((.cse26 (store .cse27 (+ (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse26))) (let ((.cse24 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse19 (select .cse26 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse21 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse17 (store .cse24 .cse25 (+ .cse19 .cse21 2)))) (let ((.cse20 (select (select (store .cse16 |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~b~0#1.base|) .cse23))) (+ (select (select (store .cse16 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse17 .cse18 (+ .cse19 .cse20 .cse21 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse22) .cse19 .cse20 .cse21))))))) .cse28))) .cse29 .cse4) (or .cse30 .cse4 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (= (select .cse31 .cse2) .cse3)) (or .cse29 (let ((.cse41 (<= .cse69 2147483647))) (let ((.cse40 (not .cse41)) (.cse49 (+ .cse68 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|))) (and (or (let ((.cse39 (+ 2 (select .cse27 .cse50)))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= .cse28 (let ((.cse38 (store (store .cse27 .cse10 .cse39) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse38))) (let ((.cse37 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse33 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse34 (select .cse38 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse36 (store .cse37 .cse25 (+ .cse33 .cse34 2)))) (let ((.cse32 (select (select (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~b~0#1.base|) .cse23))) (+ .cse32 .cse33 .cse34 (select (select (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse36 .cse18 (+ .cse32 .cse33 .cse34 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse22))))))))))) .cse40) (or .cse41 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (= .cse28 (let ((.cse48 (store (store .cse27 .cse49 .cse39) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse48))) (let ((.cse47 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse42 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse45 (select .cse48 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse44 (store .cse47 .cse25 (+ .cse42 2 .cse45)))) (let ((.cse46 (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| .cse44) |c_ULTIMATE.start_main_~b~0#1.base|) .cse23))) (+ .cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse44 .cse18 (+ .cse42 .cse45 .cse46 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse22) .cse45 .cse46)))))))) (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0)))))) .cse51) (or (let ((.cse59 (+ 2 .cse14))) (and (or .cse40 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse58 (store (store .cse27 .cse10 .cse59) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse58))) (let ((.cse57 (select .cse52 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse54 (select .cse57 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse56 (select .cse58 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse53 (store .cse57 .cse25 (+ .cse54 2 .cse56)))) (let ((.cse55 (select (select (store .cse52 |c_ULTIMATE.start_main_~a~0#1.base| .cse53) |c_ULTIMATE.start_main_~b~0#1.base|) .cse23))) (+ (select (select (store .cse52 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse53 .cse18 (+ .cse54 .cse55 .cse56 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse22) .cse54 .cse55 .cse56))))))) .cse28)))) (or .cse41 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (= .cse28 (let ((.cse66 (store (store .cse27 .cse49 .cse59) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse66))) (let ((.cse65 (select .cse61 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse60 (select .cse66 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse63 (select .cse65 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse62 (store .cse65 .cse25 (+ .cse60 2 .cse63)))) (let ((.cse64 (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| .cse62) |c_ULTIMATE.start_main_~b~0#1.base|) .cse23))) (+ .cse60 (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse62 .cse18 (+ .cse60 .cse63 4 .cse64))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse22) .cse63 .cse64)))))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0)))))) .cse67)))) .cse4) (<= c_~N~0 2147483647) (or .cse29 (let ((.cse70 (<= .cse103 2147483647))) (and (or .cse70 (let ((.cse78 (+ (select .cse27 (+ (- 34359738368) .cse87 |c_ULTIMATE.start_main_~b~0#1.offset|)) 2))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= .cse28 (let ((.cse77 (store (store .cse27 .cse50 .cse78) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse77))) (let ((.cse76 (select .cse74 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse71 (select .cse76 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse72 (select .cse77 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse75 (store .cse76 .cse25 (+ .cse71 2 .cse72)))) (let ((.cse73 (select (select (store .cse74 |c_ULTIMATE.start_main_~a~0#1.base| .cse75) |c_ULTIMATE.start_main_~b~0#1.base|) .cse23))) (+ .cse71 .cse72 .cse73 (select (select (store .cse74 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse75 .cse18 (+ .cse71 .cse72 .cse73 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse22))))))))))) .cse51) (or .cse67 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse85 (store (store .cse27 .cse86 .cse78) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse81 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse85))) (let ((.cse84 (select .cse81 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse79 (select .cse84 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse80 (select .cse85 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse82 (store .cse84 .cse25 (+ .cse79 .cse80 2)))) (let ((.cse83 (select (select (store .cse81 |c_ULTIMATE.start_main_~a~0#1.base| .cse82) |c_ULTIMATE.start_main_~b~0#1.base|) .cse23))) (+ .cse79 .cse80 (select (select (store .cse81 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse82 .cse18 (+ .cse79 .cse80 .cse83 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse22) .cse83))))))) .cse28))))))) (or (let ((.cse95 (+ 2 .cse9))) (and (or .cse67 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (= .cse28 (let ((.cse94 (store (store .cse27 .cse86 .cse95) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse90 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse94))) (let ((.cse93 (select .cse90 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse88 (select .cse94 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse92 (select .cse93 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse91 (store .cse93 .cse25 (+ .cse88 2 .cse92)))) (let ((.cse89 (select (select (store .cse90 |c_ULTIMATE.start_main_~a~0#1.base| .cse91) |c_ULTIMATE.start_main_~b~0#1.base|) .cse23))) (+ .cse88 .cse89 (select (select (store .cse90 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse91 .cse18 (+ .cse88 .cse89 .cse92 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse22) .cse92)))))))) (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= .cse28 (let ((.cse102 (store (store .cse27 .cse50 .cse95) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse97 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse102))) (let ((.cse101 (select .cse97 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse96 (select .cse101 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse100 (select .cse102 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse98 (store .cse101 .cse25 (+ .cse96 2 .cse100)))) (let ((.cse99 (select (select (store .cse97 |c_ULTIMATE.start_main_~a~0#1.base| .cse98) |c_ULTIMATE.start_main_~b~0#1.base|) .cse23))) (+ .cse96 (select (select (store .cse97 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse98 .cse18 (+ .cse96 .cse99 .cse100 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse22) .cse99 .cse100)))))))))) .cse51))) (not .cse70)))) .cse4) (or .cse4 (= .cse3 (select .cse104 .cse2))) (or .cse0 .cse4 (= .cse3 (select .cse13 .cse2)) .cse5)))))))) is different from true [2023-02-15 10:08:24,017 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse22 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse17 (+ 16 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse89 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse87 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse88 (* .cse89 8)) (.cse36 (<= .cse89 2147483647)) (.cse18 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (select .cse22 .cse17))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (= .cse6 5)) (.cse7 (select .cse22 .cse18)) (.cse5 (<= (mod c_~N~0 4294967296) 536870911)) (.cse8 (= (select .cse22 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) (.cse0 (+ c_~N~0 1)) (.cse9 (< 4 c_~N~0)) (.cse53 (not .cse36)) (.cse52 (+ .cse88 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse10 (+ c_~N~0 10)) (.cse16 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse20 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse35 (+ .cse88 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse3 (* 8 .cse87)) (.cse4 (not (< 3 c_~N~0)))) (and (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (or .cse2 (= 16 .cse3)) (not (<= c_~N~0 0)) (or (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) .cse4 (= (+ c_~N~0 16) (select .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24)))) .cse5 .cse2 (= .cse6 (+ 2 .cse7)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) .cse8 (< 1 c_~N~0) (or (= 8 .cse3) (= 3 .cse7)) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse5) (and (not .cse5) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (or .cse9 (let ((.cse55 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse54 (* .cse55 8)) (.cse26 (<= .cse55 2147483647))) (let ((.cse25 (not .cse26)) (.cse23 (+ .cse54 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse34 (+ .cse54 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|))) (and (or (let ((.cse24 (+ 2 (select .cse22 .cse35)))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= .cse10 (let ((.cse21 (store (store .cse22 .cse23 .cse24) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse21))) (let ((.cse19 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse12 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse15 (store .cse19 .cse20 (+ .cse12 .cse13 2)))) (let ((.cse11 (select (select (store .cse14 |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~b~0#1.base|) .cse18))) (+ .cse11 .cse12 .cse13 (select (select (store .cse14 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse15 .cse16 (+ .cse11 .cse12 .cse13 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse17))))))))))) .cse25) (or .cse26 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (= .cse10 (let ((.cse33 (store (store .cse22 .cse34 .cse24) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse33))) (let ((.cse32 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse27 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse30 (select .cse33 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse29 (store .cse32 .cse20 (+ .cse27 2 .cse30)))) (let ((.cse31 (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~b~0#1.base|) .cse18))) (+ .cse27 (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse29 .cse16 (+ .cse27 .cse30 .cse31 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse17) .cse30 .cse31)))))))) (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0)))))) .cse36) (or (let ((.cse44 (+ 2 (select .cse22 .cse52)))) (and (or .cse25 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse43 (store (store .cse22 .cse23 .cse44) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse43))) (let ((.cse42 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse39 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse41 (select .cse43 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse38 (store .cse42 .cse20 (+ .cse39 2 .cse41)))) (let ((.cse40 (select (select (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| .cse38) |c_ULTIMATE.start_main_~b~0#1.base|) .cse18))) (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse38 .cse16 (+ .cse39 .cse40 .cse41 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse17) .cse39 .cse40 .cse41))))))) .cse10)))) (or .cse26 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (= .cse10 (let ((.cse51 (store (store .cse22 .cse34 .cse44) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse51))) (let ((.cse50 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse45 (select .cse51 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse48 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse47 (store .cse50 .cse20 (+ .cse45 2 .cse48)))) (let ((.cse49 (select (select (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| .cse47) |c_ULTIMATE.start_main_~b~0#1.base|) .cse18))) (+ .cse45 (select (select (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse47 .cse16 (+ .cse45 .cse48 4 .cse49))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse17) .cse48 .cse49)))))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0)))))) .cse53))))) .cse4) (or .cse8 (= .cse3 0)) (<= c_~N~0 2147483647) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< |c_ULTIMATE.start_main_~i~0#1| .cse0) (or .cse9 (let ((.cse56 (<= .cse87 2147483647))) (and (or .cse56 (let ((.cse64 (+ (select .cse22 (+ (- 34359738368) .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)) 2))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= .cse10 (let ((.cse63 (store (store .cse22 .cse35 .cse64) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse63))) (let ((.cse62 (select .cse60 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse57 (select .cse62 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse58 (select .cse63 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse61 (store .cse62 .cse20 (+ .cse57 2 .cse58)))) (let ((.cse59 (select (select (store .cse60 |c_ULTIMATE.start_main_~a~0#1.base| .cse61) |c_ULTIMATE.start_main_~b~0#1.base|) .cse18))) (+ .cse57 .cse58 .cse59 (select (select (store .cse60 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse61 .cse16 (+ .cse57 .cse58 .cse59 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse17))))))))))) .cse36) (or .cse53 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse71 (store (store .cse22 .cse52 .cse64) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse71))) (let ((.cse70 (select .cse67 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse65 (select .cse70 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse66 (select .cse71 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse68 (store .cse70 .cse20 (+ .cse65 .cse66 2)))) (let ((.cse69 (select (select (store .cse67 |c_ULTIMATE.start_main_~a~0#1.base| .cse68) |c_ULTIMATE.start_main_~b~0#1.base|) .cse18))) (+ .cse65 .cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse68 .cse16 (+ .cse65 .cse66 .cse69 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse17) .cse69))))))) .cse10))))))) (or (let ((.cse79 (+ 2 (select .cse22 (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (and (or .cse53 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (= .cse10 (let ((.cse78 (store (store .cse22 .cse52 .cse79) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse78))) (let ((.cse77 (select .cse74 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse72 (select .cse78 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse76 (select .cse77 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse75 (store .cse77 .cse20 (+ .cse72 2 .cse76)))) (let ((.cse73 (select (select (store .cse74 |c_ULTIMATE.start_main_~a~0#1.base| .cse75) |c_ULTIMATE.start_main_~b~0#1.base|) .cse18))) (+ .cse72 .cse73 (select (select (store .cse74 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse75 .cse16 (+ .cse72 .cse73 .cse76 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse17) .cse76)))))))) (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= .cse10 (let ((.cse86 (store (store .cse22 .cse35 .cse79) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse81 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse86))) (let ((.cse85 (select .cse81 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse80 (select .cse85 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse84 (select .cse86 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse82 (store .cse85 .cse20 (+ .cse80 2 .cse84)))) (let ((.cse83 (select (select (store .cse81 |c_ULTIMATE.start_main_~a~0#1.base| .cse82) |c_ULTIMATE.start_main_~b~0#1.base|) .cse18))) (+ .cse80 (select (select (store .cse81 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse82 .cse16 (+ .cse80 .cse83 .cse84 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse17) .cse83 .cse84)))))))))) .cse36))) (not .cse56)))) .cse4))))) is different from true [2023-02-15 10:08:29,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:08:31,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:08:36,344 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse118 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse115 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse56 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (* 8 .cse115)) (.cse32 (* .cse118 8)) (.cse120 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse116 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse117 (mod .cse120 4294967296)) (.cse119 (+ .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (select .cse56 (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse15 (select .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse3)))) (let ((.cse42 (store .cse1 .cse119 (+ 2 .cse13 .cse15))) (.cse37 (* .cse117 8)) (.cse20 (mod .cse116 4294967296)) (.cse99 (+ .cse32 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse41 (< .cse120 c_~N~0)) (.cse23 (select .cse56 .cse99)) (.cse24 (select .cse1 .cse119)) (.cse52 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse51 (+ 16 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse33 (<= .cse118 2147483647)) (.cse35 (<= .cse117 2147483647)) (.cse29 (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse19 (* 8 .cse20)) (.cse4 (< .cse116 c_~N~0)) (.cse39 (+ .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~b~0#1.base|) .cse99))) (let ((.cse5 (store .cse42 .cse39 (+ .cse12 .cse13 4 .cse15))) (.cse10 (not .cse4)) (.cse11 (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (< .cse29 c_~N~0)) (.cse21 (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (.cse34 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse38 (not .cse35)) (.cse14 (+ .cse37 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (+ c_~N~0 1)) (.cse43 (< 4 c_~N~0)) (.cse30 (not .cse33)) (.cse44 (+ c_~N~0 10)) (.cse50 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse54 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse66 (+ .cse32 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (= (select .cse56 .cse51) 5)) (.cse82 (= (select .cse56 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) (.cse40 (= 3 (select .cse56 .cse52))) (.cse8 (not (< 3 c_~N~0))) (.cse7 (+ c_~N~0 16)) (.cse22 (store .cse1 .cse39 (+ 2 .cse23 .cse24))) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24)) (.cse9 (not .cse41))) (and (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (or .cse2 (= 16 .cse3)) (or .cse4 (= (select .cse5 .cse6) .cse7) .cse8 .cse9) (or .cse8 .cse10 (= .cse7 (select (store .cse5 .cse11 (+ .cse12 6 .cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~b~0#1.base|) .cse14) .cse15)) .cse6)) .cse16) (or .cse10 (let ((.cse18 (+ c_~N~0 (* 6 |c_ULTIMATE.start_main_~i~0#1|) 9 .cse21)) (.cse17 (<= .cse20 2147483647))) (and (or (not .cse17) (= .cse18 (select .cse1 .cse11))) (or (= .cse18 (select .cse1 (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) .cse17)))) (or .cse8 .cse10 (= (select (store .cse22 .cse11 (+ .cse23 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~b~0#1.base|) .cse14) 4 .cse24)) .cse6) .cse7) .cse16) (or (let ((.cse28 (mod .cse29 4294967296))) (let ((.cse27 (<= .cse28 2147483647)) (.cse25 (+ c_~N~0 (* 8 |c_ULTIMATE.start_main_~i~0#1|) 16 .cse21)) (.cse26 (* .cse28 8))) (and (or (= .cse25 (select .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse26))) (not .cse27)) (or .cse27 (= .cse25 (select .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) .cse26))))))) (not .cse16)) (<= (mod c_~N~0 4294967296) 536870911) (or (let ((.cse31 (+ (* 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0 .cse21 1))) (and (or .cse30 (= .cse31 .cse24)) (or (= .cse31 (select .cse1 (+ .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) .cse33))) .cse34) (or .cse9 (let ((.cse36 (+ c_~N~0 (* |c_ULTIMATE.start_main_~i~0#1| 4) .cse21 4))) (and (or .cse35 (= .cse36 (select .cse1 (+ .cse37 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))))) (or .cse38 (= (select .cse1 .cse39) .cse36))))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (< 1 c_~N~0) (or (= 8 .cse3) .cse40) (or .cse41 .cse8 .cse34 (= (select .cse42 .cse6) .cse7)) (or .cse43 (let ((.cse65 (+ .cse37 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|))) (and (or (let ((.cse57 (+ 2 (select .cse56 .cse66)))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= .cse44 (let ((.cse55 (store (store .cse56 .cse14 .cse57) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse55))) (let ((.cse53 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse46 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse47 (select .cse55 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse49 (store .cse53 .cse54 (+ .cse46 .cse47 2)))) (let ((.cse45 (select (select (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| .cse49) |c_ULTIMATE.start_main_~b~0#1.base|) .cse52))) (+ .cse45 .cse46 .cse47 (select (select (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse49 .cse50 (+ .cse45 .cse46 .cse47 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse51))))))))))) .cse38) (or .cse35 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (= .cse44 (let ((.cse64 (store (store .cse56 .cse65 .cse57) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse64))) (let ((.cse63 (select .cse59 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse58 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse61 (select .cse64 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse60 (store .cse63 .cse54 (+ .cse58 2 .cse61)))) (let ((.cse62 (select (select (store .cse59 |c_ULTIMATE.start_main_~a~0#1.base| .cse60) |c_ULTIMATE.start_main_~b~0#1.base|) .cse52))) (+ .cse58 (select (select (store .cse59 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse60 .cse50 (+ .cse58 .cse61 .cse62 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse51) .cse61 .cse62)))))))) (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0)))))) .cse33) (or (let ((.cse74 (+ 2 .cse23))) (and (or .cse38 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse73 (store (store .cse56 .cse14 .cse74) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse73))) (let ((.cse72 (select .cse67 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse69 (select .cse72 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse71 (select .cse73 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse68 (store .cse72 .cse54 (+ .cse69 2 .cse71)))) (let ((.cse70 (select (select (store .cse67 |c_ULTIMATE.start_main_~a~0#1.base| .cse68) |c_ULTIMATE.start_main_~b~0#1.base|) .cse52))) (+ (select (select (store .cse67 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse68 .cse50 (+ .cse69 .cse70 .cse71 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse51) .cse69 .cse70 .cse71))))))) .cse44)))) (or .cse35 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (= .cse44 (let ((.cse81 (store (store .cse56 .cse65 .cse74) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse76 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse81))) (let ((.cse80 (select .cse76 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse75 (select .cse81 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse78 (select .cse80 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse77 (store .cse80 .cse54 (+ .cse75 2 .cse78)))) (let ((.cse79 (select (select (store .cse76 |c_ULTIMATE.start_main_~a~0#1.base| .cse77) |c_ULTIMATE.start_main_~b~0#1.base|) .cse52))) (+ .cse75 (select (select (store .cse76 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse77 .cse50 (+ .cse75 .cse78 4 .cse79))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse51) .cse78 .cse79)))))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0)))))) .cse30))) .cse8) (or .cse82 (= .cse3 0)) (<= c_~N~0 2147483647) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< |c_ULTIMATE.start_main_~i~0#1| .cse0) (or .cse43 (let ((.cse83 (<= .cse115 2147483647))) (and (or .cse83 (let ((.cse91 (+ (select .cse56 (+ (- 34359738368) .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)) 2))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= .cse44 (let ((.cse90 (store (store .cse56 .cse66 .cse91) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse87 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse90))) (let ((.cse89 (select .cse87 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse84 (select .cse89 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse85 (select .cse90 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse88 (store .cse89 .cse54 (+ .cse84 2 .cse85)))) (let ((.cse86 (select (select (store .cse87 |c_ULTIMATE.start_main_~a~0#1.base| .cse88) |c_ULTIMATE.start_main_~b~0#1.base|) .cse52))) (+ .cse84 .cse85 .cse86 (select (select (store .cse87 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse88 .cse50 (+ .cse84 .cse85 .cse86 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse51))))))))))) .cse33) (or .cse30 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse98 (store (store .cse56 .cse99 .cse91) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse94 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse98))) (let ((.cse97 (select .cse94 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse92 (select .cse97 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse93 (select .cse98 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse95 (store .cse97 .cse54 (+ .cse92 .cse93 2)))) (let ((.cse96 (select (select (store .cse94 |c_ULTIMATE.start_main_~a~0#1.base| .cse95) |c_ULTIMATE.start_main_~b~0#1.base|) .cse52))) (+ .cse92 .cse93 (select (select (store .cse94 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse95 .cse50 (+ .cse92 .cse93 .cse96 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse51) .cse96))))))) .cse44))))))) (or (let ((.cse107 (+ 2 .cse13))) (and (or .cse30 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (= .cse44 (let ((.cse106 (store (store .cse56 .cse99 .cse107) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse102 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse106))) (let ((.cse105 (select .cse102 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse100 (select .cse106 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse104 (select .cse105 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse103 (store .cse105 .cse54 (+ .cse100 2 .cse104)))) (let ((.cse101 (select (select (store .cse102 |c_ULTIMATE.start_main_~a~0#1.base| .cse103) |c_ULTIMATE.start_main_~b~0#1.base|) .cse52))) (+ .cse100 .cse101 (select (select (store .cse102 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse103 .cse50 (+ .cse100 .cse101 .cse104 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse51) .cse104)))))))) (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= .cse44 (let ((.cse114 (store (store .cse56 .cse66 .cse107) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse109 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse114))) (let ((.cse113 (select .cse109 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse108 (select .cse113 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse112 (select .cse114 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse110 (store .cse113 .cse54 (+ .cse108 2 .cse112)))) (let ((.cse111 (select (select (store .cse109 |c_ULTIMATE.start_main_~a~0#1.base| .cse110) |c_ULTIMATE.start_main_~b~0#1.base|) .cse52))) (+ .cse108 (select (select (store .cse109 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse110 .cse50 (+ .cse108 .cse111 .cse112 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse51) .cse111 .cse112)))))))))) .cse33))) (not .cse83)))) .cse8) (or (and .cse2 .cse82 (<= (+ 2 (* 4294967296 (div (+ c_~N~0 4294967293) 4294967296))) c_~N~0)) (and (or (and .cse82 (<= (+ (* (div (+ 4294967292 c_~N~0) 4294967296) 4294967296) 3) c_~N~0)) (and .cse2 .cse82)) .cse40)) (or .cse4 .cse8 (= .cse7 (select .cse22 .cse6)) .cse9)))))))) is different from true [2023-02-15 10:08:38,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:09:39,958 WARN L233 SmtUtils]: Spent 49.09s on a formula simplification that was a NOOP. DAG size: 176 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:09:41,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:09:54,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:09:56,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:10:30,066 WARN L233 SmtUtils]: Spent 19.00s on a formula simplification that was a NOOP. DAG size: 154 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:10:32,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:10:46,768 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse111 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse106 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse38 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (* 8 .cse106)) (.cse109 (* .cse111 8)) (.cse113 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse69 (mod .cse113 4294967296)) (.cse112 (+ .cse109 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (select .cse38 (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse15 (select .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse3)))) (let ((.cse24 (store .cse1 .cse112 (+ 2 .cse13 .cse15))) (.cse68 (* .cse69 8)) (.cse110 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse33 (+ 16 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse90 (+ .cse109 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse23 (< .cse113 c_~N~0)) (.cse18 (select .cse38 .cse90)) (.cse19 (select .cse1 .cse112)) (.cse107 (< 3 c_~N~0)) (.cse51 (<= .cse111 2147483647)) (.cse34 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse20 (select .cse38 .cse33)) (.cse4 (< .cse110 c_~N~0)) (.cse108 (+ .cse68 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~b~0#1.base|) .cse90))) (let ((.cse5 (store .cse24 .cse108 (+ .cse12 .cse13 4 .cse15))) (.cse10 (not .cse4)) (.cse11 (+ (* 8 (mod .cse110 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse2 (= .cse20 5)) (.cse21 (select .cse38 .cse34)) (.cse14 (+ .cse68 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse22 (= (select .cse38 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) (.cse0 (+ c_~N~0 1)) (.cse25 (< 4 c_~N~0)) (.cse67 (not .cse51)) (.cse26 (+ c_~N~0 10)) (.cse32 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse36 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse50 (+ .cse109 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse8 (not .cse107)) (.cse7 (+ c_~N~0 16)) (.cse17 (store .cse1 .cse108 (+ 2 .cse18 .cse19))) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24)) (.cse9 (not .cse23))) (and (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (or .cse2 (= 16 .cse3)) (or .cse4 (= (select .cse5 .cse6) .cse7) .cse8 .cse9) (or .cse8 .cse10 (= .cse7 (select (store .cse5 .cse11 (+ .cse12 6 .cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~b~0#1.base|) .cse14) .cse15)) .cse6)) .cse16) (or .cse8 .cse10 (= (select (store .cse17 .cse11 (+ .cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~b~0#1.base|) .cse14) 4 .cse19)) .cse6) .cse7) .cse16) (<= (mod c_~N~0 4294967296) 536870911) .cse2 (= .cse20 (+ 2 .cse21)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) .cse22 (< 1 c_~N~0) (or (= 8 .cse3) (= 3 .cse21)) (or .cse23 .cse8 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (= (select .cse24 .cse6) .cse7)) (<= |c_ULTIMATE.start_main_~i~0#1| 4) (or .cse25 (let ((.cse41 (<= .cse69 2147483647))) (let ((.cse40 (not .cse41)) (.cse49 (+ .cse68 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|))) (and (or (let ((.cse39 (+ 2 (select .cse38 .cse50)))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= .cse26 (let ((.cse37 (store (store .cse38 .cse14 .cse39) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse37))) (let ((.cse35 (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse28 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse29 (select .cse37 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse31 (store .cse35 .cse36 (+ .cse28 .cse29 2)))) (let ((.cse27 (select (select (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| .cse31) |c_ULTIMATE.start_main_~b~0#1.base|) .cse34))) (+ .cse27 .cse28 .cse29 (select (select (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse31 .cse32 (+ .cse27 .cse28 .cse29 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse33))))))))))) .cse40) (or .cse41 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (= .cse26 (let ((.cse48 (store (store .cse38 .cse49 .cse39) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse48))) (let ((.cse47 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse42 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse45 (select .cse48 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse44 (store .cse47 .cse36 (+ .cse42 2 .cse45)))) (let ((.cse46 (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| .cse44) |c_ULTIMATE.start_main_~b~0#1.base|) .cse34))) (+ .cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse44 .cse32 (+ .cse42 .cse45 .cse46 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse33) .cse45 .cse46)))))))) (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0)))))) .cse51) (or (let ((.cse59 (+ 2 .cse18))) (and (or .cse40 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse58 (store (store .cse38 .cse14 .cse59) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse58))) (let ((.cse57 (select .cse52 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse54 (select .cse57 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse56 (select .cse58 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse53 (store .cse57 .cse36 (+ .cse54 2 .cse56)))) (let ((.cse55 (select (select (store .cse52 |c_ULTIMATE.start_main_~a~0#1.base| .cse53) |c_ULTIMATE.start_main_~b~0#1.base|) .cse34))) (+ (select (select (store .cse52 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse53 .cse32 (+ .cse54 .cse55 .cse56 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse33) .cse54 .cse55 .cse56))))))) .cse26)))) (or .cse41 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (= .cse26 (let ((.cse66 (store (store .cse38 .cse49 .cse59) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse66))) (let ((.cse65 (select .cse61 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse60 (select .cse66 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse63 (select .cse65 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse62 (store .cse65 .cse36 (+ .cse60 2 .cse63)))) (let ((.cse64 (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| .cse62) |c_ULTIMATE.start_main_~b~0#1.base|) .cse34))) (+ .cse60 (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse62 .cse32 (+ .cse60 .cse63 4 .cse64))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse33) .cse63 .cse64)))))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0)))))) .cse67)))) .cse8) (or .cse22 (= .cse3 0)) (<= c_~N~0 2147483647) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse73 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse70 (select .cse73 8)) (.cse72 (select .cse73 16)) (.cse71 (select .cse73 0))) (and (= .cse70 3) (= .cse71 1) (= (select .cse1 .cse36) (+ c_~N~0 3 .cse71)) (= .cse72 5) (= (select .cse1 .cse32) (+ .cse70 c_~N~0 5 .cse71)) (= (select .cse1 .cse6) (+ .cse70 c_~N~0 7 .cse72 .cse71)))))) (< |c_ULTIMATE.start_main_~i~0#1| .cse0) (or .cse25 (let ((.cse74 (<= .cse106 2147483647))) (and (or .cse74 (let ((.cse82 (+ (select .cse38 (+ (- 34359738368) .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)) 2))) (and (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= .cse26 (let ((.cse81 (store (store .cse38 .cse50 .cse82) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse81))) (let ((.cse80 (select .cse78 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse75 (select .cse80 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse76 (select .cse81 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse79 (store .cse80 .cse36 (+ .cse75 2 .cse76)))) (let ((.cse77 (select (select (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| .cse79) |c_ULTIMATE.start_main_~b~0#1.base|) .cse34))) (+ .cse75 .cse76 .cse77 (select (select (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse79 .cse32 (+ .cse75 .cse76 .cse77 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse33))))))))))) .cse51) (or .cse67 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= (let ((.cse89 (store (store .cse38 .cse90 .cse82) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse85 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse89))) (let ((.cse88 (select .cse85 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse83 (select .cse88 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse84 (select .cse89 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse86 (store .cse88 .cse36 (+ .cse83 .cse84 2)))) (let ((.cse87 (select (select (store .cse85 |c_ULTIMATE.start_main_~a~0#1.base| .cse86) |c_ULTIMATE.start_main_~b~0#1.base|) .cse34))) (+ .cse83 .cse84 (select (select (store .cse85 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse86 .cse32 (+ .cse83 .cse84 .cse87 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse33) .cse87))))))) .cse26))))))) (or (let ((.cse98 (+ 2 .cse13))) (and (or .cse67 (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (= .cse26 (let ((.cse97 (store (store .cse38 .cse90 .cse98) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse93 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse97))) (let ((.cse96 (select .cse93 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse91 (select .cse97 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse95 (select .cse96 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse94 (store .cse96 .cse36 (+ .cse91 2 .cse95)))) (let ((.cse92 (select (select (store .cse93 |c_ULTIMATE.start_main_~a~0#1.base| .cse94) |c_ULTIMATE.start_main_~b~0#1.base|) .cse34))) (+ .cse91 .cse92 (select (select (store .cse93 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse94 .cse32 (+ .cse91 .cse92 .cse95 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse33) .cse95)))))))) (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_196| Int) (v_ArrVal_736 Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_196| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_196| 1) c_~N~0) (= .cse26 (let ((.cse105 (store (store .cse38 .cse50 .cse98) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_196| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_736))) (let ((.cse100 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse105))) (let ((.cse104 (select .cse100 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse99 (select .cse104 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse103 (select .cse105 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse101 (store .cse104 .cse36 (+ .cse99 2 .cse103)))) (let ((.cse102 (select (select (store .cse100 |c_ULTIMATE.start_main_~a~0#1.base| .cse101) |c_ULTIMATE.start_main_~b~0#1.base|) .cse34))) (+ .cse99 (select (select (store .cse100 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse101 .cse32 (+ .cse99 .cse102 .cse103 4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse33) .cse102 .cse103)))))))))) .cse51))) (not .cse74)))) .cse8) (or .cse4 .cse8 (= .cse7 (select .cse17 .cse6)) .cse9) .cse107))))))) is different from true [2023-02-15 10:10:48,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:10:51,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:10:56,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:11:30,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:11:32,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]