./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array22_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array22_pattern.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 31d323b6985f030ac0fb5fda45d0cb8af14c3bb3898c8ff09cf5a292e40f357b --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 22:59:56,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 22:59:56,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 22:59:56,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 22:59:56,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 22:59:56,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 22:59:56,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 22:59:56,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 22:59:56,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 22:59:56,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 22:59:56,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 22:59:56,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 22:59:56,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 22:59:56,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 22:59:56,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 22:59:56,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 22:59:56,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 22:59:56,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 22:59:56,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 22:59:56,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 22:59:56,318 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 22:59:56,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 22:59:56,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 22:59:56,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 22:59:56,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 22:59:56,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 22:59:56,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 22:59:56,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 22:59:56,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 22:59:56,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 22:59:56,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 22:59:56,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 22:59:56,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 22:59:56,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 22:59:56,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 22:59:56,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 22:59:56,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 22:59:56,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 22:59:56,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 22:59:56,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 22:59:56,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 22:59:56,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 22:59:56,337 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 22:59:56,360 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 22:59:56,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 22:59:56,360 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 22:59:56,361 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 22:59:56,361 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 22:59:56,361 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 22:59:56,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 22:59:56,362 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 22:59:56,362 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 22:59:56,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 22:59:56,363 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 22:59:56,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 22:59:56,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 22:59:56,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 22:59:56,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 22:59:56,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 22:59:56,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 22:59:56,364 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 22:59:56,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 22:59:56,364 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 22:59:56,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 22:59:56,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 22:59:56,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 22:59:56,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 22:59:56,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 22:59:56,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 22:59:56,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 22:59:56,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 22:59:56,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 22:59:56,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 22:59:56,366 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 22:59:56,366 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 22:59:56,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 22:59:56,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31d323b6985f030ac0fb5fda45d0cb8af14c3bb3898c8ff09cf5a292e40f357b [2022-07-11 22:59:56,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 22:59:56,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 22:59:56,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 22:59:56,585 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 22:59:56,585 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 22:59:56,586 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array22_pattern.c [2022-07-11 22:59:56,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/496a5c702/30f53c4afdf749b3b85b3d7dc7448d21/FLAG8289aaa57 [2022-07-11 22:59:56,995 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 22:59:56,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array22_pattern.c [2022-07-11 22:59:56,999 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/496a5c702/30f53c4afdf749b3b85b3d7dc7448d21/FLAG8289aaa57 [2022-07-11 22:59:57,418 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/496a5c702/30f53c4afdf749b3b85b3d7dc7448d21 [2022-07-11 22:59:57,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 22:59:57,421 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 22:59:57,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 22:59:57,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 22:59:57,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 22:59:57,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 10:59:57" (1/1) ... [2022-07-11 22:59:57,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b542ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:59:57, skipping insertion in model container [2022-07-11 22:59:57,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 10:59:57" (1/1) ... [2022-07-11 22:59:57,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 22:59:57,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 22:59:57,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array22_pattern.c[1347,1360] [2022-07-11 22:59:57,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 22:59:57,573 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 22:59:57,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array22_pattern.c[1347,1360] [2022-07-11 22:59:57,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 22:59:57,596 INFO L208 MainTranslator]: Completed translation [2022-07-11 22:59:57,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:59:57 WrapperNode [2022-07-11 22:59:57,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 22:59:57,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 22:59:57,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 22:59:57,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 22:59:57,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:59:57" (1/1) ... [2022-07-11 22:59:57,606 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:59:57" (1/1) ... [2022-07-11 22:59:57,619 INFO L137 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2022-07-11 22:59:57,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 22:59:57,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 22:59:57,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 22:59:57,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 22:59:57,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:59:57" (1/1) ... [2022-07-11 22:59:57,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:59:57" (1/1) ... [2022-07-11 22:59:57,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:59:57" (1/1) ... [2022-07-11 22:59:57,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:59:57" (1/1) ... [2022-07-11 22:59:57,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:59:57" (1/1) ... [2022-07-11 22:59:57,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:59:57" (1/1) ... [2022-07-11 22:59:57,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:59:57" (1/1) ... [2022-07-11 22:59:57,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 22:59:57,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 22:59:57,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 22:59:57,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 22:59:57,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:59:57" (1/1) ... [2022-07-11 22:59:57,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 22:59:57,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:59:57,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 22:59:57,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 22:59:57,689 INFO L130 BoogieDeclarations]: Found specification of procedure outerBoundaryPatternCheck [2022-07-11 22:59:57,690 INFO L138 BoogieDeclarations]: Found implementation of procedure outerBoundaryPatternCheck [2022-07-11 22:59:57,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 22:59:57,690 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-11 22:59:57,690 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-11 22:59:57,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 22:59:57,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 22:59:57,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 22:59:57,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 22:59:57,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 22:59:57,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 22:59:57,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 22:59:57,741 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 22:59:57,742 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 22:59:57,874 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 22:59:57,878 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 22:59:57,879 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-11 22:59:57,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:59:57 BoogieIcfgContainer [2022-07-11 22:59:57,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 22:59:57,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 22:59:57,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 22:59:57,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 22:59:57,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 10:59:57" (1/3) ... [2022-07-11 22:59:57,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ca1092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 10:59:57, skipping insertion in model container [2022-07-11 22:59:57,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:59:57" (2/3) ... [2022-07-11 22:59:57,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ca1092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 10:59:57, skipping insertion in model container [2022-07-11 22:59:57,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:59:57" (3/3) ... [2022-07-11 22:59:57,897 INFO L111 eAbstractionObserver]: Analyzing ICFG array22_pattern.c [2022-07-11 22:59:57,907 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 22:59:57,916 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 22:59:57,948 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 22:59:57,953 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1a0fee04, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1caa5e23 [2022-07-11 22:59:57,953 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 22:59:57,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-11 22:59:57,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-11 22:59:57,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:59:57,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:59:57,964 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:59:57,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:59:57,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1798908762, now seen corresponding path program 1 times [2022-07-11 22:59:57,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:59:57,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546382963] [2022-07-11 22:59:57,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:59:57,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:59:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:59:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 22:59:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:59:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:59:58,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:59:58,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546382963] [2022-07-11 22:59:58,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546382963] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:59:58,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:59:58,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 22:59:58,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877419401] [2022-07-11 22:59:58,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:59:58,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 22:59:58,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:59:58,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 22:59:58,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 22:59:58,113 INFO L87 Difference]: Start difference. First operand has 41 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 22:59:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:59:58,126 INFO L93 Difference]: Finished difference Result 79 states and 117 transitions. [2022-07-11 22:59:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 22:59:58,128 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-11 22:59:58,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:59:58,132 INFO L225 Difference]: With dead ends: 79 [2022-07-11 22:59:58,132 INFO L226 Difference]: Without dead ends: 37 [2022-07-11 22:59:58,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 22:59:58,149 INFO L413 NwaCegarLoop]: 51 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, 51 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:59:58,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:59:58,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-11 22:59:58,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-07-11 22:59:58,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-11 22:59:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-07-11 22:59:58,177 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 15 [2022-07-11 22:59:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:59:58,177 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-07-11 22:59:58,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 22:59:58,178 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-07-11 22:59:58,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-11 22:59:58,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:59:58,181 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1] [2022-07-11 22:59:58,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 22:59:58,182 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:59:58,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:59:58,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1909329698, now seen corresponding path program 1 times [2022-07-11 22:59:58,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:59:58,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637183694] [2022-07-11 22:59:58,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:59:58,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:59:58,212 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 22:59:58,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [699250443] [2022-07-11 22:59:58,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:59:58,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:59:58,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:59:58,214 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:59:58,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 22:59:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:59:58,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 22:59:58,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:59:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 22:59:58,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 22:59:58,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:59:58,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637183694] [2022-07-11 22:59:58,362 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 22:59:58,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699250443] [2022-07-11 22:59:58,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699250443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:59:58,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:59:58,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 22:59:58,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330079465] [2022-07-11 22:59:58,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:59:58,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 22:59:58,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:59:58,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 22:59:58,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 22:59:58,364 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 22:59:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:59:58,382 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-07-11 22:59:58,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 22:59:58,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-07-11 22:59:58,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:59:58,384 INFO L225 Difference]: With dead ends: 44 [2022-07-11 22:59:58,384 INFO L226 Difference]: Without dead ends: 40 [2022-07-11 22:59:58,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:59:58,385 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:59:58,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:59:58,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-11 22:59:58,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-07-11 22:59:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-11 22:59:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-07-11 22:59:58,391 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 42 [2022-07-11 22:59:58,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:59:58,392 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-07-11 22:59:58,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 22:59:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-07-11 22:59:58,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-11 22:59:58,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:59:58,393 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:59:58,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-11 22:59:58,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:59:58,608 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:59:58,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:59:58,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1786751912, now seen corresponding path program 1 times [2022-07-11 22:59:58,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:59:58,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187488548] [2022-07-11 22:59:58,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:59:58,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:59:58,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 22:59:58,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1775917452] [2022-07-11 22:59:58,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:59:58,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:59:58,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:59:58,630 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:59:58,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 22:59:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:59:58,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-11 22:59:58,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:59:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 22:59:58,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 22:59:58,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:59:58,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187488548] [2022-07-11 22:59:58,795 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 22:59:58,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775917452] [2022-07-11 22:59:58,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775917452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:59:58,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:59:58,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 22:59:58,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945558508] [2022-07-11 22:59:58,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:59:58,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 22:59:58,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:59:58,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 22:59:58,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:59:58,801 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 22:59:58,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:59:58,891 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2022-07-11 22:59:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 22:59:58,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2022-07-11 22:59:58,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:59:58,893 INFO L225 Difference]: With dead ends: 83 [2022-07-11 22:59:58,893 INFO L226 Difference]: Without dead ends: 50 [2022-07-11 22:59:58,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-11 22:59:58,895 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 25 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 22:59:58,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 128 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 22:59:58,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-11 22:59:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-07-11 22:59:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-11 22:59:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-07-11 22:59:58,902 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 47 [2022-07-11 22:59:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:59:58,902 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-07-11 22:59:58,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 22:59:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-07-11 22:59:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-11 22:59:58,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:59:58,903 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:59:58,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-11 22:59:59,106 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,SelfDestructingSolverStorable2 [2022-07-11 22:59:59,106 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:59:59,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:59:59,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2075657686, now seen corresponding path program 1 times [2022-07-11 22:59:59,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:59:59,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397079410] [2022-07-11 22:59:59,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:59:59,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:59:59,125 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 22:59:59,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410257479] [2022-07-11 22:59:59,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:59:59,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:59:59,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:59:59,130 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:59:59,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-11 22:59:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:59:59,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-11 22:59:59,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:59:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-11 22:59:59,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 22:59:59,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:59:59,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397079410] [2022-07-11 22:59:59,192 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 22:59:59,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410257479] [2022-07-11 22:59:59,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410257479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:59:59,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:59:59,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 22:59:59,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110423496] [2022-07-11 22:59:59,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:59:59,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 22:59:59,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:59:59,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 22:59:59,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 22:59:59,194 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 22:59:59,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:59:59,228 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2022-07-11 22:59:59,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 22:59:59,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-07-11 22:59:59,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:59:59,230 INFO L225 Difference]: With dead ends: 80 [2022-07-11 22:59:59,230 INFO L226 Difference]: Without dead ends: 44 [2022-07-11 22:59:59,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:59:59,231 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:59:59,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 77 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:59:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-11 22:59:59,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2022-07-11 22:59:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-11 22:59:59,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-07-11 22:59:59,235 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 50 [2022-07-11 22:59:59,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:59:59,236 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-07-11 22:59:59,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 22:59:59,236 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-07-11 22:59:59,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-11 22:59:59,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:59:59,237 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:59:59,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 22:59:59,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:59:59,454 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:59:59,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:59:59,454 INFO L85 PathProgramCache]: Analyzing trace with hash 874891816, now seen corresponding path program 1 times [2022-07-11 22:59:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:59:59,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002083606] [2022-07-11 22:59:59,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:59:59,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:59:59,463 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 22:59:59,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2493129] [2022-07-11 22:59:59,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:59:59,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:59:59,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:59:59,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:59:59,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-11 22:59:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:59:59,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-11 22:59:59,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:59:59,579 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-11 22:59:59,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:59:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 22:59:59,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:59:59,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002083606] [2022-07-11 22:59:59,813 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 22:59:59,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2493129] [2022-07-11 22:59:59,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2493129] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:59:59,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 22:59:59,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 19 [2022-07-11 22:59:59,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916205026] [2022-07-11 22:59:59,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 22:59:59,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-11 22:59:59,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:59:59,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-11 22:59:59,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-07-11 22:59:59,815 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 17 states have internal predecessors, (59), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-11 23:00:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:00:00,091 INFO L93 Difference]: Finished difference Result 105 states and 132 transitions. [2022-07-11 23:00:00,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-11 23:00:00,091 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 17 states have internal predecessors, (59), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 52 [2022-07-11 23:00:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:00:00,093 INFO L225 Difference]: With dead ends: 105 [2022-07-11 23:00:00,093 INFO L226 Difference]: Without dead ends: 69 [2022-07-11 23:00:00,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2022-07-11 23:00:00,094 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 193 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:00:00,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 147 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:00:00,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-11 23:00:00,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2022-07-11 23:00:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-11 23:00:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-07-11 23:00:00,100 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 52 [2022-07-11 23:00:00,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:00:00,101 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-07-11 23:00:00,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 17 states have internal predecessors, (59), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-11 23:00:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-07-11 23:00:00,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-11 23:00:00,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:00:00,102 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:00:00,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:00:00,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:00:00,315 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:00:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:00:00,316 INFO L85 PathProgramCache]: Analyzing trace with hash -511912674, now seen corresponding path program 2 times [2022-07-11 23:00:00,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:00:00,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157929231] [2022-07-11 23:00:00,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:00:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:00:00,330 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:00:00,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [542490917] [2022-07-11 23:00:00,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:00:00,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:00:00,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:00:00,336 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:00:00,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-11 23:00:01,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:00:01,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:00:01,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-11 23:00:01,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:00:01,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 56 [2022-07-11 23:00:01,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-07-11 23:00:01,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-07-11 23:00:01,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 75 [2022-07-11 23:00:01,535 INFO L356 Elim1Store]: treesize reduction 180, result has 9.5 percent of original size [2022-07-11 23:00:01,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 74 treesize of output 142 [2022-07-11 23:00:01,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 treesize of output 89 [2022-07-11 23:00:01,796 INFO L356 Elim1Store]: treesize reduction 354, result has 8.8 percent of original size [2022-07-11 23:00:01,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 159 [2022-07-11 23:00:01,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 99 treesize of output 88 [2022-07-11 23:00:02,003 INFO L356 Elim1Store]: treesize reduction 279, result has 7.9 percent of original size [2022-07-11 23:00:02,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 214 treesize of output 266 [2022-07-11 23:00:02,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:00:02,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 [2022-07-11 23:00:09,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 108 treesize of output 95 [2022-07-11 23:00:09,501 INFO L356 Elim1Store]: treesize reduction 506, result has 11.8 percent of original size [2022-07-11 23:00:09,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 94 treesize of output 203 [2022-07-11 23:00:16,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 547 treesize of output 520 [2022-07-11 23:00:19,336 INFO L356 Elim1Store]: treesize reduction 1709, result has 3.0 percent of original size [2022-07-11 23:00:19,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 30 case distinctions, treesize of input 1067 treesize of output 1599 [2022-07-11 23:00:25,595 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~ARR_SIZE~0 2) (< 1 c_~ARR_SIZE~0) (or (and (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int)) (let ((.cse16 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse15 (div 0 .cse16))) (let ((.cse2 (* (- 1) .cse15 .cse16)) (.cse3 (* .cse16 4))) (let ((.cse1 (* .cse15 .cse3)) (.cse14 (* (mod (+ (* 4294967295 .cse2) c_~ARR_SIZE~0 4294967295) 4294967296) 4))) (let ((.cse13 (* .cse15 (+ (- 17179869184) .cse3))) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse10 (+ .cse1 .cse14 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse5 (store .cse9 .cse10 v_DerPreprocessor_13)) (.cse6 (+ (- 17179869184) .cse13 .cse14 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse0 (store .cse5 .cse6 (- 1))) (.cse8 (store .cse9 .cse10 v_DerPreprocessor_11)) (.cse7 (+ (- 17179869184) .cse1 .cse14 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (and (= (select .cse0 (+ .cse1 (* 4 .cse2) |c_ULTIMATE.start_main_~#array~0#1.offset|)) 1) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3 4)) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3)) 0) (let ((.cse4 (store .cse8 .cse7 (- 1)))) (= .cse4 (store (store .cse5 .cse6 (select .cse4 .cse6)) .cse7 (- 1)))) (let ((.cse12 (+ .cse13 .cse14 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse11 (store (store .cse8 .cse7 v_DerPreprocessor_9) .cse12 (- 1)))) (= (store (store .cse9 .cse10 (select .cse11 .cse10)) .cse12 (- 1)) .cse11)))))))))))) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) (let ((.cse18 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse17 (div 0 .cse18))) (+ (* .cse17 (* .cse18 4)) (* (mod (+ (* 4294967295 (* (- 1) .cse17 .cse18)) c_~ARR_SIZE~0 4294967295) 4294967296) 4) |c_ULTIMATE.start_main_~#array~0#1.offset|)))) 1) 0)) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse19 (mod c_~ARR_SIZE~0 4294967296))) (and (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~index1~0#1| (* .cse19 4)) (* 4 (mod (+ c_~ARR_SIZE~0 4294967294 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse19) 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset|)) 1) 0) (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int)) (let ((.cse35 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse26 (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse35)) (.cse21 (* .cse35 4))) (let ((.cse27 (* |ULTIMATE.start_main_~index1~0#1| .cse21)) (.cse34 (* 4 (mod (+ c_~ARR_SIZE~0 4294967294 (* .cse26 4294967295)) 4294967296)))) (let ((.cse33 (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) .cse21))) (.cse29 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse30 (+ .cse27 .cse34 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse32 (store .cse29 .cse30 v_DerPreprocessor_11)) (.cse25 (+ (- 17179869184) .cse27 .cse34 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (.cse23 (store .cse29 .cse30 v_DerPreprocessor_13)) (.cse24 (+ (- 17179869184) .cse33 .cse34 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse20 (store .cse23 .cse24 (- 1))) (.cse22 (store .cse32 .cse25 (- 1)))) (and (= (select .cse20 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse21)) 0) (= .cse22 (store (store .cse23 .cse24 (select .cse22 .cse24)) .cse25 (- 1))) (= (select .cse20 (+ (* .cse26 4) .cse27 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) 1) (let ((.cse31 (+ .cse33 .cse34 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse28 (store (store .cse32 .cse25 v_DerPreprocessor_9) .cse31 (- 1)))) (= .cse28 (store (store .cse29 .cse30 (select .cse28 .cse30)) .cse31 (- 1))))) (= (select .cse20 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse21 4)) 0) (= (select .cse22 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0))))))))) (= (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse19)) (+ 2 (* |ULTIMATE.start_main_~index1~0#1| 4294967296)))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (and (not (= (* 17179869184 |ULTIMATE.start_main_~index1~0#1|) 0)) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int)) (let ((.cse38 (* (mod c_~ARR_SIZE~0 4294967296) 4))) (let ((.cse44 (* (mod 0 4294967296) 4)) (.cse37 (* |ULTIMATE.start_main_~index1~0#1| .cse38))) (let ((.cse45 (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) .cse38))) (.cse46 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse47 (+ .cse44 .cse37 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse43 (store .cse46 .cse47 v_DerPreprocessor_11)) (.cse42 (+ (- 17179869184) .cse44 .cse37 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (.cse40 (store .cse46 .cse47 v_DerPreprocessor_13)) (.cse41 (+ (- 17179869184) .cse44 .cse45 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse36 (store .cse40 .cse41 (- 1))) (.cse39 (store .cse43 .cse42 (- 1)))) (and (= (select .cse36 (+ (- 4) .cse37 |c_ULTIMATE.start_main_~#array~0#1.offset| (* c_~ARR_SIZE~0 4))) 1) (= (select .cse36 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse38)) 0) (= (select .cse39 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (= (select .cse36 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= .cse39 (store (store .cse40 .cse41 (select .cse39 .cse41)) .cse42 (- 1))) (= (select (store (store .cse43 .cse42 v_DerPreprocessor_9) (+ .cse44 .cse45 |c_ULTIMATE.start_main_~#array~0#1.offset|) (- 1)) .cse42) v_DerPreprocessor_9)))))))) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod 0 4294967296) 4) (* |ULTIMATE.start_main_~index1~0#1| (* (mod c_~ARR_SIZE~0 4294967296) 4)) |c_ULTIMATE.start_main_~#array~0#1.offset|)) 1) 0))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (and (not (= (* 17179869184 |ULTIMATE.start_main_~index1~0#1|) 0)) (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int)) (let ((.cse61 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse53 (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse61)) (.cse55 (* .cse61 4))) (let ((.cse54 (* |ULTIMATE.start_main_~index1~0#1| .cse55)) (.cse51 (* (mod (+ c_~ARR_SIZE~0 (* .cse61 4294967295) 4294967295 (* .cse53 4294967295)) 4294967296) 4))) (let ((.cse50 (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) .cse55))) (.cse59 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse60 (+ .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse51))) (let ((.cse57 (store .cse59 .cse60 v_DerPreprocessor_13)) (.cse58 (+ (- 17179869184) .cse50 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse51)) (.cse48 (store .cse59 .cse60 v_DerPreprocessor_11)) (.cse49 (+ (- 17179869184) .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse51))) (let ((.cse56 (store .cse48 .cse49 (- 1))) (.cse52 (store .cse57 .cse58 (- 1)))) (and (= (select (store (store .cse48 .cse49 v_DerPreprocessor_9) (+ .cse50 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse51) (- 1)) .cse49) v_DerPreprocessor_9) (= 1 (select .cse52 (+ (* .cse53 4) .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse55))) (= (select .cse56 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (= (select .cse52 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse55 4)) 0) (= (store (store .cse57 .cse58 (select .cse56 .cse58)) .cse49 (- 1)) .cse56) (= (select .cse52 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0))))))))) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) (let ((.cse62 (mod c_~ARR_SIZE~0 4294967296))) (+ (* |ULTIMATE.start_main_~index1~0#1| (* .cse62 4)) |c_ULTIMATE.start_main_~#array~0#1.offset| (* (mod (+ c_~ARR_SIZE~0 (* .cse62 4294967295) 4294967295 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse62) 4294967295)) 4294967296) 4)))) 1) 0)))) (= |c_ULTIMATE.start_main_~sum~0#1| 0)) is different from false [2022-07-11 23:01:06,881 WARN L233 SmtUtils]: Spent 14.48s on a formula simplification that was a NOOP. DAG size: 199 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:01:09,574 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~ARR_SIZE~0 2) (= |c_ULTIMATE.start_main_~row~0#1| 0) (< 1 c_~ARR_SIZE~0) (or (and (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int)) (let ((.cse16 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse15 (div 0 .cse16))) (let ((.cse2 (* (- 1) .cse15 .cse16)) (.cse3 (* .cse16 4))) (let ((.cse1 (* .cse15 .cse3)) (.cse14 (* (mod (+ (* 4294967295 .cse2) c_~ARR_SIZE~0 4294967295) 4294967296) 4))) (let ((.cse13 (* .cse15 (+ (- 17179869184) .cse3))) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse10 (+ .cse1 .cse14 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse5 (store .cse9 .cse10 v_DerPreprocessor_13)) (.cse6 (+ (- 17179869184) .cse13 .cse14 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse0 (store .cse5 .cse6 (- 1))) (.cse8 (store .cse9 .cse10 v_DerPreprocessor_11)) (.cse7 (+ (- 17179869184) .cse1 .cse14 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (and (= (select .cse0 (+ .cse1 (* 4 .cse2) |c_ULTIMATE.start_main_~#array~0#1.offset|)) 1) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3 4)) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse3)) 0) (let ((.cse4 (store .cse8 .cse7 (- 1)))) (= .cse4 (store (store .cse5 .cse6 (select .cse4 .cse6)) .cse7 (- 1)))) (let ((.cse12 (+ .cse13 .cse14 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse11 (store (store .cse8 .cse7 v_DerPreprocessor_9) .cse12 (- 1)))) (= (store (store .cse9 .cse10 (select .cse11 .cse10)) .cse12 (- 1)) .cse11)))))))))))) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) (let ((.cse18 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse17 (div 0 .cse18))) (+ (* .cse17 (* .cse18 4)) (* (mod (+ (* 4294967295 (* (- 1) .cse17 .cse18)) c_~ARR_SIZE~0 4294967295) 4294967296) 4) |c_ULTIMATE.start_main_~#array~0#1.offset|)))) 1) 0)) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse19 (mod c_~ARR_SIZE~0 4294967296))) (and (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~index1~0#1| (* .cse19 4)) (* 4 (mod (+ c_~ARR_SIZE~0 4294967294 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse19) 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset|)) 1) 0) (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int)) (let ((.cse35 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse26 (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse35)) (.cse21 (* .cse35 4))) (let ((.cse27 (* |ULTIMATE.start_main_~index1~0#1| .cse21)) (.cse34 (* 4 (mod (+ c_~ARR_SIZE~0 4294967294 (* .cse26 4294967295)) 4294967296)))) (let ((.cse33 (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) .cse21))) (.cse29 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse30 (+ .cse27 .cse34 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse32 (store .cse29 .cse30 v_DerPreprocessor_11)) (.cse25 (+ (- 17179869184) .cse27 .cse34 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (.cse23 (store .cse29 .cse30 v_DerPreprocessor_13)) (.cse24 (+ (- 17179869184) .cse33 .cse34 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse20 (store .cse23 .cse24 (- 1))) (.cse22 (store .cse32 .cse25 (- 1)))) (and (= (select .cse20 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse21)) 0) (= .cse22 (store (store .cse23 .cse24 (select .cse22 .cse24)) .cse25 (- 1))) (= (select .cse20 (+ (* .cse26 4) .cse27 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) 1) (let ((.cse31 (+ .cse33 .cse34 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse28 (store (store .cse32 .cse25 v_DerPreprocessor_9) .cse31 (- 1)))) (= .cse28 (store (store .cse29 .cse30 (select .cse28 .cse30)) .cse31 (- 1))))) (= (select .cse20 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse21 4)) 0) (= (select .cse22 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0))))))))) (= (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse19)) (+ 2 (* |ULTIMATE.start_main_~index1~0#1| 4294967296)))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (and (not (= (* 17179869184 |ULTIMATE.start_main_~index1~0#1|) 0)) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int)) (let ((.cse38 (* (mod c_~ARR_SIZE~0 4294967296) 4))) (let ((.cse44 (* (mod 0 4294967296) 4)) (.cse37 (* |ULTIMATE.start_main_~index1~0#1| .cse38))) (let ((.cse45 (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) .cse38))) (.cse46 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse47 (+ .cse44 .cse37 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse43 (store .cse46 .cse47 v_DerPreprocessor_11)) (.cse42 (+ (- 17179869184) .cse44 .cse37 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (.cse40 (store .cse46 .cse47 v_DerPreprocessor_13)) (.cse41 (+ (- 17179869184) .cse44 .cse45 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse36 (store .cse40 .cse41 (- 1))) (.cse39 (store .cse43 .cse42 (- 1)))) (and (= (select .cse36 (+ (- 4) .cse37 |c_ULTIMATE.start_main_~#array~0#1.offset| (* c_~ARR_SIZE~0 4))) 1) (= (select .cse36 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse38)) 0) (= (select .cse39 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (= (select .cse36 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= .cse39 (store (store .cse40 .cse41 (select .cse39 .cse41)) .cse42 (- 1))) (= (select (store (store .cse43 .cse42 v_DerPreprocessor_9) (+ .cse44 .cse45 |c_ULTIMATE.start_main_~#array~0#1.offset|) (- 1)) .cse42) v_DerPreprocessor_9)))))))) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod 0 4294967296) 4) (* |ULTIMATE.start_main_~index1~0#1| (* (mod c_~ARR_SIZE~0 4294967296) 4)) |c_ULTIMATE.start_main_~#array~0#1.offset|)) 1) 0))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (and (not (= (* 17179869184 |ULTIMATE.start_main_~index1~0#1|) 0)) (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int)) (let ((.cse61 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse53 (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse61)) (.cse55 (* .cse61 4))) (let ((.cse54 (* |ULTIMATE.start_main_~index1~0#1| .cse55)) (.cse51 (* (mod (+ c_~ARR_SIZE~0 (* .cse61 4294967295) 4294967295 (* .cse53 4294967295)) 4294967296) 4))) (let ((.cse50 (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) .cse55))) (.cse59 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse60 (+ .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse51))) (let ((.cse57 (store .cse59 .cse60 v_DerPreprocessor_13)) (.cse58 (+ (- 17179869184) .cse50 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse51)) (.cse48 (store .cse59 .cse60 v_DerPreprocessor_11)) (.cse49 (+ (- 17179869184) .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse51))) (let ((.cse56 (store .cse48 .cse49 (- 1))) (.cse52 (store .cse57 .cse58 (- 1)))) (and (= (select (store (store .cse48 .cse49 v_DerPreprocessor_9) (+ .cse50 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse51) (- 1)) .cse49) v_DerPreprocessor_9) (= 1 (select .cse52 (+ (* .cse53 4) .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse55))) (= (select .cse56 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (= (select .cse52 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse55 4)) 0) (= (store (store .cse57 .cse58 (select .cse56 .cse58)) .cse49 (- 1)) .cse56) (= (select .cse52 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0))))))))) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) (let ((.cse62 (mod c_~ARR_SIZE~0 4294967296))) (+ (* |ULTIMATE.start_main_~index1~0#1| (* .cse62 4)) |c_ULTIMATE.start_main_~#array~0#1.offset| (* (mod (+ c_~ARR_SIZE~0 (* .cse62 4294967295) 4294967295 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse62) 4294967295)) 4294967296) 4)))) 1) 0)))) (= |c_ULTIMATE.start_main_~sum~0#1| 0) (= |c_ULTIMATE.start_main_~column~0#1| 0)) is different from false [2022-07-11 23:01:54,082 WARN L233 SmtUtils]: Spent 18.33s on a formula simplification that was a NOOP. DAG size: 205 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:01:56,753 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse20 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse1 (* .cse20 4))) (and (= |c_ULTIMATE.start_main_~sum~0#1| (select .cse0 (+ (- 4) |c_ULTIMATE.start_main_~#array~0#1.offset| (* |c_ULTIMATE.start_main_~row~0#1| .cse1) (* |c_ULTIMATE.start_main_~column~0#1| 4)))) (<= c_~ARR_SIZE~0 2) (= |c_ULTIMATE.start_main_~row~0#1| 0) (< 1 c_~ARR_SIZE~0) (or (and (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int)) (let ((.cse18 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse17 (div 0 .cse18))) (let ((.cse4 (* (- 1) .cse17 .cse18)) (.cse5 (* .cse18 4))) (let ((.cse3 (* .cse17 .cse5)) (.cse16 (* (mod (+ (* 4294967295 .cse4) c_~ARR_SIZE~0 4294967295) 4294967296) 4))) (let ((.cse15 (* .cse17 (+ (- 17179869184) .cse5))) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse12 (+ .cse3 .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse7 (store .cse11 .cse12 v_DerPreprocessor_13)) (.cse8 (+ (- 17179869184) .cse15 .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse2 (store .cse7 .cse8 (- 1))) (.cse10 (store .cse11 .cse12 v_DerPreprocessor_11)) (.cse9 (+ (- 17179869184) .cse3 .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (and (= (select .cse2 (+ .cse3 (* 4 .cse4) |c_ULTIMATE.start_main_~#array~0#1.offset|)) 1) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse5 4)) 0) (= (select .cse2 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse5)) 0) (let ((.cse6 (store .cse10 .cse9 (- 1)))) (= .cse6 (store (store .cse7 .cse8 (select .cse6 .cse8)) .cse9 (- 1)))) (let ((.cse14 (+ .cse15 .cse16 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse13 (store (store .cse10 .cse9 v_DerPreprocessor_9) .cse14 (- 1)))) (= (store (store .cse11 .cse12 (select .cse13 .cse12)) .cse14 (- 1)) .cse13)))))))))))) (= (+ (select .cse0 (let ((.cse19 (div 0 .cse20))) (+ (* .cse19 .cse1) (* (mod (+ (* 4294967295 (* (- 1) .cse19 .cse20)) c_~ARR_SIZE~0 4294967295) 4294967296) 4) |c_ULTIMATE.start_main_~#array~0#1.offset|))) 1) 0)) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse21 (mod c_~ARR_SIZE~0 4294967296))) (and (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~index1~0#1| (* .cse21 4)) (* 4 (mod (+ c_~ARR_SIZE~0 4294967294 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse21) 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset|)) 1) 0) (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int)) (let ((.cse37 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse28 (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse37)) (.cse23 (* .cse37 4))) (let ((.cse29 (* |ULTIMATE.start_main_~index1~0#1| .cse23)) (.cse36 (* 4 (mod (+ c_~ARR_SIZE~0 4294967294 (* .cse28 4294967295)) 4294967296)))) (let ((.cse35 (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) .cse23))) (.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse32 (+ .cse29 .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse34 (store .cse31 .cse32 v_DerPreprocessor_11)) (.cse27 (+ (- 17179869184) .cse29 .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (.cse25 (store .cse31 .cse32 v_DerPreprocessor_13)) (.cse26 (+ (- 17179869184) .cse35 .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse22 (store .cse25 .cse26 (- 1))) (.cse24 (store .cse34 .cse27 (- 1)))) (and (= (select .cse22 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse23)) 0) (= .cse24 (store (store .cse25 .cse26 (select .cse24 .cse26)) .cse27 (- 1))) (= (select .cse22 (+ (* .cse28 4) .cse29 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) 1) (let ((.cse33 (+ .cse35 .cse36 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse30 (store (store .cse34 .cse27 v_DerPreprocessor_9) .cse33 (- 1)))) (= .cse30 (store (store .cse31 .cse32 (select .cse30 .cse32)) .cse33 (- 1))))) (= (select .cse22 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse23 4)) 0) (= (select .cse24 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0))))))))) (= (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse21)) (+ 2 (* |ULTIMATE.start_main_~index1~0#1| 4294967296)))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (and (not (= (* 17179869184 |ULTIMATE.start_main_~index1~0#1|) 0)) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int)) (let ((.cse40 (* (mod c_~ARR_SIZE~0 4294967296) 4))) (let ((.cse46 (* (mod 0 4294967296) 4)) (.cse39 (* |ULTIMATE.start_main_~index1~0#1| .cse40))) (let ((.cse47 (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) .cse40))) (.cse48 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse49 (+ .cse46 .cse39 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse45 (store .cse48 .cse49 v_DerPreprocessor_11)) (.cse44 (+ (- 17179869184) .cse46 .cse39 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (.cse42 (store .cse48 .cse49 v_DerPreprocessor_13)) (.cse43 (+ (- 17179869184) .cse46 .cse47 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse38 (store .cse42 .cse43 (- 1))) (.cse41 (store .cse45 .cse44 (- 1)))) (and (= (select .cse38 (+ (- 4) .cse39 |c_ULTIMATE.start_main_~#array~0#1.offset| (* c_~ARR_SIZE~0 4))) 1) (= (select .cse38 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse40)) 0) (= (select .cse41 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (= (select .cse38 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= .cse41 (store (store .cse42 .cse43 (select .cse41 .cse43)) .cse44 (- 1))) (= (select (store (store .cse45 .cse44 v_DerPreprocessor_9) (+ .cse46 .cse47 |c_ULTIMATE.start_main_~#array~0#1.offset|) (- 1)) .cse44) v_DerPreprocessor_9)))))))) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod 0 4294967296) 4) (* |ULTIMATE.start_main_~index1~0#1| (* (mod c_~ARR_SIZE~0 4294967296) 4)) |c_ULTIMATE.start_main_~#array~0#1.offset|)) 1) 0))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (and (not (= (* 17179869184 |ULTIMATE.start_main_~index1~0#1|) 0)) (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int)) (let ((.cse63 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse55 (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse63)) (.cse57 (* .cse63 4))) (let ((.cse56 (* |ULTIMATE.start_main_~index1~0#1| .cse57)) (.cse53 (* (mod (+ c_~ARR_SIZE~0 (* .cse63 4294967295) 4294967295 (* .cse55 4294967295)) 4294967296) 4))) (let ((.cse52 (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) .cse57))) (.cse61 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse62 (+ .cse56 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53))) (let ((.cse59 (store .cse61 .cse62 v_DerPreprocessor_13)) (.cse60 (+ (- 17179869184) .cse52 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53)) (.cse50 (store .cse61 .cse62 v_DerPreprocessor_11)) (.cse51 (+ (- 17179869184) .cse56 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53))) (let ((.cse58 (store .cse50 .cse51 (- 1))) (.cse54 (store .cse59 .cse60 (- 1)))) (and (= (select (store (store .cse50 .cse51 v_DerPreprocessor_9) (+ .cse52 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse53) (- 1)) .cse51) v_DerPreprocessor_9) (= 1 (select .cse54 (+ (* .cse55 4) .cse56 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse57))) (= (select .cse58 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (= (select .cse54 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse57 4)) 0) (= (store (store .cse59 .cse60 (select .cse58 .cse60)) .cse51 (- 1)) .cse58) (= (select .cse54 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0))))))))) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) (let ((.cse64 (mod c_~ARR_SIZE~0 4294967296))) (+ (* |ULTIMATE.start_main_~index1~0#1| (* .cse64 4)) |c_ULTIMATE.start_main_~#array~0#1.offset| (* (mod (+ c_~ARR_SIZE~0 (* .cse64 4294967295) 4294967295 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse64) 4294967295)) 4294967296) 4)))) 1) 0)))) (= (+ (- 1) |c_ULTIMATE.start_main_~column~0#1|) 0)))) is different from false [2022-07-11 23:02:51,149 WARN L233 SmtUtils]: Spent 15.07s on a formula simplification that was a NOOP. DAG size: 205 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:03:44,296 WARN L233 SmtUtils]: Spent 16.13s on a formula simplification that was a NOOP. DAG size: 206 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:03:47,277 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse22 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse0 (+ (- 1) |c_ULTIMATE.start_main_~row~0#1|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse3 (* .cse22 4))) (and (= .cse0 0) (<= c_~ARR_SIZE~0 2) (= (let ((.cse2 (* .cse0 .cse3))) (+ (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~#array~0#1.offset| 4)))) |c_ULTIMATE.start_main_~sum~0#1|) (< 1 c_~ARR_SIZE~0) (or (and (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int)) (let ((.cse20 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse19 (div 0 .cse20))) (let ((.cse6 (* (- 1) .cse19 .cse20)) (.cse7 (* .cse20 4))) (let ((.cse5 (* .cse19 .cse7)) (.cse18 (* (mod (+ (* 4294967295 .cse6) c_~ARR_SIZE~0 4294967295) 4294967296) 4))) (let ((.cse17 (* .cse19 (+ (- 17179869184) .cse7))) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse14 (+ .cse5 .cse18 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse9 (store .cse13 .cse14 v_DerPreprocessor_13)) (.cse10 (+ (- 17179869184) .cse17 .cse18 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse4 (store .cse9 .cse10 (- 1))) (.cse12 (store .cse13 .cse14 v_DerPreprocessor_11)) (.cse11 (+ (- 17179869184) .cse5 .cse18 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (and (= (select .cse4 (+ .cse5 (* 4 .cse6) |c_ULTIMATE.start_main_~#array~0#1.offset|)) 1) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse7 4)) 0) (= (select .cse4 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse7)) 0) (let ((.cse8 (store .cse12 .cse11 (- 1)))) (= .cse8 (store (store .cse9 .cse10 (select .cse8 .cse10)) .cse11 (- 1)))) (let ((.cse16 (+ .cse17 .cse18 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse15 (store (store .cse12 .cse11 v_DerPreprocessor_9) .cse16 (- 1)))) (= (store (store .cse13 .cse14 (select .cse15 .cse14)) .cse16 (- 1)) .cse15)))))))))))) (= (+ (select .cse1 (let ((.cse21 (div 0 .cse22))) (+ (* .cse21 .cse3) (* (mod (+ (* 4294967295 (* (- 1) .cse21 .cse22)) c_~ARR_SIZE~0 4294967295) 4294967296) 4) |c_ULTIMATE.start_main_~#array~0#1.offset|))) 1) 0)) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (let ((.cse23 (mod c_~ARR_SIZE~0 4294967296))) (and (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~index1~0#1| (* .cse23 4)) (* 4 (mod (+ c_~ARR_SIZE~0 4294967294 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse23) 4294967295)) 4294967296)) |c_ULTIMATE.start_main_~#array~0#1.offset|)) 1) 0) (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int)) (let ((.cse39 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse30 (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse39)) (.cse25 (* .cse39 4))) (let ((.cse31 (* |ULTIMATE.start_main_~index1~0#1| .cse25)) (.cse38 (* 4 (mod (+ c_~ARR_SIZE~0 4294967294 (* .cse30 4294967295)) 4294967296)))) (let ((.cse37 (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) .cse25))) (.cse33 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse34 (+ .cse31 .cse38 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse36 (store .cse33 .cse34 v_DerPreprocessor_11)) (.cse29 (+ (- 17179869184) .cse31 .cse38 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (.cse27 (store .cse33 .cse34 v_DerPreprocessor_13)) (.cse28 (+ (- 17179869184) .cse37 .cse38 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse24 (store .cse27 .cse28 (- 1))) (.cse26 (store .cse36 .cse29 (- 1)))) (and (= (select .cse24 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse25)) 0) (= .cse26 (store (store .cse27 .cse28 (select .cse26 .cse28)) .cse29 (- 1))) (= (select .cse24 (+ (* .cse30 4) .cse31 |c_ULTIMATE.start_main_~#array~0#1.offset| 4 (* 17179869184 |ULTIMATE.start_main_~index1~0#1|))) 1) (let ((.cse35 (+ .cse37 .cse38 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse32 (store (store .cse36 .cse29 v_DerPreprocessor_9) .cse35 (- 1)))) (= .cse32 (store (store .cse33 .cse34 (select .cse32 .cse34)) .cse35 (- 1))))) (= (select .cse24 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse25 4)) 0) (= (select .cse26 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0))))))))) (= (+ c_~ARR_SIZE~0 (* |ULTIMATE.start_main_~index1~0#1| .cse23)) (+ 2 (* |ULTIMATE.start_main_~index1~0#1| 4294967296)))))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (and (not (= (* 17179869184 |ULTIMATE.start_main_~index1~0#1|) 0)) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int)) (let ((.cse42 (* (mod c_~ARR_SIZE~0 4294967296) 4))) (let ((.cse48 (* (mod 0 4294967296) 4)) (.cse41 (* |ULTIMATE.start_main_~index1~0#1| .cse42))) (let ((.cse49 (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) .cse42))) (.cse50 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse51 (+ .cse48 .cse41 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse47 (store .cse50 .cse51 v_DerPreprocessor_11)) (.cse46 (+ (- 17179869184) .cse48 .cse41 |c_ULTIMATE.start_main_~#array~0#1.offset|)) (.cse44 (store .cse50 .cse51 v_DerPreprocessor_13)) (.cse45 (+ (- 17179869184) .cse48 .cse49 |c_ULTIMATE.start_main_~#array~0#1.offset|))) (let ((.cse40 (store .cse44 .cse45 (- 1))) (.cse43 (store .cse47 .cse46 (- 1)))) (and (= (select .cse40 (+ (- 4) .cse41 |c_ULTIMATE.start_main_~#array~0#1.offset| (* c_~ARR_SIZE~0 4))) 1) (= (select .cse40 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse42)) 0) (= (select .cse43 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (= (select .cse40 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= .cse43 (store (store .cse44 .cse45 (select .cse43 .cse45)) .cse46 (- 1))) (= (select (store (store .cse47 .cse46 v_DerPreprocessor_9) (+ .cse48 .cse49 |c_ULTIMATE.start_main_~#array~0#1.offset|) (- 1)) .cse46) v_DerPreprocessor_9)))))))) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod 0 4294967296) 4) (* |ULTIMATE.start_main_~index1~0#1| (* (mod c_~ARR_SIZE~0 4294967296) 4)) |c_ULTIMATE.start_main_~#array~0#1.offset|)) 1) 0))) (exists ((|ULTIMATE.start_main_~index1~0#1| Int)) (and (not (= (* 17179869184 |ULTIMATE.start_main_~index1~0#1|) 0)) (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_9 Int)) (let ((.cse65 (mod c_~ARR_SIZE~0 4294967296))) (let ((.cse57 (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse65)) (.cse59 (* .cse65 4))) (let ((.cse58 (* |ULTIMATE.start_main_~index1~0#1| .cse59)) (.cse55 (* (mod (+ c_~ARR_SIZE~0 (* .cse65 4294967295) 4294967295 (* .cse57 4294967295)) 4294967296) 4))) (let ((.cse54 (* |ULTIMATE.start_main_~index1~0#1| (+ (- 17179869184) .cse59))) (.cse63 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|)) (.cse64 (+ .cse58 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse55))) (let ((.cse61 (store .cse63 .cse64 v_DerPreprocessor_13)) (.cse62 (+ (- 17179869184) .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse55)) (.cse52 (store .cse63 .cse64 v_DerPreprocessor_11)) (.cse53 (+ (- 17179869184) .cse58 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse55))) (let ((.cse60 (store .cse52 .cse53 (- 1))) (.cse56 (store .cse61 .cse62 (- 1)))) (and (= (select (store (store .cse52 .cse53 v_DerPreprocessor_9) (+ .cse54 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse55) (- 1)) .cse53) v_DerPreprocessor_9) (= 1 (select .cse56 (+ (* .cse57 4) .cse58 |c_ULTIMATE.start_main_~#array~0#1.offset| .cse59))) (= (select .cse60 |c_ULTIMATE.start_main_~#array~0#1.offset|) 0) (= (select .cse56 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| .cse59 4)) 0) (= (store (store .cse61 .cse62 (select .cse60 .cse62)) .cse53 (- 1)) .cse60) (= (select .cse56 (+ |c_ULTIMATE.start_main_~#array~0#1.offset| 4)) 0))))))))) (< |ULTIMATE.start_main_~index1~0#1| c_~ARR_SIZE~0) (<= 0 |ULTIMATE.start_main_~index1~0#1|) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0#1.base|) (let ((.cse66 (mod c_~ARR_SIZE~0 4294967296))) (+ (* |ULTIMATE.start_main_~index1~0#1| (* .cse66 4)) |c_ULTIMATE.start_main_~#array~0#1.offset| (* (mod (+ c_~ARR_SIZE~0 (* .cse66 4294967295) 4294967295 (* (* (- 1) |ULTIMATE.start_main_~index1~0#1| .cse66) 4294967295)) 4294967296) 4)))) 1) 0)))) (= |c_ULTIMATE.start_main_~column~0#1| 0)))) is different from false