./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ifncomp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 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/ifncomp.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 6359f1f4cb6aed42e13f4959731bd90b4ed828bda061bd22e3b91472b1893854 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:00:54,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:00:54,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:00:54,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:00:54,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:00:54,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:00:54,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:00:54,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:00:54,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:00:54,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:00:54,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:00:54,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:00:54,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:00:54,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:00:54,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:00:54,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:00:54,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:00:54,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:00:54,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:00:54,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:00:54,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:00:54,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:00:54,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:00:54,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:00:54,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:00:54,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:00:54,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:00:54,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:00:54,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:00:54,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:00:54,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:00:54,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:00:54,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:00:54,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:00:54,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:00:54,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:00:54,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:00:54,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:00:54,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:00:54,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:00:54,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:00:54,582 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:00:54,605 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:00:54,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:00:54,605 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:00:54,606 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:00:54,606 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:00:54,606 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:00:54,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:00:54,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:00:54,607 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:00:54,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:00:54,608 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:00:54,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:00:54,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:00:54,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:00:54,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:00:54,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:00:54,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:00:54,609 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:00:54,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:00:54,609 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:00:54,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:00:54,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:00:54,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:00:54,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:00:54,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:00:54,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:00:54,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:00:54,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:00:54,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:00:54,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:00:54,611 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:00:54,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:00:54,612 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:00:54,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:00:54,612 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:00:54,612 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 -> 6359f1f4cb6aed42e13f4959731bd90b4ed828bda061bd22e3b91472b1893854 [2023-02-15 19:00:54,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:00:54,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:00:54,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:00:54,844 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:00:54,844 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:00:54,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ifncomp.c [2023-02-15 19:00:55,907 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:00:56,037 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:00:56,038 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ifncomp.c [2023-02-15 19:00:56,042 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87c1dcf4/bba5a1ed3638477bbe7bc3136194c344/FLAG3e760f161 [2023-02-15 19:00:56,051 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87c1dcf4/bba5a1ed3638477bbe7bc3136194c344 [2023-02-15 19:00:56,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:00:56,054 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:00:56,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:00:56,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:00:56,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:00:56,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:00:56" (1/1) ... [2023-02-15 19:00:56,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671e438d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:00:56, skipping insertion in model container [2023-02-15 19:00:56,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:00:56" (1/1) ... [2023-02-15 19:00:56,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:00:56,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:00:56,221 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/ifncomp.c[590,603] [2023-02-15 19:00:56,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:00:56,242 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:00:56,249 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/ifncomp.c[590,603] [2023-02-15 19:00:56,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:00:56,265 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:00:56,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:00:56 WrapperNode [2023-02-15 19:00:56,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:00:56,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:00:56,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:00:56,266 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:00:56,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:00:56" (1/1) ... [2023-02-15 19:00:56,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:00:56" (1/1) ... [2023-02-15 19:00:56,288 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 92 [2023-02-15 19:00:56,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:00:56,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:00:56,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:00:56,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:00:56,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:00:56" (1/1) ... [2023-02-15 19:00:56,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:00:56" (1/1) ... [2023-02-15 19:00:56,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:00:56" (1/1) ... [2023-02-15 19:00:56,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:00:56" (1/1) ... [2023-02-15 19:00:56,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:00:56" (1/1) ... [2023-02-15 19:00:56,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:00:56" (1/1) ... [2023-02-15 19:00:56,303 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:00:56" (1/1) ... [2023-02-15 19:00:56,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:00:56" (1/1) ... [2023-02-15 19:00:56,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:00:56,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:00:56,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:00:56,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:00:56,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:00:56" (1/1) ... [2023-02-15 19:00:56,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:00:56,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:00:56,328 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 19:00:56,330 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 19:00:56,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:00:56,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:00:56,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 19:00:56,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:00:56,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:00:56,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:00:56,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 19:00:56,422 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:00:56,424 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:00:56,598 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:00:56,602 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:00:56,602 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 19:00:56,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:00:56 BoogieIcfgContainer [2023-02-15 19:00:56,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:00:56,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:00:56,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:00:56,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:00:56,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:00:56" (1/3) ... [2023-02-15 19:00:56,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df72134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:00:56, skipping insertion in model container [2023-02-15 19:00:56,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:00:56" (2/3) ... [2023-02-15 19:00:56,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df72134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:00:56, skipping insertion in model container [2023-02-15 19:00:56,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:00:56" (3/3) ... [2023-02-15 19:00:56,609 INFO L112 eAbstractionObserver]: Analyzing ICFG ifncomp.c [2023-02-15 19:00:56,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:00:56,621 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:00:56,648 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:00:56,653 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;@69b02ed9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:00:56,653 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:00:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 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 19:00:56,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 19:00:56,660 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:00:56,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:00:56,661 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:00:56,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:00:56,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1152450264, now seen corresponding path program 1 times [2023-02-15 19:00:56,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:00:56,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766192939] [2023-02-15 19:00:56,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:00:56,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:00:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:00:56,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:00:56,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766192939] [2023-02-15 19:00:56,756 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 19:00:56,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47762871] [2023-02-15 19:00:56,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:00:56,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:00:56,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:00:56,759 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 19:00:56,773 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 19:00:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:00:56,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 19:00:56,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:00:56,881 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 19:00:56,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:00:56,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47762871] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:00:56,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:00:56,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 19:00:56,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237376501] [2023-02-15 19:00:56,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:00:56,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 19:00:56,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:00:56,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 19:00:56,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:00:56,920 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 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 7.0) internal successors, (14), 2 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 19:00:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:00:56,933 INFO L93 Difference]: Finished difference Result 50 states and 74 transitions. [2023-02-15 19:00:56,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 19:00:56,935 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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 19:00:56,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:00:56,939 INFO L225 Difference]: With dead ends: 50 [2023-02-15 19:00:56,939 INFO L226 Difference]: Without dead ends: 23 [2023-02-15 19:00:56,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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 19:00:56,943 INFO L413 NwaCegarLoop]: 34 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, 34 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 19:00:56,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:00:56,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-15 19:00:56,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-15 19:00:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 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 19:00:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-02-15 19:00:56,964 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 14 [2023-02-15 19:00:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:00:56,965 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-02-15 19:00:56,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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 19:00:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-02-15 19:00:56,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 19:00:56,966 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:00:56,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:00:56,972 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 19:00:57,168 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 19:00:57,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:00:57,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:00:57,169 INFO L85 PathProgramCache]: Analyzing trace with hash 670750212, now seen corresponding path program 1 times [2023-02-15 19:00:57,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:00:57,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696530277] [2023-02-15 19:00:57,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:00:57,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:00:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:00:57,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:00:57,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696530277] [2023-02-15 19:00:57,208 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 19:00:57,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127306398] [2023-02-15 19:00:57,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:00:57,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:00:57,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:00:57,209 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 19:00:57,212 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 19:00:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:00:57,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 19:00:57,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:00:57,298 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 19:00:57,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:00:57,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127306398] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:00:57,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:00:57,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:00:57,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375420411] [2023-02-15 19:00:57,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:00:57,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:00:57,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:00:57,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:00:57,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:00:57,308 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 19:00:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:00:57,381 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2023-02-15 19:00:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:00:57,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 19:00:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:00:57,383 INFO L225 Difference]: With dead ends: 53 [2023-02-15 19:00:57,383 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 19:00:57,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:00:57,385 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 56 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:00:57,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 16 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:00:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 19:00:57,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2023-02-15 19:00:57,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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 19:00:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-02-15 19:00:57,397 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 14 [2023-02-15 19:00:57,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:00:57,397 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-02-15 19:00:57,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 19:00:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-02-15 19:00:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 19:00:57,398 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:00:57,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:00:57,408 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 19:00:57,602 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 19:00:57,603 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:00:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:00:57,603 INFO L85 PathProgramCache]: Analyzing trace with hash -203130337, now seen corresponding path program 1 times [2023-02-15 19:00:57,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:00:57,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218185426] [2023-02-15 19:00:57,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:00:57,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:00:57,633 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:00:57,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1635237079] [2023-02-15 19:00:57,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:00:57,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:00:57,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:00:57,670 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 19:00:57,685 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 19:00:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:00:57,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 19:00:57,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:00:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 19:00:57,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:00:57,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:00:57,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218185426] [2023-02-15 19:00:57,751 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:00:57,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635237079] [2023-02-15 19:00:57,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635237079] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:00:57,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:00:57,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:00:57,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90831651] [2023-02-15 19:00:57,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:00:57,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:00:57,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:00:57,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:00:57,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:00:57,754 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 19:00:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:00:57,789 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2023-02-15 19:00:57,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:00:57,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 23 [2023-02-15 19:00:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:00:57,790 INFO L225 Difference]: With dead ends: 58 [2023-02-15 19:00:57,790 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 19:00:57,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:00:57,792 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:00:57,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 25 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:00:57,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 19:00:57,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2023-02-15 19:00:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.25) internal successors, (35), 28 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 19:00:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-02-15 19:00:57,796 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 23 [2023-02-15 19:00:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:00:57,797 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-02-15 19:00:57,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 19:00:57,797 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-02-15 19:00:57,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 19:00:57,797 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:00:57,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:00:57,819 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 19:00:58,002 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 19:00:58,003 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:00:58,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:00:58,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1978137699, now seen corresponding path program 1 times [2023-02-15 19:00:58,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:00:58,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230901696] [2023-02-15 19:00:58,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:00:58,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:00:58,021 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:00:58,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [893279552] [2023-02-15 19:00:58,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:00:58,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:00:58,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:00:58,023 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 19:00:58,025 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 19:00:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:00:58,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 19:00:58,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:00:58,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:00:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 19:00:58,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:00:58,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:00:58,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230901696] [2023-02-15 19:00:58,228 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:00:58,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893279552] [2023-02-15 19:00:58,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893279552] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:00:58,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:00:58,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 19:00:58,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686666841] [2023-02-15 19:00:58,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:00:58,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 19:00:58,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:00:58,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 19:00:58,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:00:58,230 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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 19:00:58,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:00:58,373 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2023-02-15 19:00:58,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:00:58,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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 23 [2023-02-15 19:00:58,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:00:58,374 INFO L225 Difference]: With dead ends: 46 [2023-02-15 19:00:58,374 INFO L226 Difference]: Without dead ends: 44 [2023-02-15 19:00:58,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:00:58,375 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 63 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:00:58,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 54 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:00:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-15 19:00:58,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2023-02-15 19:00:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 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 19:00:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2023-02-15 19:00:58,379 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 23 [2023-02-15 19:00:58,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:00:58,380 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2023-02-15 19:00:58,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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 19:00:58,380 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2023-02-15 19:00:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 19:00:58,380 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:00:58,381 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:00:58,389 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 19:00:58,586 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 19:00:58,587 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:00:58,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:00:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1659346963, now seen corresponding path program 1 times [2023-02-15 19:00:58,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:00:58,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23362676] [2023-02-15 19:00:58,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:00:58,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:00:58,643 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:00:58,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [323338498] [2023-02-15 19:00:58,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:00:58,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:00:58,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:00:58,645 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 19:00:58,647 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 19:00:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:00:58,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 19:00:58,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:00:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:00:58,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:00:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:00:58,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:00:58,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23362676] [2023-02-15 19:00:58,806 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:00:58,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323338498] [2023-02-15 19:00:58,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323338498] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:00:58,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:00:58,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-15 19:00:58,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292505505] [2023-02-15 19:00:58,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:00:58,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 19:00:58,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:00:58,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 19:00:58,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 19:00:58,808 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 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 19:00:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:00:58,937 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2023-02-15 19:00:58,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:00:58,938 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 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 19:00:58,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:00:58,938 INFO L225 Difference]: With dead ends: 92 [2023-02-15 19:00:58,938 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 19:00:58,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:00:58,939 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 62 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:00:58,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 46 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:00:58,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 19:00:58,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2023-02-15 19:00:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 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 19:00:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-02-15 19:00:58,943 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 26 [2023-02-15 19:00:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:00:58,943 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-02-15 19:00:58,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 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 19:00:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-02-15 19:00:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 19:00:58,944 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:00:58,944 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:00:58,962 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 19:00:59,148 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 19:00:59,149 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:00:59,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:00:59,149 INFO L85 PathProgramCache]: Analyzing trace with hash -643446870, now seen corresponding path program 1 times [2023-02-15 19:00:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:00:59,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445258727] [2023-02-15 19:00:59,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:00:59,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:00:59,171 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:00:59,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [753007474] [2023-02-15 19:00:59,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:00:59,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:00:59,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:00:59,173 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 19:00:59,175 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 19:00:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:00:59,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 19:00:59,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:00:59,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:00:59,317 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 21 treesize of output 20 [2023-02-15 19:00:59,341 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:00:59,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:00:59,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-02-15 19:00:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 19:00:59,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:00:59,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445258727] [2023-02-15 19:00:59,498 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:00:59,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753007474] [2023-02-15 19:00:59,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753007474] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:00:59,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:00:59,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-15 19:00:59,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457804291] [2023-02-15 19:00:59,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:00:59,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 19:00:59,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:00:59,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 19:00:59,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-02-15 19:00:59,500 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:00:59,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:00:59,799 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2023-02-15 19:00:59,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 19:00:59,799 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-15 19:00:59,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:00:59,800 INFO L225 Difference]: With dead ends: 134 [2023-02-15 19:00:59,800 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 19:00:59,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2023-02-15 19:00:59,801 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 125 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:00:59,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 77 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:00:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 19:00:59,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 49. [2023-02-15 19:00:59,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:00:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-02-15 19:00:59,808 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 32 [2023-02-15 19:00:59,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:00:59,808 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-02-15 19:00:59,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:00:59,808 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-02-15 19:00:59,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 19:00:59,809 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:00:59,809 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:00:59,827 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 19:01:00,014 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 19:01:00,015 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:01:00,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:01:00,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2051071008, now seen corresponding path program 1 times [2023-02-15 19:01:00,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:01:00,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838653591] [2023-02-15 19:01:00,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:01:00,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:01:00,032 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:01:00,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2008363862] [2023-02-15 19:01:00,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:01:00,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:01:00,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:01:00,034 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 19:01:00,065 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 19:01:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:01:00,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-15 19:01:00,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:01:00,153 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 19:01:00,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:01:00,244 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 21 treesize of output 20 [2023-02-15 19:01:00,277 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 19 treesize of output 18 [2023-02-15 19:01:00,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:00,344 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 38 treesize of output 32 [2023-02-15 19:01:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:01:00,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:01:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:01:01,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:01:01,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838653591] [2023-02-15 19:01:01,146 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:01:01,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008363862] [2023-02-15 19:01:01,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008363862] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:01:01,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:01:01,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2023-02-15 19:01:01,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554914225] [2023-02-15 19:01:01,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:01:01,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 19:01:01,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:01:01,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 19:01:01,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2023-02-15 19:01:01,148 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 28 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:01:06,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:01:06,697 INFO L93 Difference]: Finished difference Result 236 states and 270 transitions. [2023-02-15 19:01:06,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-02-15 19:01:06,698 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 28 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-15 19:01:06,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:01:06,699 INFO L225 Difference]: With dead ends: 236 [2023-02-15 19:01:06,699 INFO L226 Difference]: Without dead ends: 203 [2023-02-15 19:01:06,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=914, Invalid=3246, Unknown=0, NotChecked=0, Total=4160 [2023-02-15 19:01:06,700 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 581 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-15 19:01:06,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 249 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-02-15 19:01:06,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-02-15 19:01:06,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 85. [2023-02-15 19:01:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.25) internal successors, (105), 84 states have internal predecessors, (105), 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 19:01:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2023-02-15 19:01:06,724 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 36 [2023-02-15 19:01:06,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:01:06,725 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2023-02-15 19:01:06,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 28 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:01:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2023-02-15 19:01:06,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 19:01:06,727 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:01:06,728 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:01:06,735 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 19:01:06,928 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 19:01:06,928 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:01:06,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:01:06,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1866238698, now seen corresponding path program 2 times [2023-02-15 19:01:06,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:01:06,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438248218] [2023-02-15 19:01:06,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:01:06,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:01:06,945 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:01:06,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2081567289] [2023-02-15 19:01:06,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:01:06,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:01:06,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:01:06,950 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 19:01:06,960 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 19:01:07,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:01:07,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:01:07,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 19:01:07,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:01:07,118 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 19:01:07,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:01:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 19:01:07,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:01:07,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438248218] [2023-02-15 19:01:07,180 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:01:07,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081567289] [2023-02-15 19:01:07,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081567289] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:01:07,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:01:07,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-02-15 19:01:07,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327243302] [2023-02-15 19:01:07,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:01:07,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 19:01:07,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:01:07,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 19:01:07,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:01:07,181 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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 19:01:07,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:01:07,320 INFO L93 Difference]: Finished difference Result 215 states and 257 transitions. [2023-02-15 19:01:07,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 19:01:07,320 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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 40 [2023-02-15 19:01:07,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:01:07,323 INFO L225 Difference]: With dead ends: 215 [2023-02-15 19:01:07,323 INFO L226 Difference]: Without dead ends: 118 [2023-02-15 19:01:07,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-02-15 19:01:07,325 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 98 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:01:07,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 61 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:01:07,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-15 19:01:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 94. [2023-02-15 19:01:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.2043010752688172) internal successors, (112), 93 states have internal predecessors, (112), 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 19:01:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2023-02-15 19:01:07,341 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 40 [2023-02-15 19:01:07,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:01:07,341 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2023-02-15 19:01:07,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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 19:01:07,342 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2023-02-15 19:01:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 19:01:07,345 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:01:07,345 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:01:07,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 19:01:07,549 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 19:01:07,550 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:01:07,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:01:07,551 INFO L85 PathProgramCache]: Analyzing trace with hash 383833277, now seen corresponding path program 2 times [2023-02-15 19:01:07,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:01:07,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815518760] [2023-02-15 19:01:07,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:01:07,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:01:07,583 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:01:07,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1735567949] [2023-02-15 19:01:07,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:01:07,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:01:07,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:01:07,602 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 19:01:07,603 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 19:01:07,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:01:07,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:01:07,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 19:01:07,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:01:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 19:01:07,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:01:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 19:01:07,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:01:07,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815518760] [2023-02-15 19:01:07,863 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:01:07,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735567949] [2023-02-15 19:01:07,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735567949] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:01:07,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:01:07,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2023-02-15 19:01:07,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828939028] [2023-02-15 19:01:07,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:01:07,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 19:01:07,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:01:07,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 19:01:07,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-02-15 19:01:07,867 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 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 19:01:08,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:01:08,102 INFO L93 Difference]: Finished difference Result 252 states and 290 transitions. [2023-02-15 19:01:08,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 19:01:08,103 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 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 47 [2023-02-15 19:01:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:01:08,106 INFO L225 Difference]: With dead ends: 252 [2023-02-15 19:01:08,106 INFO L226 Difference]: Without dead ends: 173 [2023-02-15 19:01:08,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-02-15 19:01:08,108 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 231 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:01:08,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 88 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:01:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-02-15 19:01:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 131. [2023-02-15 19:01:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 130 states have internal predecessors, (152), 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 19:01:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2023-02-15 19:01:08,139 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 47 [2023-02-15 19:01:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:01:08,140 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2023-02-15 19:01:08,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 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 19:01:08,140 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2023-02-15 19:01:08,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 19:01:08,141 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:01:08,141 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:01:08,148 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 19:01:08,345 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 19:01:08,346 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:01:08,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:01:08,346 INFO L85 PathProgramCache]: Analyzing trace with hash 132233513, now seen corresponding path program 3 times [2023-02-15 19:01:08,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:01:08,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702594000] [2023-02-15 19:01:08,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:01:08,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:01:08,363 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 19:01:08,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1771479917] [2023-02-15 19:01:08,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 19:01:08,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:01:08,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:01:08,369 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 19:01:08,382 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 19:01:08,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 19:01:08,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:01:08,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-15 19:01:08,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:01:08,842 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:01:08,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-02-15 19:01:08,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:01:08,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2023-02-15 19:01:08,949 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2023-02-15 19:01:08,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 49 treesize of output 95 [2023-02-15 19:01:08,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 60 treesize of output 12 [2023-02-15 19:01:09,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 83 [2023-02-15 19:01:09,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:09,140 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2023-02-15 19:01:09,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 120 [2023-02-15 19:01:09,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 60 treesize of output 12 [2023-02-15 19:01:09,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2023-02-15 19:01:09,553 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 19:01:09,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 177 [2023-02-15 19:01:09,779 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:01:09,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:09,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:09,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:09,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:09,784 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 120 treesize of output 194 [2023-02-15 19:01:09,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:09,871 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 81 treesize of output 32 [2023-02-15 19:01:10,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 99 [2023-02-15 19:01:10,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:10,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:10,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:10,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:10,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 123 [2023-02-15 19:01:10,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:10,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:10,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:10,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:10,146 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 78 treesize of output 36 [2023-02-15 19:01:10,409 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:01:10,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 68 [2023-02-15 19:01:10,412 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 19:01:10,638 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 19:01:10,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 194 treesize of output 179 [2023-02-15 19:01:10,644 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:01:10,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:10,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:10,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:10,647 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 123 treesize of output 197 [2023-02-15 19:01:10,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:10,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:10,662 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 178 treesize of output 111 [2023-02-15 19:01:10,987 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 19:01:10,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 224 treesize of output 205 [2023-02-15 19:01:10,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:10,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:10,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:10,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:10,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 235 [2023-02-15 19:01:11,816 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-15 19:01:11,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 157 [2023-02-15 19:01:11,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:01:11,822 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 15 treesize of output 11 [2023-02-15 19:01:11,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 71 [2023-02-15 19:01:11,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 37 [2023-02-15 19:01:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:01:11,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:01:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:01:19,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:01:19,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702594000] [2023-02-15 19:01:19,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 19:01:19,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771479917] [2023-02-15 19:01:19,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771479917] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:01:19,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:01:19,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 62 [2023-02-15 19:01:19,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967165648] [2023-02-15 19:01:19,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:01:19,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-02-15 19:01:19,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:01:19,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-02-15 19:01:19,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=3185, Unknown=0, NotChecked=0, Total=3782 [2023-02-15 19:01:19,237 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand has 62 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 62 states have internal predecessors, (96), 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 19:01:46,257 WARN L233 SmtUtils]: Spent 25.35s on a formula simplification. DAG size of input: 217 DAG size of output: 191 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:03:25,315 WARN L233 SmtUtils]: Spent 1.15m on a formula simplification. DAG size of input: 281 DAG size of output: 230 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:03:34,134 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse44 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse42 (+ |c_ULTIMATE.start_main_~i~0#1| 2))) (let ((.cse16 (< .cse42 c_~N~0)) (.cse43 (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8)) (.cse24 (* (mod .cse44 4294967296) 8)) (.cse34 (< .cse44 c_~N~0))) (let ((.cse15 (not .cse34)) (.cse22 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 16)) (.cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (.cse8 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (.cse10 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse24)) (.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse43)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse11 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse43)) (.cse14 (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* (mod .cse42 4294967296) 8))) (.cse1 (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) c_~N~0)) (.cse2 (< 3 c_~N~0)) (.cse3 (not .cse16)) (.cse38 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse0 (not (< 2 c_~N~0))) (.cse35 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (and (or .cse0 .cse1 .cse2 .cse3 (forall ((v_ArrVal_406 Int)) (= (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (let ((.cse9 (store .cse13 |c_ULTIMATE.start_main_~b~0#1.offset| 1))) (store .cse9 .cse10 (+ (select .cse9 .cse11) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))) .cse14 v_ArrVal_406)))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse7 (select (select (store .cse4 |c_ULTIMATE.start_main_~c~0#1.base| .cse5) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse5 .cse6 (+ c_~N~0 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse7)))) 8))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or .cse15 .cse0 .cse16 .cse2 (forall ((v_ArrVal_400 Int) (v_ArrVal_406 Int)) (= (let ((.cse17 (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse23 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse24) v_ArrVal_400)))) (store .cse20 |c_ULTIMATE.start_main_~b~0#1.base| (store (let ((.cse21 (store (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) (store .cse21 .cse8 (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~b~0#1.base| .cse21) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) .cse22 v_ArrVal_406))))) (let ((.cse18 (store (select .cse17 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~c~0#1.base| .cse18) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse18 .cse6 (+ c_~N~0 .cse19))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse19)))) 8))) (or (forall ((v_ArrVal_406 Int)) (= (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse13 .cse11 (let ((.cse28 (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4294967295) 4294967296) 8))) (+ (select .cse23 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse28)) (select .cse13 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse28))))) .cse10 v_ArrVal_406)))) (let ((.cse27 (store (select .cse26 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~c~0#1.base| .cse27) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ .cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse27 .cse6 (+ c_~N~0 .cse25))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))))) 8)) .cse15 .cse0 .cse16 .cse2) (or (forall ((v_ArrVal_400 Int) (v_ArrVal_406 Int)) (= (let ((.cse29 (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse23 .cse12 v_ArrVal_400)))) (store .cse32 |c_ULTIMATE.start_main_~b~0#1.base| (store (let ((.cse33 (store (select .cse32 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) (store .cse33 .cse8 (+ (select (select (store .cse32 |c_ULTIMATE.start_main_~b~0#1.base| .cse33) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) .cse22 v_ArrVal_406))))) (let ((.cse30 (store (select .cse29 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse31 (select (select (store .cse29 |c_ULTIMATE.start_main_~c~0#1.base| .cse30) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ (select (select (store .cse29 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse30 .cse6 (+ c_~N~0 .cse31))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse31)))) 8)) .cse34 .cse0 .cse2) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (or .cse0 .cse35 .cse2 (= (let ((.cse36 (store .cse38 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| .cse36) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store .cse36 .cse6 (+ c_~N~0 .cse37))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse37))) 8)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (forall ((v_ArrVal_406 Int)) (= (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse13 .cse10 (+ (select .cse23 .cse12) (select .cse13 .cse11))) .cse14 v_ArrVal_406)))) (let ((.cse41 (store (select .cse40 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse39 (select (select (store .cse40 |c_ULTIMATE.start_main_~c~0#1.base| .cse41) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ .cse39 (select (select (store .cse40 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse41 .cse6 (+ c_~N~0 .cse39))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))))) 8)) .cse0 .cse1 .cse2 .cse3) (or (= (select .cse38 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 16)) (+ c_~N~0 8)) .cse0 .cse35) (<= c_~N~0 2147483647) (not (<= c_~N~0 0)) (= 0 |c_ULTIMATE.start_main_~c~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|))))) is different from true [2023-02-15 19:03:36,446 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse21 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse61 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse62 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse52 (mod .cse61 4294967296)) (.cse19 (* .cse21 8))) (let ((.cse10 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse19)) (.cse9 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse19)) (.cse51 (* .cse52 8)) (.cse27 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse29 (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4294967295) 4294967296) 8)) (.cse60 (mod .cse62 4294967296))) (let ((.cse32 (< .cse62 c_~N~0)) (.cse45 (* .cse60 8)) (.cse57 (select .cse11 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse29))) (.cse30 (select .cse27 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse29))) (.cse47 (< .cse61 c_~N~0)) (.cse8 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse51)) (.cse44 (select .cse27 .cse9)) (.cse17 (select .cse11 .cse10))) (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse51)) (.cse1 (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) c_~N~0)) (.cse46 (store .cse11 .cse8 (+ .cse44 .cse17))) (.cse15 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse25 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (.cse26 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (.cse33 (< 3 c_~N~0)) (.cse31 (not .cse47)) (.cse0 (not (< 2 c_~N~0))) (.cse48 (store .cse11 .cse10 (+ .cse57 .cse30))) (.cse12 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 16)) (.cse13 (+ c_~N~0 8)) (.cse3 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse45)) (.cse53 (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (.cse20 (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (.cse14 (not .cse32))) (and (or .cse0 .cse1 (= (select (let ((.cse7 (store .cse11 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse4 (select .cse7 .cse10)) (.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| .cse7) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9))) (let ((.cse2 (store .cse7 .cse8 (+ .cse4 .cse6)))) (store .cse2 .cse3 (+ .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| .cse2) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5) .cse6))))) .cse12) .cse13) .cse14) (or .cse15 (let ((.cse16 (<= .cse21 2147483647)) (.cse18 (+ c_~N~0 .cse20))) (and (or (not .cse16) (= .cse17 .cse18)) (or .cse16 (= (select .cse11 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse19 (- 34359738368))) .cse18))))) (or (forall ((v_ArrVal_406 Int)) (= (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse27 .cse9 (+ (select .cse28 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse29)) .cse30)) .cse5 v_ArrVal_406)))) (let ((.cse24 (store (select .cse23 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~c~0#1.base| .cse24) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ .cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse24 .cse25 (+ c_~N~0 .cse22))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse26))))) 8)) .cse31 .cse0 .cse32 .cse33) (or .cse31 .cse0 .cse32 (forall ((v_ArrVal_406 Int)) (= (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse27 .cse5 v_ArrVal_406)))) (let ((.cse35 (store (select .cse34 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse36 (select (select (store .cse34 |c_ULTIMATE.start_main_~c~0#1.base| .cse35) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ (select (select (store .cse34 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse35 .cse25 (+ c_~N~0 .cse36))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse26) .cse36)))) 8)) .cse33) (or (forall ((v_ArrVal_406 Int)) (= (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (let ((.cse40 (store .cse27 |c_ULTIMATE.start_main_~b~0#1.offset| 1))) (store .cse40 .cse26 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse40) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_406)))) (let ((.cse38 (store (select .cse37 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse39 (select (select (store .cse37 |c_ULTIMATE.start_main_~c~0#1.base| .cse38) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse38 .cse25 (+ c_~N~0 .cse39))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse26) .cse39)))) 8)) .cse0 .cse33) (or (forall ((v_ArrVal_406 Int)) (= (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse27 .cse5 (+ (select .cse28 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse19)) .cse44)) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse45) v_ArrVal_406)))) (let ((.cse43 (store (select .cse42 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse41 (select (select (store .cse42 |c_ULTIMATE.start_main_~c~0#1.base| .cse43) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ .cse41 (select (select (store .cse42 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse43 .cse25 (+ c_~N~0 .cse41))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse26))))) 8)) .cse0 .cse1 .cse33 .cse14) (or (= (select (store .cse46 .cse3 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| .cse46) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5) .cse44 .cse17)) .cse12) .cse13) .cse0 .cse1 .cse14) (or .cse31 .cse0 .cse32 (= (select .cse46 .cse12) .cse13)) (or .cse15 .cse47 .cse0 (= (select .cse48 .cse12) .cse13)) (or .cse31 (let ((.cse49 (+ c_~N~0 (* 3 .cse53) .cse20 (* 3 |c_ULTIMATE.start_main_~i~0#1|) 1)) (.cse50 (<= .cse52 2147483647))) (and (or (= (select .cse11 .cse8) .cse49) (not .cse50)) (or (= (select .cse11 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse51 (- 34359738368))) .cse49) .cse50)))) (or .cse15 (forall ((v_ArrVal_406 Int)) (= (let ((.cse55 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse27 .cse9 v_ArrVal_406)))) (let ((.cse56 (store (select .cse55 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse54 (select (select (store .cse55 |c_ULTIMATE.start_main_~c~0#1.base| .cse56) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ .cse54 (select (select (store .cse55 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse56 .cse25 (+ c_~N~0 .cse54))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse26))))) 8)) .cse47 .cse0 .cse33) (or .cse31 .cse0 .cse32 (= (select (store .cse48 .cse8 (+ .cse57 .cse30 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| .cse48) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9))) .cse12) .cse13)) (or (let ((.cse59 (<= .cse60 2147483647)) (.cse58 (+ c_~N~0 (* 6 .cse53) .cse20 (* 12 |c_ULTIMATE.start_main_~i~0#1|) 8))) (and (or (= (select .cse11 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse45 (- 34359738368))) .cse58) .cse59) (or (not .cse59) (= (select .cse11 .cse3) .cse58)))) .cse14))))))) is different from true [2023-02-15 19:03:46,895 WARN L233 SmtUtils]: Spent 9.05s on a formula simplification that was a NOOP. DAG size: 177 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:04:09,364 WARN L233 SmtUtils]: Spent 12.52s on a formula simplification. DAG size of input: 198 DAG size of output: 172 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:04:25,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 19:04:29,616 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse31 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse74 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse64 (mod .cse74 4294967296)) (.cse29 (* .cse31 8)) (.cse75 (+ |c_ULTIMATE.start_main_~i~0#1| 2))) (let ((.cse73 (mod .cse75 4294967296)) (.cse21 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse29)) (.cse11 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse29)) (.cse41 (* .cse64 8)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse22 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse45 (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4294967295) 4294967296) 8))) (let ((.cse33 (< .cse75 c_~N~0)) (.cse69 (select .cse22 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse45))) (.cse46 (select .cse13 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse45))) (.cse55 (< .cse74 c_~N~0)) (.cse20 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse41)) (.cse59 (select .cse13 .cse11)) (.cse27 (select .cse22 .cse21)) (.cse70 (* .cse73 8))) (let ((.cse39 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 16)) (.cse40 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse29)) (.cse14 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse70)) (.cse10 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse41)) (.cse1 (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) c_~N~0)) (.cse60 (store .cse22 .cse20 (+ .cse59 .cse27))) (.cse25 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (.cse8 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (.cse2 (< 3 c_~N~0)) (.cse32 (not .cse55)) (.cse0 (not (< 2 c_~N~0))) (.cse61 (store .cse22 .cse21 (+ .cse69 .cse46))) (.cse23 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 16)) (.cse24 (+ c_~N~0 8)) (.cse16 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse70)) (.cse65 (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (.cse30 (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (.cse3 (not .cse33))) (and (or .cse0 .cse1 .cse2 .cse3 (forall ((v_ArrVal_406 Int)) (= (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (let ((.cse9 (store .cse13 |c_ULTIMATE.start_main_~b~0#1.offset| 1))) (store .cse9 .cse10 (+ (select .cse9 .cse11) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))) .cse14 v_ArrVal_406)))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse7 (select (select (store .cse4 |c_ULTIMATE.start_main_~c~0#1.base| .cse5) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse5 .cse6 (+ c_~N~0 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse7)))) 8))) (or .cse0 .cse1 (= (select (let ((.cse19 (store .cse22 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse17 (select .cse19 .cse21)) (.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| .cse19) |c_ULTIMATE.start_main_~b~0#1.base|) .cse11))) (let ((.cse15 (store .cse19 .cse20 (+ .cse17 .cse18)))) (store .cse15 .cse16 (+ .cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| .cse15) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10) .cse18))))) .cse23) .cse24) .cse3) (or .cse25 (let ((.cse26 (<= .cse31 2147483647)) (.cse28 (+ c_~N~0 .cse30))) (and (or (not .cse26) (= .cse27 .cse28)) (or .cse26 (= (select .cse22 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse29 (- 34359738368))) .cse28))))) (or .cse32 .cse0 .cse33 .cse2 (forall ((v_ArrVal_400 Int) (v_ArrVal_406 Int)) (= (let ((.cse34 (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse40 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse41) v_ArrVal_400)))) (store .cse37 |c_ULTIMATE.start_main_~b~0#1.base| (store (let ((.cse38 (store (select .cse37 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) (store .cse38 .cse8 (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~b~0#1.base| .cse38) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) .cse39 v_ArrVal_406))))) (let ((.cse35 (store (select .cse34 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse36 (select (select (store .cse34 |c_ULTIMATE.start_main_~c~0#1.base| .cse35) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ (select (select (store .cse34 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse35 .cse6 (+ c_~N~0 .cse36))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse36)))) 8))) (or (forall ((v_ArrVal_406 Int)) (= (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse13 .cse11 (+ (select .cse40 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse45)) .cse46)) .cse10 v_ArrVal_406)))) (let ((.cse44 (store (select .cse43 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~c~0#1.base| .cse44) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ .cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse44 .cse6 (+ c_~N~0 .cse42))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))))) 8)) .cse32 .cse0 .cse33 .cse2) (or .cse32 .cse0 .cse33 (forall ((v_ArrVal_406 Int)) (= (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse13 .cse10 v_ArrVal_406)))) (let ((.cse48 (store (select .cse47 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse49 (select (select (store .cse47 |c_ULTIMATE.start_main_~c~0#1.base| .cse48) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ (select (select (store .cse47 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse48 .cse6 (+ c_~N~0 .cse49))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse49)))) 8)) .cse2) (or .cse25 (forall ((v_ArrVal_400 Int) (v_ArrVal_406 Int)) (= (let ((.cse50 (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse40 .cse12 v_ArrVal_400)))) (store .cse53 |c_ULTIMATE.start_main_~b~0#1.base| (store (let ((.cse54 (store (select .cse53 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) (store .cse54 .cse8 (+ (select (select (store .cse53 |c_ULTIMATE.start_main_~b~0#1.base| .cse54) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) .cse39 v_ArrVal_406))))) (let ((.cse51 (store (select .cse50 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse52 (select (select (store .cse50 |c_ULTIMATE.start_main_~c~0#1.base| .cse51) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ (select (select (store .cse50 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse51 .cse6 (+ c_~N~0 .cse52))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse52)))) 8)) .cse55 .cse0 .cse2) (or (forall ((v_ArrVal_406 Int)) (= (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse13 .cse10 (+ (select .cse40 .cse12) .cse59)) .cse14 v_ArrVal_406)))) (let ((.cse58 (store (select .cse57 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse56 (select (select (store .cse57 |c_ULTIMATE.start_main_~c~0#1.base| .cse58) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ .cse56 (select (select (store .cse57 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse58 .cse6 (+ c_~N~0 .cse56))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))))) 8)) .cse0 .cse1 .cse2 .cse3) (or (= (select (store .cse60 .cse16 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| .cse60) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10) .cse59 .cse27)) .cse23) .cse24) .cse0 .cse1 .cse3) (or .cse32 .cse0 .cse33 (= (select .cse60 .cse23) .cse24)) (or .cse25 .cse55 .cse0 (= (select .cse61 .cse23) .cse24)) (or .cse32 (let ((.cse62 (+ c_~N~0 (* 3 .cse65) .cse30 (* 3 |c_ULTIMATE.start_main_~i~0#1|) 1)) (.cse63 (<= .cse64 2147483647))) (and (or (= (select .cse22 .cse20) .cse62) (not .cse63)) (or (= (select .cse22 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse41 (- 34359738368))) .cse62) .cse63)))) (or .cse25 (forall ((v_ArrVal_406 Int)) (= (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse13 .cse11 v_ArrVal_406)))) (let ((.cse68 (store (select .cse67 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~c~0#1.base| .cse68) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ .cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse68 .cse6 (+ c_~N~0 .cse66))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))))) 8)) .cse55 .cse0 .cse2) (or .cse32 .cse0 .cse33 (= (select (store .cse61 .cse20 (+ .cse69 .cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| .cse61) |c_ULTIMATE.start_main_~b~0#1.base|) .cse11))) .cse23) .cse24)) (or (let ((.cse72 (<= .cse73 2147483647)) (.cse71 (+ c_~N~0 (* 6 .cse65) .cse30 (* 12 |c_ULTIMATE.start_main_~i~0#1|) 8))) (and (or (= (select .cse22 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse70 (- 34359738368))) .cse71) .cse72) (or (not .cse72) (= (select .cse22 .cse16) .cse71)))) .cse3))))))) is different from true [2023-02-15 19:04:53,124 WARN L233 SmtUtils]: Spent 10.09s on a formula simplification. DAG size of input: 250 DAG size of output: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:05:00,885 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse33 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse71 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse63 (mod .cse71 4294967296)) (.cse31 (* .cse33 8)) (.cse72 (+ |c_ULTIMATE.start_main_~i~0#1| 2))) (let ((.cse69 (mod .cse72 4294967296)) (.cse22 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse31)) (.cse11 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse31)) (.cse43 (* .cse63 8)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse47 (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4294967295) 4294967296) 8)) (.cse30 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse19 (store .cse30 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)) (.cse35 (< .cse72 c_~N~0)) (.cse65 (select .cse30 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse47))) (.cse48 (select .cse13 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse47))) (.cse54 (< .cse71 c_~N~0)) (.cse20 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse43)) (.cse58 (select .cse13 .cse11)) (.cse28 (select .cse30 .cse22)) (.cse66 (* .cse69 8))) (let ((.cse41 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 16)) (.cse42 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse31)) (.cse14 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse66)) (.cse10 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse43)) (.cse1 (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) c_~N~0)) (.cse59 (store .cse30 .cse20 (+ .cse58 .cse28))) (.cse26 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse34 (not .cse54)) (.cse60 (store .cse30 .cse22 (+ .cse65 .cse48))) (.cse23 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 16)) (.cse24 (+ c_~N~0 8)) (.cse16 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse66)) (.cse64 (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (.cse32 (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (.cse3 (not .cse35)) (.cse0 (not (< 2 c_~N~0))) (.cse2 (< 3 c_~N~0)) (.cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (.cse8 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| .cse19) |c_ULTIMATE.start_main_~b~0#1.base|))) (and (or .cse0 .cse1 .cse2 .cse3 (forall ((v_ArrVal_406 Int)) (= (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (let ((.cse9 (store .cse13 |c_ULTIMATE.start_main_~b~0#1.offset| 1))) (store .cse9 .cse10 (+ (select .cse9 .cse11) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))) .cse14 v_ArrVal_406)))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse7 (select (select (store .cse4 |c_ULTIMATE.start_main_~c~0#1.base| .cse5) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse5 .cse6 (+ c_~N~0 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse7)))) 8))) (or .cse0 .cse1 (= (select (let ((.cse17 (select .cse19 .cse22)) (.cse18 (select .cse21 .cse11))) (let ((.cse15 (store .cse19 .cse20 (+ .cse17 .cse18)))) (store .cse15 .cse16 (+ .cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| .cse15) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10) .cse18)))) .cse23) .cse24) .cse3) (or (let ((.cse25 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) (and (or (not (= .cse8 |c_ULTIMATE.start_main_~c~0#1.offset|)) .cse25) (or (not (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|))) (or .cse25 (not (= |c_ULTIMATE.start_main_~b~0#1.offset| |c_ULTIMATE.start_main_~c~0#1.offset|))))) .cse0 .cse2) (or .cse26 (let ((.cse27 (<= .cse33 2147483647)) (.cse29 (+ c_~N~0 .cse32))) (and (or (not .cse27) (= .cse28 .cse29)) (or .cse27 (= (select .cse30 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse31 (- 34359738368))) .cse29))))) (or .cse34 .cse0 .cse35 .cse2 (forall ((v_ArrVal_400 Int) (v_ArrVal_406 Int)) (= (let ((.cse36 (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse42 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse43) v_ArrVal_400)))) (store .cse39 |c_ULTIMATE.start_main_~b~0#1.base| (store (let ((.cse40 (store (select .cse39 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) (store .cse40 .cse8 (+ (select (select (store .cse39 |c_ULTIMATE.start_main_~b~0#1.base| .cse40) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) .cse41 v_ArrVal_406))))) (let ((.cse37 (store (select .cse36 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse38 (select (select (store .cse36 |c_ULTIMATE.start_main_~c~0#1.base| .cse37) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ (select (select (store .cse36 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse37 .cse6 (+ c_~N~0 .cse38))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse38)))) 8))) (or (forall ((v_ArrVal_406 Int)) (= (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse13 .cse11 (+ (select .cse42 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse47)) .cse48)) .cse10 v_ArrVal_406)))) (let ((.cse46 (store (select .cse45 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse44 (select (select (store .cse45 |c_ULTIMATE.start_main_~c~0#1.base| .cse46) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ .cse44 (select (select (store .cse45 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse46 .cse6 (+ c_~N~0 .cse44))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))))) 8)) .cse34 .cse0 .cse35 .cse2) (or .cse26 (forall ((v_ArrVal_400 Int) (v_ArrVal_406 Int)) (= (let ((.cse49 (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse42 .cse12 v_ArrVal_400)))) (store .cse52 |c_ULTIMATE.start_main_~b~0#1.base| (store (let ((.cse53 (store (select .cse52 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1))) (store .cse53 .cse8 (+ (select (select (store .cse52 |c_ULTIMATE.start_main_~b~0#1.base| .cse53) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) .cse41 v_ArrVal_406))))) (let ((.cse50 (store (select .cse49 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse51 (select (select (store .cse49 |c_ULTIMATE.start_main_~c~0#1.base| .cse50) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ (select (select (store .cse49 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse50 .cse6 (+ c_~N~0 .cse51))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse51)))) 8)) .cse54 .cse0 .cse2) (or (forall ((v_ArrVal_406 Int)) (= (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse13 .cse10 (+ (select .cse42 .cse12) .cse58)) .cse14 v_ArrVal_406)))) (let ((.cse57 (store (select .cse56 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (let ((.cse55 (select (select (store .cse56 |c_ULTIMATE.start_main_~c~0#1.base| .cse57) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ .cse55 (select (select (store .cse56 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse57 .cse6 (+ c_~N~0 .cse55))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))))) 8)) .cse0 .cse1 .cse2 .cse3) (or (= (select (store .cse59 .cse16 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| .cse59) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10) .cse58 .cse28)) .cse23) .cse24) .cse0 .cse1 .cse3) (or .cse34 .cse0 .cse35 (= (select .cse59 .cse23) .cse24)) (or .cse26 .cse54 .cse0 (= (select .cse60 .cse23) .cse24)) (or .cse34 (let ((.cse61 (+ c_~N~0 (* 3 .cse64) .cse32 (* 3 |c_ULTIMATE.start_main_~i~0#1|) 1)) (.cse62 (<= .cse63 2147483647))) (and (or (= (select .cse30 .cse20) .cse61) (not .cse62)) (or (= (select .cse30 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse43 (- 34359738368))) .cse61) .cse62)))) (or .cse34 .cse0 .cse35 (= (select (store .cse60 .cse20 (+ .cse65 .cse48 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| .cse60) |c_ULTIMATE.start_main_~b~0#1.base|) .cse11))) .cse23) .cse24)) (or (let ((.cse68 (<= .cse69 2147483647)) (.cse67 (+ c_~N~0 (* 6 .cse64) .cse32 (* 12 |c_ULTIMATE.start_main_~i~0#1|) 8))) (and (or (= (select .cse30 (+ |c_ULTIMATE.start_main_~c~0#1.offset| .cse66 (- 34359738368))) .cse67) .cse68) (or (not .cse68) (= (select .cse30 .cse16) .cse67)))) .cse3) (or .cse0 .cse2 (= (let ((.cse70 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.offset|))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store .cse19 .cse6 (+ c_~N~0 .cse70))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8) .cse70)) 8)))))))) is different from true