./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/condm.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/condm.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 6f961be2104ef3ac444088284f7936b105cc31dfbd8617bc6896bf1b51a5f23d --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 18:56:13,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 18:56:13,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 18:56:13,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 18:56:13,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 18:56:13,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 18:56:13,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 18:56:13,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 18:56:13,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 18:56:13,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 18:56:13,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 18:56:13,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 18:56:13,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 18:56:13,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 18:56:13,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 18:56:13,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 18:56:13,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 18:56:13,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 18:56:13,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 18:56:13,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 18:56:13,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 18:56:13,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 18:56:13,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 18:56:13,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 18:56:13,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 18:56:13,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 18:56:13,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 18:56:13,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 18:56:13,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 18:56:13,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 18:56:13,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 18:56:13,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 18:56:13,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 18:56:13,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 18:56:13,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 18:56:13,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 18:56:13,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 18:56:13,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 18:56:13,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 18:56:13,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 18:56:13,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 18:56:13,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 18:56:13,640 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 18:56:13,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 18:56:13,640 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 18:56:13,640 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 18:56:13,641 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 18:56:13,641 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 18:56:13,642 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 18:56:13,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 18:56:13,642 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 18:56:13,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 18:56:13,643 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 18:56:13,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 18:56:13,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 18:56:13,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 18:56:13,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 18:56:13,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 18:56:13,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 18:56:13,644 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 18:56:13,644 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 18:56:13,644 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 18:56:13,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 18:56:13,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 18:56:13,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 18:56:13,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 18:56:13,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 18:56:13,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 18:56:13,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 18:56:13,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 18:56:13,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 18:56:13,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 18:56:13,646 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 18:56:13,646 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 18:56:13,646 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 18:56:13,646 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 18:56:13,647 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 18:56:13,647 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f961be2104ef3ac444088284f7936b105cc31dfbd8617bc6896bf1b51a5f23d [2023-02-15 18:56:13,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 18:56:13,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 18:56:13,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 18:56:13,876 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 18:56:13,876 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 18:56:13,877 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condm.c [2023-02-15 18:56:14,764 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 18:56:14,910 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 18:56:14,911 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condm.c [2023-02-15 18:56:14,915 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f225025/0c15c26a95ca4e3eb177464e4917121e/FLAG5ad90909c [2023-02-15 18:56:14,928 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f225025/0c15c26a95ca4e3eb177464e4917121e [2023-02-15 18:56:14,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 18:56:14,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 18:56:14,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 18:56:14,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 18:56:14,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 18:56:14,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 06:56:14" (1/1) ... [2023-02-15 18:56:14,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672e87be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:56:14, skipping insertion in model container [2023-02-15 18:56:14,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 06:56:14" (1/1) ... [2023-02-15 18:56:14,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 18:56:14,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 18:56:15,063 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condm.c[588,601] [2023-02-15 18:56:15,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 18:56:15,095 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 18:56:15,103 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condm.c[588,601] [2023-02-15 18:56:15,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 18:56:15,118 INFO L208 MainTranslator]: Completed translation [2023-02-15 18:56:15,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:56:15 WrapperNode [2023-02-15 18:56:15,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 18:56:15,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 18:56:15,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 18:56:15,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 18:56:15,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:56:15" (1/1) ... [2023-02-15 18:56:15,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:56:15" (1/1) ... [2023-02-15 18:56:15,143 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2023-02-15 18:56:15,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 18:56:15,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 18:56:15,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 18:56:15,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 18:56:15,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:56:15" (1/1) ... [2023-02-15 18:56:15,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:56:15" (1/1) ... [2023-02-15 18:56:15,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:56:15" (1/1) ... [2023-02-15 18:56:15,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:56:15" (1/1) ... [2023-02-15 18:56:15,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:56:15" (1/1) ... [2023-02-15 18:56:15,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:56:15" (1/1) ... [2023-02-15 18:56:15,165 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:56:15" (1/1) ... [2023-02-15 18:56:15,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:56:15" (1/1) ... [2023-02-15 18:56:15,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 18:56:15,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 18:56:15,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 18:56:15,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 18:56:15,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:56:15" (1/1) ... [2023-02-15 18:56:15,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 18:56:15,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 18:56:15,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 18:56:15,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 18:56:15,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 18:56:15,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 18:56:15,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 18:56:15,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 18:56:15,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 18:56:15,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 18:56:15,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 18:56:15,275 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 18:56:15,277 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 18:56:15,402 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 18:56:15,406 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 18:56:15,406 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 18:56:15,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 06:56:15 BoogieIcfgContainer [2023-02-15 18:56:15,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 18:56:15,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 18:56:15,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 18:56:15,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 18:56:15,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 06:56:14" (1/3) ... [2023-02-15 18:56:15,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bc814e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 06:56:15, skipping insertion in model container [2023-02-15 18:56:15,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:56:15" (2/3) ... [2023-02-15 18:56:15,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bc814e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 06:56:15, skipping insertion in model container [2023-02-15 18:56:15,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 06:56:15" (3/3) ... [2023-02-15 18:56:15,423 INFO L112 eAbstractionObserver]: Analyzing ICFG condm.c [2023-02-15 18:56:15,435 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 18:56:15,435 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 18:56:15,469 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 18:56:15,474 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@954f761, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 18:56:15,474 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 18:56:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:15,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 18:56:15,480 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:56:15,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:56:15,481 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:56:15,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:56:15,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1828392228, now seen corresponding path program 1 times [2023-02-15 18:56:15,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:56:15,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597482212] [2023-02-15 18:56:15,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:56:15,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:56:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:56:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 18:56:15,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:56:15,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597482212] [2023-02-15 18:56:15,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597482212] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 18:56:15,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 18:56:15,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 18:56:15,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792192532] [2023-02-15 18:56:15,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 18:56:15,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 18:56:15,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:56:15,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 18:56:15,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 18:56:15,620 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:15,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 18:56:15,654 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2023-02-15 18:56:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 18:56:15,656 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 18:56:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 18:56:15,664 INFO L225 Difference]: With dead ends: 40 [2023-02-15 18:56:15,665 INFO L226 Difference]: Without dead ends: 18 [2023-02-15 18:56:15,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 18:56:15,669 INFO L413 NwaCegarLoop]: 26 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, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 18:56:15,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 18:56:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-15 18:56:15,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-15 18:56:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-02-15 18:56:15,691 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2023-02-15 18:56:15,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 18:56:15,691 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-02-15 18:56:15,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:15,692 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-02-15 18:56:15,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 18:56:15,692 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:56:15,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:56:15,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 18:56:15,693 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:56:15,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:56:15,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1148333858, now seen corresponding path program 1 times [2023-02-15 18:56:15,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:56:15,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232064979] [2023-02-15 18:56:15,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:56:15,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:56:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:56:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 18:56:15,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:56:15,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232064979] [2023-02-15 18:56:15,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232064979] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 18:56:15,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 18:56:15,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 18:56:15,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600277127] [2023-02-15 18:56:15,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 18:56:15,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 18:56:15,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:56:15,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 18:56:15,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 18:56:15,806 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:15,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 18:56:15,847 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2023-02-15 18:56:15,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 18:56:15,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 18:56:15,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 18:56:15,848 INFO L225 Difference]: With dead ends: 40 [2023-02-15 18:56:15,848 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 18:56:15,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 18:56:15,850 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 18:56:15,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 15 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 18:56:15,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 18:56:15,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2023-02-15 18:56:15,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-02-15 18:56:15,854 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2023-02-15 18:56:15,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 18:56:15,854 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-02-15 18:56:15,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:15,855 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-02-15 18:56:15,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 18:56:15,855 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:56:15,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:56:15,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 18:56:15,856 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:56:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:56:15,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2142875084, now seen corresponding path program 1 times [2023-02-15 18:56:15,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:56:15,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959077333] [2023-02-15 18:56:15,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:56:15,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:56:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:56:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 18:56:16,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:56:16,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959077333] [2023-02-15 18:56:16,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959077333] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 18:56:16,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263542449] [2023-02-15 18:56:16,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:56:16,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:56:16,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 18:56:16,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 18:56:16,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 18:56:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:56:16,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 18:56:16,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 18:56:16,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 18:56:16,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 18:56:16,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-02-15 18:56:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 18:56:16,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 18:56:16,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-02-15 18:56:16,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-02-15 18:56:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 18:56:16,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263542449] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 18:56:16,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 18:56:16,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 7] total 19 [2023-02-15 18:56:16,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912372597] [2023-02-15 18:56:16,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 18:56:16,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 18:56:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:56:16,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 18:56:16,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-02-15 18:56:16,995 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:18,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 18:56:18,176 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2023-02-15 18:56:18,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 18:56:18,177 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 18:56:18,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 18:56:18,177 INFO L225 Difference]: With dead ends: 63 [2023-02-15 18:56:18,177 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 18:56:18,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=333, Invalid=1149, Unknown=0, NotChecked=0, Total=1482 [2023-02-15 18:56:18,179 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 240 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 18:56:18,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 92 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 18:56:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 18:56:18,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2023-02-15 18:56:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2023-02-15 18:56:18,186 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 17 [2023-02-15 18:56:18,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 18:56:18,186 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-02-15 18:56:18,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2023-02-15 18:56:18,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 18:56:18,187 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:56:18,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:56:18,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 18:56:18,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:56:18,392 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:56:18,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:56:18,393 INFO L85 PathProgramCache]: Analyzing trace with hash -367867722, now seen corresponding path program 1 times [2023-02-15 18:56:18,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:56:18,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74726078] [2023-02-15 18:56:18,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:56:18,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:56:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:56:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 18:56:19,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:56:19,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74726078] [2023-02-15 18:56:19,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74726078] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 18:56:19,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180879269] [2023-02-15 18:56:19,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:56:19,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:56:19,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 18:56:19,180 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 18:56:19,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 18:56:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:56:19,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 18:56:19,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 18:56:19,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 18:56:19,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 18:56:19,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2023-02-15 18:56:19,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 18:56:19,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 18:56:19,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-02-15 18:56:19,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2023-02-15 18:56:19,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-02-15 18:56:19,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-02-15 18:56:19,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-02-15 18:56:19,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-02-15 18:56:19,723 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 18:56:19,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 18:56:19,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180879269] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 18:56:19,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 18:56:19,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2023-02-15 18:56:19,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751157214] [2023-02-15 18:56:19,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 18:56:19,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 18:56:19,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:56:19,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 18:56:19,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2023-02-15 18:56:19,757 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 18:56:20,449 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2023-02-15 18:56:20,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 18:56:20,449 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 18:56:20,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 18:56:20,450 INFO L225 Difference]: With dead ends: 84 [2023-02-15 18:56:20,450 INFO L226 Difference]: Without dead ends: 74 [2023-02-15 18:56:20,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 18:56:20,451 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 159 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 18:56:20,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 115 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 18:56:20,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-15 18:56:20,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 39. [2023-02-15 18:56:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2023-02-15 18:56:20,458 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 17 [2023-02-15 18:56:20,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 18:56:20,459 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2023-02-15 18:56:20,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2023-02-15 18:56:20,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 18:56:20,459 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:56:20,460 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:56:20,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 18:56:20,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-15 18:56:20,665 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:56:20,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:56:20,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1503561492, now seen corresponding path program 1 times [2023-02-15 18:56:20,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:56:20,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370487755] [2023-02-15 18:56:20,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:56:20,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:56:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:56:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 18:56:20,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:56:20,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370487755] [2023-02-15 18:56:20,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370487755] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 18:56:20,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221202892] [2023-02-15 18:56:20,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:56:20,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:56:20,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 18:56:20,760 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 18:56:20,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 18:56:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:56:20,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 18:56:20,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 18:56:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 18:56:20,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 18:56:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 18:56:20,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221202892] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 18:56:20,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 18:56:20,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 18:56:20,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203083986] [2023-02-15 18:56:20,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 18:56:20,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 18:56:20,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:56:20,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 18:56:20,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-15 18:56:20,878 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 18:56:20,966 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2023-02-15 18:56:20,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 18:56:20,966 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 18:56:20,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 18:56:20,967 INFO L225 Difference]: With dead ends: 79 [2023-02-15 18:56:20,967 INFO L226 Difference]: Without dead ends: 51 [2023-02-15 18:56:20,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-15 18:56:20,968 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 18:56:20,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 47 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 18:56:20,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-15 18:56:20,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2023-02-15 18:56:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-02-15 18:56:20,974 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 21 [2023-02-15 18:56:20,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 18:56:20,974 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-02-15 18:56:20,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-02-15 18:56:20,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 18:56:20,975 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:56:20,975 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:56:20,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 18:56:21,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:56:21,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:56:21,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:56:21,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1344001096, now seen corresponding path program 2 times [2023-02-15 18:56:21,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:56:21,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045414606] [2023-02-15 18:56:21,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:56:21,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:56:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:56:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 18:56:21,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:56:21,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045414606] [2023-02-15 18:56:21,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045414606] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 18:56:21,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053194064] [2023-02-15 18:56:21,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 18:56:21,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:56:21,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 18:56:21,247 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 18:56:21,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 18:56:21,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 18:56:21,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 18:56:21,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 18:56:21,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 18:56:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 18:56:21,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 18:56:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 18:56:21,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053194064] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 18:56:21,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 18:56:21,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-15 18:56:21,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071402456] [2023-02-15 18:56:21,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 18:56:21,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 18:56:21,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:56:21,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 18:56:21,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-15 18:56:21,384 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:21,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 18:56:21,489 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2023-02-15 18:56:21,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 18:56:21,490 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-15 18:56:21,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 18:56:21,490 INFO L225 Difference]: With dead ends: 106 [2023-02-15 18:56:21,490 INFO L226 Difference]: Without dead ends: 82 [2023-02-15 18:56:21,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2023-02-15 18:56:21,491 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 103 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 18:56:21,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 55 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 18:56:21,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-15 18:56:21,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2023-02-15 18:56:21,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:21,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2023-02-15 18:56:21,500 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 25 [2023-02-15 18:56:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 18:56:21,500 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2023-02-15 18:56:21,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2023-02-15 18:56:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 18:56:21,501 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:56:21,501 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:56:21,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 18:56:21,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:56:21,707 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:56:21,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:56:21,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1394926352, now seen corresponding path program 1 times [2023-02-15 18:56:21,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:56:21,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349893382] [2023-02-15 18:56:21,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:56:21,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:56:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:56:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 18:56:22,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:56:22,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349893382] [2023-02-15 18:56:22,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349893382] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 18:56:22,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21943261] [2023-02-15 18:56:22,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:56:22,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:56:22,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 18:56:22,427 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 18:56:22,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 18:56:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:56:22,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-15 18:56:22,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 18:56:22,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-15 18:56:22,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:56:22,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 18:56:22,561 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 18:56:22,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:56:22,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 18:56:22,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 41 [2023-02-15 18:56:22,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:56:22,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 18:56:22,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2023-02-15 18:56:22,788 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 18:56:22,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 27 [2023-02-15 18:56:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 18:56:22,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 18:56:23,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2023-02-15 18:56:23,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 18:56:23,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1578 treesize of output 1330 [2023-02-15 18:56:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 18:56:24,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21943261] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 18:56:24,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 18:56:24,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2023-02-15 18:56:24,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651381587] [2023-02-15 18:56:24,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 18:56:24,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-15 18:56:24,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:56:24,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-15 18:56:24,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1006, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 18:56:24,035 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 36 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:33,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 18:56:33,596 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2023-02-15 18:56:33,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-02-15 18:56:33,597 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 18:56:33,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 18:56:33,597 INFO L225 Difference]: With dead ends: 102 [2023-02-15 18:56:33,598 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 18:56:33,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=668, Invalid=2992, Unknown=0, NotChecked=0, Total=3660 [2023-02-15 18:56:33,599 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 120 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 18:56:33,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 177 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 18:56:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 18:56:33,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 52. [2023-02-15 18:56:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2023-02-15 18:56:33,608 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 26 [2023-02-15 18:56:33,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 18:56:33,608 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2023-02-15 18:56:33,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 18:56:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2023-02-15 18:56:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 18:56:33,609 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:56:33,609 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:56:33,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 18:56:33,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:56:33,813 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:56:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:56:33,814 INFO L85 PathProgramCache]: Analyzing trace with hash -562149382, now seen corresponding path program 3 times [2023-02-15 18:56:33,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:56:33,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238324674] [2023-02-15 18:56:33,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:56:33,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:56:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:56:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 18:56:34,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:56:34,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238324674] [2023-02-15 18:56:34,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238324674] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 18:56:34,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596261322] [2023-02-15 18:56:34,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 18:56:34,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:56:34,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 18:56:34,668 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 18:56:34,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 18:56:34,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 18:56:34,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 18:56:34,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-15 18:56:34,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 18:56:34,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-15 18:56:34,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:56:34,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 18:56:34,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:56:34,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 18:56:34,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 18:56:35,033 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-15 18:56:35,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2023-02-15 18:56:35,135 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-15 18:56:35,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2023-02-15 18:56:35,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2023-02-15 18:56:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 18:56:35,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 18:57:03,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2023-02-15 18:57:03,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1568 treesize of output 1552 [2023-02-15 18:57:03,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 140 [2023-02-15 18:57:03,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1291 treesize of output 1275 [2023-02-15 18:57:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 18:57:03,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596261322] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 18:57:03,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 18:57:03,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 50 [2023-02-15 18:57:03,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980739103] [2023-02-15 18:57:03,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 18:57:03,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-15 18:57:03,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:57:03,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-15 18:57:03,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2078, Unknown=5, NotChecked=0, Total=2450 [2023-02-15 18:57:03,996 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 50 states, 50 states have (on average 1.48) internal successors, (74), 50 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:00:16,304 WARN L233 SmtUtils]: Spent 3.20m on a formula simplification. DAG size of input: 245 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:00:25,730 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 114 DAG size of output: 26 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:00:27,766 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse9 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (mod c_~N~0 2)) (.cse6 (select .cse4 .cse5))) (let ((.cse31 (mod .cse6 2)) (.cse0 (= 0 .cse2)) (.cse27 (mod .cse9 2)) (.cse36 (< c_~N~0 0))) (let ((.cse10 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse21 (not .cse36)) (.cse23 (= 0 .cse27)) (.cse22 (< .cse9 0)) (.cse26 (and .cse36 (not .cse0))) (.cse24 (< .cse6 0)) (.cse25 (= 0 .cse31)) (.cse33 (* 4 |c_ULTIMATE.start_main_~i~0#1|)) (.cse17 (<= (mod c_~N~0 4294967296) 536870911))) (and (or .cse0 (let ((.cse1 (store .cse4 .cse5 (+ .cse6 1)))) (and (forall ((v_ArrVal_137 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (v_subst_1 Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_67| (+ v_subst_1 1))) (forall ((v_ArrVal_140 Int)) (= (mod (select (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_subst_1 4)) v_ArrVal_137) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_67| 4)) v_ArrVal_140) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) .cse2)) (< (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) c_~N~0))) (forall ((v_ArrVal_137 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (v_subst_2 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) c_~N~0) (forall ((v_ArrVal_140 Int)) (let ((.cse3 (select (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_subst_2 4)) v_ArrVal_137) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_67| 4)) v_ArrVal_140) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 0 (mod .cse3 2)) (not (< .cse3 0))))) (not (<= |v_ULTIMATE.start_main_~i~0#1_67| (+ v_subst_2 1)))))))) (< 0 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or .cse0 (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse9 1)))) (and (forall ((v_ArrVal_137 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_140 Int)) (let ((.cse7 (select (store (store .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_subst_2 4)) v_ArrVal_137) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_67| 4)) v_ArrVal_140) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 0 (mod .cse7 2)) (not (< .cse7 0))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_67| (+ v_subst_2 1))))) (forall ((v_ArrVal_137 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (v_subst_1 Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_67| (+ v_subst_1 1))) (forall ((v_ArrVal_140 Int)) (= (mod (select (store (store .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_subst_1 4)) v_ArrVal_137) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_67| 4)) v_ArrVal_140) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) .cse2)) (< (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) c_~N~0)))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (not (<= .cse10 |v_ULTIMATE.start_main_~i~0#1_72|)) (forall ((v_ArrVal_132 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_72| 1) |v_ULTIMATE.start_main_~i~0#1_71|)) (forall ((v_ArrVal_137 Int) (v_ArrVal_133 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_140 Int)) (let ((.cse11 (select (store (store (let ((.cse12 (store (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_72| 4)) v_ArrVal_132) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)) v_ArrVal_133))) (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_subst_2 4)) v_ArrVal_137) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_67| 4)) v_ArrVal_140) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 0 (mod .cse11 2)) (not (< .cse11 0))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_67| (+ v_subst_2 1))))) (not (< |v_ULTIMATE.start_main_~i~0#1_71| c_~N~0)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (forall ((v_ArrVal_132 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (forall ((v_ArrVal_137 Int) (v_ArrVal_133 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (v_subst_1 Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_67| (+ v_subst_1 1))) (forall ((v_ArrVal_140 Int)) (= (mod (select (store (store (let ((.cse13 (store (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_72| 4)) v_ArrVal_132) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)) v_ArrVal_133))) (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_subst_1 4)) v_ArrVal_137) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_67| 4)) v_ArrVal_140) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) .cse2)) (< (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) c_~N~0))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_72| 1) |v_ULTIMATE.start_main_~i~0#1_71|)) (not (< |v_ULTIMATE.start_main_~i~0#1_71| c_~N~0)))) (not (<= .cse10 |v_ULTIMATE.start_main_~i~0#1_72|)))))) (or .cse0 (and (forall ((v_ArrVal_132 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (forall ((v_ArrVal_137 Int) (v_ArrVal_133 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (v_subst_1 Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_67| (+ v_subst_1 1))) (< (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) c_~N~0) (forall ((v_ArrVal_140 Int)) (= (mod (select (store (store (let ((.cse14 (store (store .cse4 .cse5 v_ArrVal_132) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)) v_ArrVal_133))) (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_subst_1 4)) v_ArrVal_137) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_67| 4)) v_ArrVal_140) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) .cse2)))) (not (<= .cse10 |v_ULTIMATE.start_main_~i~0#1_71|)) (not (< |v_ULTIMATE.start_main_~i~0#1_71| c_~N~0)))) (forall ((v_ArrVal_132 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (not (<= .cse10 |v_ULTIMATE.start_main_~i~0#1_71|)) (forall ((v_ArrVal_137 Int) (v_ArrVal_133 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (v_subst_2 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) c_~N~0) (forall ((v_ArrVal_140 Int)) (let ((.cse15 (select (store (store (let ((.cse16 (store (store .cse4 .cse5 v_ArrVal_132) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)) v_ArrVal_133))) (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_subst_2 4)) v_ArrVal_137) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_67| 4)) v_ArrVal_140) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 0 (mod .cse15 2)) (not (< .cse15 0))))) (not (<= |v_ULTIMATE.start_main_~i~0#1_67| (+ v_subst_2 1))))) (not (< |v_ULTIMATE.start_main_~i~0#1_71| c_~N~0)))))) .cse17 (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (not (<= .cse10 |v_ULTIMATE.start_main_~i~0#1_71|)) (forall ((v_ArrVal_137 Int) (v_ArrVal_133 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (v_subst_1 Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_67| (+ v_subst_1 1))) (< (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) c_~N~0) (forall ((v_ArrVal_140 Int)) (= (mod (select (store (store (let ((.cse18 (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)) v_ArrVal_133))) (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_subst_1 4)) v_ArrVal_137) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_67| 4)) v_ArrVal_140) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) .cse2)))) (not (< |v_ULTIMATE.start_main_~i~0#1_71| c_~N~0)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (forall ((v_ArrVal_137 Int) (v_ArrVal_133 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_140 Int)) (let ((.cse19 (select (store (store (let ((.cse20 (store .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)) v_ArrVal_133))) (store .cse20 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_subst_2 4)) v_ArrVal_137) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_67| 4)) v_ArrVal_140) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 0 (mod .cse19 2)) (not (< .cse19 0))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_67| (+ v_subst_2 1))))) (not (<= .cse10 |v_ULTIMATE.start_main_~i~0#1_71|)) (not (< |v_ULTIMATE.start_main_~i~0#1_71| c_~N~0)))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (or .cse0 .cse21 (and .cse22 (not .cse23))) (or .cse0 .cse21 (and .cse24 (not .cse25))) (or .cse26 (and (or .cse23 (not .cse22)) (= .cse27 .cse2))) (not (<= c_~N~0 0)) (or .cse0 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (and (forall ((v_ArrVal_137 Int) (v_ArrVal_133 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_140 Int)) (= (mod (select (store (store (let ((.cse28 (store .cse4 .cse5 v_ArrVal_133))) (store .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_subst_1 4)) v_ArrVal_137) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_67| 4)) v_ArrVal_140) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) .cse2)) (not (<= |v_ULTIMATE.start_main_~i~0#1_67| (+ v_subst_1 1))) (< (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) c_~N~0))) (forall ((v_ArrVal_137 Int) (v_ArrVal_133 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (v_subst_2 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) c_~N~0) (forall ((v_ArrVal_140 Int)) (let ((.cse29 (select (store (store (let ((.cse30 (store .cse4 .cse5 v_ArrVal_133))) (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* v_subst_2 4)) v_ArrVal_137) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_67| 4)) v_ArrVal_140) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse29 0)) (= 0 (mod .cse29 2))))) (not (<= |v_ULTIMATE.start_main_~i~0#1_67| (+ v_subst_2 1))))))) (<= 3 c_~N~0) (or .cse26 (and (= .cse31 .cse2) (or (not .cse24) .cse25))) (= 0 |c_ULTIMATE.start_main_~a~0#1.offset|) (or .cse0 (and (forall ((v_ArrVal_137 Int) (|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_67| (+ |ULTIMATE.start_main_~i~0#1| 1))) (< (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) c_~N~0) (forall ((v_ArrVal_140 Int)) (= (mod (select (store (store .cse4 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_137) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_67| 4)) v_ArrVal_140) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) .cse2)))) (forall ((v_ArrVal_137 Int) (|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_67| (+ |ULTIMATE.start_main_~i~0#1| 1))) (forall ((v_ArrVal_140 Int)) (let ((.cse32 (select (store (store .cse4 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_137) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_67| 4)) v_ArrVal_140) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse32 0)) (= 0 (mod .cse32 2))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) c_~N~0))))) (or (let ((.cse34 (select .cse4 0)) (.cse35 (div c_~N~0 2))) (and (not (= (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse33) 0)) (<= .cse34 1) (<= 1 c_~N~0) (<= 1 .cse34) (<= .cse35 1) (= c_~N~0 (+ (* 2 .cse35) 1)))) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 3) c_~N~0)) (or (= .cse9 1) (= 0 .cse33)) (or (and (not .cse17) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse17))))))) is different from false [2023-02-15 19:00:40,969 WARN L233 SmtUtils]: Spent 6.36s on a formula simplification. DAG size of input: 177 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:00:42,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]