./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test22-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/test22-1.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 e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:40:15,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:40:15,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:40:15,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:40:15,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:40:15,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:40:15,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:40:15,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:40:15,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:40:15,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:40:15,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:40:15,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:40:15,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:40:15,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:40:15,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:40:15,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:40:15,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:40:15,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:40:15,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:40:15,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:40:15,586 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:40:15,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:40:15,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:40:15,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:40:15,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:40:15,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:40:15,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:40:15,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:40:15,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:40:15,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:40:15,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:40:15,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:40:15,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:40:15,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:40:15,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:40:15,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:40:15,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:40:15,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:40:15,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:40:15,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:40:15,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:40:15,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:40:15,602 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 14:40:15,630 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:40:15,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:40:15,632 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:40:15,632 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:40:15,632 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:40:15,633 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:40:15,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:40:15,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:40:15,634 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:40:15,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:40:15,635 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:40:15,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:40:15,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:40:15,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:40:15,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:40:15,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:40:15,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:40:15,636 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:40:15,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:40:15,637 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:40:15,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:40:15,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:40:15,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:40:15,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:40:15,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:40:15,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:40:15,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:40:15,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:40:15,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:40:15,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:40:15,640 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:40:15,640 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:40:15,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:40:15,640 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f [2022-07-22 14:40:15,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:40:15,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:40:15,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:40:15,919 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:40:15,920 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:40:15,921 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test22-1.c [2022-07-22 14:40:15,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6265f028/dfdf2ee69364422f8979e46a8b44a956/FLAGa7ca255a4 [2022-07-22 14:40:16,420 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:40:16,420 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c [2022-07-22 14:40:16,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6265f028/dfdf2ee69364422f8979e46a8b44a956/FLAGa7ca255a4 [2022-07-22 14:40:16,825 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6265f028/dfdf2ee69364422f8979e46a8b44a956 [2022-07-22 14:40:16,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:40:16,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:40:16,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:40:16,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:40:16,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:40:16,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:40:16" (1/1) ... [2022-07-22 14:40:16,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c86a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:40:16, skipping insertion in model container [2022-07-22 14:40:16,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:40:16" (1/1) ... [2022-07-22 14:40:16,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:40:16,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:40:17,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c[1029,1042] [2022-07-22 14:40:17,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:40:17,033 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:40:17,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c[1029,1042] [2022-07-22 14:40:17,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:40:17,060 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:40:17,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:40:17 WrapperNode [2022-07-22 14:40:17,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:40:17,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:40:17,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:40:17,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:40:17,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:40:17" (1/1) ... [2022-07-22 14:40:17,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:40:17" (1/1) ... [2022-07-22 14:40:17,091 INFO L137 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 85 [2022-07-22 14:40:17,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:40:17,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:40:17,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:40:17,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:40:17,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:40:17" (1/1) ... [2022-07-22 14:40:17,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:40:17" (1/1) ... [2022-07-22 14:40:17,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:40:17" (1/1) ... [2022-07-22 14:40:17,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:40:17" (1/1) ... [2022-07-22 14:40:17,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:40:17" (1/1) ... [2022-07-22 14:40:17,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:40:17" (1/1) ... [2022-07-22 14:40:17,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:40:17" (1/1) ... [2022-07-22 14:40:17,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:40:17,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:40:17,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:40:17,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:40:17,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:40:17" (1/1) ... [2022-07-22 14:40:17,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:40:17,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:40:17,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 14:40:17,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 14:40:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:40:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:40:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 14:40:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2022-07-22 14:40:17,183 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2022-07-22 14:40:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:40:17,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:40:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 14:40:17,268 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:40:17,270 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:40:17,458 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:40:17,470 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:40:17,483 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 14:40:17,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:40:17 BoogieIcfgContainer [2022-07-22 14:40:17,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:40:17,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:40:17,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:40:17,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:40:17,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:40:16" (1/3) ... [2022-07-22 14:40:17,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f64774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:40:17, skipping insertion in model container [2022-07-22 14:40:17,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:40:17" (2/3) ... [2022-07-22 14:40:17,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f64774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:40:17, skipping insertion in model container [2022-07-22 14:40:17,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:40:17" (3/3) ... [2022-07-22 14:40:17,499 INFO L111 eAbstractionObserver]: Analyzing ICFG test22-1.c [2022-07-22 14:40:17,512 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:40:17,512 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:40:17,553 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:40:17,559 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@41f4e95f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@df8986 [2022-07-22 14:40:17,559 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:40:17,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:40:17,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 14:40:17,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:40:17,572 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:40:17,572 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:40:17,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:40:17,576 INFO L85 PathProgramCache]: Analyzing trace with hash -911093318, now seen corresponding path program 1 times [2022-07-22 14:40:17,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:40:17,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887260128] [2022-07-22 14:40:17,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:40:17,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:40:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:17,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:40:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:17,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 14:40:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:17,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 14:40:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 14:40:17,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:40:17,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887260128] [2022-07-22 14:40:17,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887260128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:40:17,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:40:17,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:40:17,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892231381] [2022-07-22 14:40:17,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:40:17,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:40:17,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:40:17,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:40:17,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:40:17,910 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 14:40:17,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:40:17,928 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-07-22 14:40:17,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:40:17,930 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-07-22 14:40:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:40:17,937 INFO L225 Difference]: With dead ends: 35 [2022-07-22 14:40:17,938 INFO L226 Difference]: Without dead ends: 22 [2022-07-22 14:40:17,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:40:17,944 INFO L413 NwaCegarLoop]: 31 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, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:40:17,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:40:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-22 14:40:17,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-22 14:40:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:40:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-22 14:40:17,985 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2022-07-22 14:40:17,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:40:17,987 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-22 14:40:17,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 14:40:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-22 14:40:17,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 14:40:17,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:40:17,990 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:40:17,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:40:17,992 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:40:17,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:40:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1614870372, now seen corresponding path program 1 times [2022-07-22 14:40:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:40:17,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015617918] [2022-07-22 14:40:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:40:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:40:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:18,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:40:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:18,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 14:40:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:18,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 14:40:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:40:18,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:40:18,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015617918] [2022-07-22 14:40:18,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015617918] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:40:18,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677581742] [2022-07-22 14:40:18,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:40:18,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:40:18,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:40:18,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:40:18,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 14:40:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:18,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-22 14:40:18,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:40:18,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-22 14:40:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:40:18,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:40:18,947 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-22 14:40:18,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-07-22 14:40:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 14:40:19,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677581742] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 14:40:19,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:40:19,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 16] total 26 [2022-07-22 14:40:19,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037750869] [2022-07-22 14:40:19,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:40:19,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 14:40:19,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:40:19,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 14:40:19,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-07-22 14:40:19,037 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 14:40:19,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:40:19,128 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-07-22 14:40:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:40:19,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-22 14:40:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:40:19,130 INFO L225 Difference]: With dead ends: 30 [2022-07-22 14:40:19,130 INFO L226 Difference]: Without dead ends: 25 [2022-07-22 14:40:19,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-07-22 14:40:19,131 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:40:19,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 77 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:40:19,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-22 14:40:19,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-07-22 14:40:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:40:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-22 14:40:19,147 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2022-07-22 14:40:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:40:19,147 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-22 14:40:19,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 14:40:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-22 14:40:19,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-22 14:40:19,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:40:19,148 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:40:19,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 14:40:19,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:40:19,372 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:40:19,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:40:19,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1377934871, now seen corresponding path program 1 times [2022-07-22 14:40:19,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:40:19,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664099025] [2022-07-22 14:40:19,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:40:19,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:40:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:19,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:40:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:19,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 14:40:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:19,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 14:40:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:19,586 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:40:19,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:40:19,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664099025] [2022-07-22 14:40:19,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664099025] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:40:19,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928217564] [2022-07-22 14:40:19,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:40:19,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:40:19,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:40:19,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:40:19,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 14:40:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:19,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-22 14:40:19,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:40:20,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-22 14:40:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:40:20,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:40:20,150 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-22 14:40:20,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-07-22 14:40:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 14:40:20,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928217564] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:40:20,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:40:20,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 7] total 29 [2022-07-22 14:40:20,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292402222] [2022-07-22 14:40:20,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:40:20,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-22 14:40:20,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:40:20,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-22 14:40:20,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2022-07-22 14:40:20,204 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 24 states have internal predecessors, (48), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-22 14:40:21,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:40:21,311 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-07-22 14:40:21,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-22 14:40:21,311 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 24 states have internal predecessors, (48), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 31 [2022-07-22 14:40:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:40:21,314 INFO L225 Difference]: With dead ends: 71 [2022-07-22 14:40:21,314 INFO L226 Difference]: Without dead ends: 61 [2022-07-22 14:40:21,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=484, Invalid=2486, Unknown=0, NotChecked=0, Total=2970 [2022-07-22 14:40:21,317 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 120 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 14:40:21,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 267 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 14:40:21,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-22 14:40:21,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2022-07-22 14:40:21,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 14:40:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2022-07-22 14:40:21,333 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 31 [2022-07-22 14:40:21,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:40:21,333 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-07-22 14:40:21,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 24 states have internal predecessors, (48), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-22 14:40:21,334 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-07-22 14:40:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 14:40:21,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:40:21,335 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:40:21,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:40:21,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-22 14:40:21,552 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:40:21,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:40:21,552 INFO L85 PathProgramCache]: Analyzing trace with hash -772238856, now seen corresponding path program 2 times [2022-07-22 14:40:21,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:40:21,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945815591] [2022-07-22 14:40:21,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:40:21,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:40:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:21,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:40:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:21,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 14:40:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:21,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 14:40:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:40:21,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:40:21,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945815591] [2022-07-22 14:40:21,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945815591] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:40:21,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869214909] [2022-07-22 14:40:21,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:40:21,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:40:21,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:40:21,844 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:40:21,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 14:40:21,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:40:21,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:40:21,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-22 14:40:21,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:40:22,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-22 14:40:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:40:22,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:40:22,584 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-22 14:40:22,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-07-22 14:40:22,649 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 14:40:22,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869214909] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:40:22,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:40:22,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 10] total 37 [2022-07-22 14:40:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639482574] [2022-07-22 14:40:22,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:40:22,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-22 14:40:22,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:40:22,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-22 14:40:22,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1164, Unknown=0, NotChecked=0, Total=1332 [2022-07-22 14:40:22,652 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 33 states have internal predecessors, (66), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-22 14:40:24,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:40:24,387 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-07-22 14:40:24,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-22 14:40:24,388 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 33 states have internal predecessors, (66), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 37 [2022-07-22 14:40:24,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:40:24,389 INFO L225 Difference]: With dead ends: 90 [2022-07-22 14:40:24,389 INFO L226 Difference]: Without dead ends: 85 [2022-07-22 14:40:24,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1387, Invalid=5753, Unknown=0, NotChecked=0, Total=7140 [2022-07-22 14:40:24,396 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 182 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 14:40:24,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 268 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 14:40:24,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-22 14:40:24,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 51. [2022-07-22 14:40:24,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 14:40:24,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-07-22 14:40:24,415 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 37 [2022-07-22 14:40:24,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:40:24,416 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-07-22 14:40:24,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 33 states have internal predecessors, (66), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-22 14:40:24,416 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-07-22 14:40:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-22 14:40:24,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:40:24,418 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:40:24,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 14:40:24,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:40:24,642 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:40:24,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:40:24,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1758737322, now seen corresponding path program 3 times [2022-07-22 14:40:24,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:40:24,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177856882] [2022-07-22 14:40:24,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:40:24,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:40:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:24,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:40:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:24,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 14:40:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:24,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 14:40:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 113 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:40:24,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:40:24,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177856882] [2022-07-22 14:40:24,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177856882] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:40:24,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312410904] [2022-07-22 14:40:24,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 14:40:24,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:40:24,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:40:24,935 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:40:24,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 14:40:25,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 14:40:25,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:40:25,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-22 14:40:25,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:40:25,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-07-22 14:40:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-22 14:40:25,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:40:25,759 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-22 14:40:25,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 31 [2022-07-22 14:40:26,044 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-22 14:40:26,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312410904] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:40:26,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:40:26,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 15] total 40 [2022-07-22 14:40:26,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572038] [2022-07-22 14:40:26,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:40:26,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-22 14:40:26,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:40:26,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-22 14:40:26,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1460, Unknown=0, NotChecked=0, Total=1560 [2022-07-22 14:40:26,050 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 40 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-22 14:40:29,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:40:29,490 INFO L93 Difference]: Finished difference Result 163 states and 183 transitions. [2022-07-22 14:40:29,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-22 14:40:29,491 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) Word has length 49 [2022-07-22 14:40:29,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:40:29,492 INFO L225 Difference]: With dead ends: 163 [2022-07-22 14:40:29,492 INFO L226 Difference]: Without dead ends: 117 [2022-07-22 14:40:29,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2752 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1116, Invalid=11316, Unknown=0, NotChecked=0, Total=12432 [2022-07-22 14:40:29,496 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 229 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-22 14:40:29,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 410 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 2017 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-22 14:40:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-22 14:40:29,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 49. [2022-07-22 14:40:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 43 states have internal predecessors, (45), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-22 14:40:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-07-22 14:40:29,507 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 49 [2022-07-22 14:40:29,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:40:29,508 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-07-22 14:40:29,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-22 14:40:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-07-22 14:40:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-22 14:40:29,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:40:29,510 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:40:29,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 14:40:29,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:40:29,711 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:40:29,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:40:29,712 INFO L85 PathProgramCache]: Analyzing trace with hash -290973603, now seen corresponding path program 1 times [2022-07-22 14:40:29,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:40:29,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695340642] [2022-07-22 14:40:29,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:40:29,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:40:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:29,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:40:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:29,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 14:40:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:29,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 14:40:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-22 14:40:29,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:40:29,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695340642] [2022-07-22 14:40:29,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695340642] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:40:29,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231376364] [2022-07-22 14:40:29,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:40:29,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:40:29,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:40:29,810 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:40:29,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 14:40:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:29,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 14:40:29,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:40:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-07-22 14:40:30,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:40:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-22 14:40:30,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231376364] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:40:30,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:40:30,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 30 [2022-07-22 14:40:30,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804579459] [2022-07-22 14:40:30,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:40:30,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-22 14:40:30,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:40:30,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-22 14:40:30,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2022-07-22 14:40:30,286 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 30 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 23 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-22 14:40:30,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:40:30,583 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-07-22 14:40:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 14:40:30,583 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 23 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 51 [2022-07-22 14:40:30,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:40:30,584 INFO L225 Difference]: With dead ends: 85 [2022-07-22 14:40:30,584 INFO L226 Difference]: Without dead ends: 47 [2022-07-22 14:40:30,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=1368, Unknown=0, NotChecked=0, Total=1560 [2022-07-22 14:40:30,586 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 64 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:40:30,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 281 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 14:40:30,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-22 14:40:30,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-07-22 14:40:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.048780487804878) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-22 14:40:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-07-22 14:40:30,606 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 51 [2022-07-22 14:40:30,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:40:30,607 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-07-22 14:40:30,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 23 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-22 14:40:30,607 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-07-22 14:40:30,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-22 14:40:30,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:40:30,608 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:40:30,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 14:40:30,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:40:30,812 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:40:30,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:40:30,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1067708707, now seen corresponding path program 2 times [2022-07-22 14:40:30,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:40:30,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35286588] [2022-07-22 14:40:30,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:40:30,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:40:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:30,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:40:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:30,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 14:40:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:30,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 14:40:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-22 14:40:30,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:40:30,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35286588] [2022-07-22 14:40:30,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35286588] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:40:30,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617249730] [2022-07-22 14:40:30,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:40:30,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:40:30,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:40:30,964 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:40:30,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 14:40:31,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:40:31,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:40:31,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-22 14:40:31,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:40:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-07-22 14:40:31,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:40:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-22 14:40:31,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617249730] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:40:31,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:40:31,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 25 [2022-07-22 14:40:31,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529560856] [2022-07-22 14:40:31,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:40:31,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-22 14:40:31,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:40:31,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-22 14:40:31,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2022-07-22 14:40:31,287 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 25 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-22 14:40:31,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:40:31,466 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-07-22 14:40:31,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 14:40:31,467 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-07-22 14:40:31,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:40:31,468 INFO L225 Difference]: With dead ends: 81 [2022-07-22 14:40:31,468 INFO L226 Difference]: Without dead ends: 47 [2022-07-22 14:40:31,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=859, Unknown=0, NotChecked=0, Total=992 [2022-07-22 14:40:31,469 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 48 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:40:31,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 155 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:40:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-22 14:40:31,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-07-22 14:40:31,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.048780487804878) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 14:40:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-07-22 14:40:31,476 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 51 [2022-07-22 14:40:31,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:40:31,476 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-07-22 14:40:31,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-22 14:40:31,476 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-07-22 14:40:31,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-22 14:40:31,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:40:31,477 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:40:31,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 14:40:31,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:40:31,698 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:40:31,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:40:31,698 INFO L85 PathProgramCache]: Analyzing trace with hash -644061985, now seen corresponding path program 3 times [2022-07-22 14:40:31,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:40:31,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083796820] [2022-07-22 14:40:31,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:40:31,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:40:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:32,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:40:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:32,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 14:40:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:32,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 14:40:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:40:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 122 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:40:32,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:40:32,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083796820] [2022-07-22 14:40:32,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083796820] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:40:32,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772416209] [2022-07-22 14:40:32,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 14:40:32,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:40:32,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:40:32,072 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:40:32,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 14:40:32,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 14:40:32,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:40:32,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-22 14:40:32,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:40:32,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 41 treesize of output 25 [2022-07-22 14:40:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-22 14:40:32,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:40:32,882 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-22 14:40:32,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 31 [2022-07-22 14:40:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-22 14:40:33,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772416209] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:40:33,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:40:33,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 11] total 44 [2022-07-22 14:40:33,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942530142] [2022-07-22 14:40:33,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:40:33,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-22 14:40:33,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:40:33,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-22 14:40:33,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1712, Unknown=0, NotChecked=0, Total=1892 [2022-07-22 14:40:33,031 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 44 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 40 states have internal predecessors, (78), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-22 14:40:34,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:40:34,590 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-07-22 14:40:34,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-22 14:40:34,592 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 40 states have internal predecessors, (78), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 51 [2022-07-22 14:40:34,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:40:34,592 INFO L225 Difference]: With dead ends: 47 [2022-07-22 14:40:34,592 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 14:40:34,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=939, Invalid=4173, Unknown=0, NotChecked=0, Total=5112 [2022-07-22 14:40:34,594 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 14:40:34,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 202 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 14:40:34,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 14:40:34,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 14:40:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:40:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 14:40:34,595 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2022-07-22 14:40:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:40:34,595 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 14:40:34,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 40 states have internal predecessors, (78), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-22 14:40:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 14:40:34,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 14:40:34,598 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 14:40:34,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-22 14:40:34,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:40:34,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 14:40:36,364 INFO L899 garLoopResultBuilder]: For program point get_dummyFINAL(lines 22 25) no Hoare annotation was computed. [2022-07-22 14:40:36,367 INFO L902 garLoopResultBuilder]: At program point get_dummyENTRY(lines 22 25) the Hoare annotation is: true [2022-07-22 14:40:36,367 INFO L899 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-07-22 14:40:36,367 INFO L899 garLoopResultBuilder]: For program point get_dummyEXIT(lines 22 25) no Hoare annotation was computed. [2022-07-22 14:40:36,368 INFO L895 garLoopResultBuilder]: At program point L35-2(line 35) the Hoare annotation is: (let ((.cse0 (= |~#d1~0.offset| 0))) (or (and (= |~#d1~0.offset| |ULTIMATE.start_main_~pd1~0#1.offset|) (= 4 |ULTIMATE.start_main_~pd1~0#1.base|) (= |~#d1~0.base| |ULTIMATE.start_main_~pd1~0#1.base|) .cse0 (<= 5 |~#d2~0.base|)) (and (= |~#d2~0.offset| |ULTIMATE.start_main_~pd1~0#1.offset|) (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (= 5 |ULTIMATE.start_main_~pd1~0#1.base|) (= 5 |~#d2~0.base|) .cse0))) [2022-07-22 14:40:36,368 INFO L899 garLoopResultBuilder]: For program point L37-4(lines 37 46) no Hoare annotation was computed. [2022-07-22 14:40:36,368 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 14:40:36,368 INFO L899 garLoopResultBuilder]: For program point L35-3(line 35) no Hoare annotation was computed. [2022-07-22 14:40:36,368 INFO L895 garLoopResultBuilder]: At program point L35-4(line 35) the Hoare annotation is: (let ((.cse1 (= |~#d1~0.base| 4)) (.cse2 (= 5 |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse3 (= 5 |~#d2~0.base|)) (.cse0 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse6 (= |ULTIMATE.start_main_~pd2~0#1.base| |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse4 (= 4 |ULTIMATE.start_main_~pd2~0#1.base|)) (.cse5 (= |~#d1~0.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~pd1~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (<= |ULTIMATE.start_main_~pd1~0#1.base| 4) .cse1 .cse5 (<= 5 |~#d2~0.base|) (<= 5 |ULTIMATE.start_main_~pd2~0#1.base|)) (and .cse0 (= |~#d2~0.offset| 0) .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~pd1~0#1.offset| |ULTIMATE.start_main_~pd2~0#1.offset|) .cse6 .cse5 .cse7) (and .cse0 (= |~#d1~0.offset| |ULTIMATE.start_main_~pd2~0#1.offset|) .cse6 .cse4 (= |~#d1~0.base| |ULTIMATE.start_main_~pd1~0#1.base|) .cse5 .cse7))) [2022-07-22 14:40:36,368 INFO L899 garLoopResultBuilder]: For program point L35-5(line 35) no Hoare annotation was computed. [2022-07-22 14:40:36,369 INFO L895 garLoopResultBuilder]: At program point L29(lines 27 30) the Hoare annotation is: (and (not (= |~#d1~0.base| |~#d2~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~pd2~0#1.base|) |ULTIMATE.start_main_~pd2~0#1.offset|) |ULTIMATE.start_main_~i~0#1|) (= |~#d1~0.base| 4) (<= 1 |ULTIMATE.start_check_#res#1|) (= |ULTIMATE.start_main_~pd1~0#1.offset| |ULTIMATE.start_main_~pd2~0#1.offset|) (= |ULTIMATE.start_main_~pd2~0#1.base| |ULTIMATE.start_main_~pd1~0#1.base|) (= |~#d1~0.offset| 0)) [2022-07-22 14:40:36,369 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 20) no Hoare annotation was computed. [2022-07-22 14:40:36,369 INFO L895 garLoopResultBuilder]: At program point L44(lines 33 52) the Hoare annotation is: false [2022-07-22 14:40:36,369 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2022-07-22 14:40:36,370 INFO L895 garLoopResultBuilder]: At program point L40-3(lines 40 42) the Hoare annotation is: (let ((.cse25 (+ 7 |ULTIMATE.start_main_~i~0#1|)) (.cse26 (+ 9 |ULTIMATE.start_main_~i~0#1|)) (.cse5 (select (select |#memory_int| |ULTIMATE.start_main_~pd2~0#1.base|) |ULTIMATE.start_main_~pd2~0#1.offset|))) (let ((.cse17 (< |ULTIMATE.start_main_~i~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~pa~0#1.base|) |ULTIMATE.start_main_~pa~0#1.offset|) 1))) (.cse24 (= .cse5 (+ |ULTIMATE.start_main_~i~0#1| 10))) (.cse19 (= .cse5 .cse26)) (.cse10 (= |~#d2~0.offset| 0)) (.cse12 (= 5 |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse13 (= 5 |~#d2~0.base|)) (.cse20 (<= .cse26 .cse5)) (.cse22 (<= .cse25 .cse5)) (.cse23 (= .cse5 .cse25)) (.cse1 (= |~#d1~0.offset| |ULTIMATE.start_main_~pd2~0#1.offset|)) (.cse2 (= 4 |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse3 (= 4 |ULTIMATE.start_main_~pd2~0#1.base|)) (.cse16 (+ 6 |ULTIMATE.start_main_~i~0#1|)) (.cse18 (= |ULTIMATE.start_main_~pa~0#1.base| |ULTIMATE.start_main_~pd2~0#1.base|)) (.cse21 (= .cse5 (+ |ULTIMATE.start_main_~i~0#1| 8))) (.cse0 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse11 (= |~#d1~0.base| 4)) (.cse14 (= |ULTIMATE.start_main_~pd1~0#1.offset| |ULTIMATE.start_main_~pd2~0#1.offset|)) (.cse15 (= |ULTIMATE.start_main_~pd2~0#1.base| |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse4 (= |~#d1~0.base| |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse6 (= |~#d1~0.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~pa~0#1.base| 4)) (.cse8 (= |ULTIMATE.start_main_~pd2~0#1.offset| |ULTIMATE.start_main_~pa~0#1.offset|)) (.cse9 (= |ULTIMATE.start_main_~pd1~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ 5 |ULTIMATE.start_main_~i~0#1|) .cse5) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= .cse5 .cse16) .cse17 .cse6 .cse18 .cse8 .cse9) (and .cse0 .cse19 .cse11 .cse14 .cse15 .cse6 .cse18 .cse20 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse6 .cse18 .cse21 .cse8 .cse9) (and .cse22 .cse23 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse6 .cse18 .cse8 .cse9) (and .cse0 .cse11 .cse14 .cse15 (= (+ 3 |ULTIMATE.start_main_~i~0#1|) .cse5) .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse6 .cse18 .cse8 .cse9) (and .cse0 (= .cse5 (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse11 .cse14 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse6 .cse7 (<= (select (select |#memory_int| 4) 0) |ULTIMATE.start_main_~i~0#1|) .cse8 .cse9) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse6 .cse18 .cse20 .cse8 .cse9) (and .cse0 (= .cse5 (+ 2 |ULTIMATE.start_main_~i~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse22 .cse23 .cse11 .cse14 .cse15 .cse6 .cse18 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (= .cse5 .cse16) .cse8 .cse9) (and .cse0 .cse11 .cse14 .cse15 .cse6 .cse18 .cse7 .cse21 .cse8 .cse9) (and .cse0 .cse11 .cse14 .cse15 .cse4 (= (+ |ULTIMATE.start_main_~i~0#1| 4) .cse5) .cse6 .cse7 .cse8 .cse9)))) [2022-07-22 14:40:36,370 INFO L899 garLoopResultBuilder]: For program point L40-4(lines 40 42) no Hoare annotation was computed. [2022-07-22 14:40:36,370 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 14:40:36,370 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 14:40:36,370 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 14:40:36,370 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2022-07-22 14:40:36,370 INFO L902 garLoopResultBuilder]: At program point L51(lines 32 52) the Hoare annotation is: true [2022-07-22 14:40:36,371 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2022-07-22 14:40:36,371 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-07-22 14:40:36,371 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (and (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (= 5 |~#d2~0.base|) (= |~#d1~0.offset| 0)) [2022-07-22 14:40:36,371 INFO L899 garLoopResultBuilder]: For program point L37-2(lines 37 46) no Hoare annotation was computed. [2022-07-22 14:40:36,371 INFO L899 garLoopResultBuilder]: For program point L35-1(line 35) no Hoare annotation was computed. [2022-07-22 14:40:36,373 INFO L356 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1] [2022-07-22 14:40:36,375 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 14:40:36,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 02:40:36 BoogieIcfgContainer [2022-07-22 14:40:36,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 14:40:36,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 14:40:36,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 14:40:36,406 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 14:40:36,406 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:40:17" (3/4) ... [2022-07-22 14:40:36,409 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 14:40:36,414 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2022-07-22 14:40:36,418 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-07-22 14:40:36,418 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-22 14:40:36,419 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 14:40:36,419 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 14:40:36,439 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(d1 == d2) && unknown-#memory_int-unknown[pd2][pd2] == i) && d1 == 4) && 1 <= \result) && pd1 == pd2) && pd2 == pd1) && d1 == 0 [2022-07-22 14:40:36,454 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 14:40:36,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 14:40:36,455 INFO L158 Benchmark]: Toolchain (without parser) took 19625.71ms. Allocated memory was 92.3MB in the beginning and 176.2MB in the end (delta: 83.9MB). Free memory was 59.4MB in the beginning and 49.7MB in the end (delta: 9.7MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2022-07-22 14:40:36,455 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 92.3MB. Free memory was 48.5MB in the beginning and 48.5MB in the end (delta: 39.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:40:36,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.37ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 59.2MB in the beginning and 96.8MB in the end (delta: -37.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 14:40:36,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.40ms. Allocated memory is still 121.6MB. Free memory was 96.2MB in the beginning and 95.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:40:36,456 INFO L158 Benchmark]: Boogie Preprocessor took 19.83ms. Allocated memory is still 121.6MB. Free memory was 95.1MB in the beginning and 93.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:40:36,456 INFO L158 Benchmark]: RCFGBuilder took 372.67ms. Allocated memory is still 121.6MB. Free memory was 93.5MB in the beginning and 82.5MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 14:40:36,457 INFO L158 Benchmark]: TraceAbstraction took 18917.90ms. Allocated memory was 121.6MB in the beginning and 176.2MB in the end (delta: 54.5MB). Free memory was 81.5MB in the beginning and 52.9MB in the end (delta: 28.7MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2022-07-22 14:40:36,457 INFO L158 Benchmark]: Witness Printer took 48.85ms. Allocated memory is still 176.2MB. Free memory was 52.9MB in the beginning and 49.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 14:40:36,459 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 92.3MB. Free memory was 48.5MB in the beginning and 48.5MB in the end (delta: 39.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.37ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 59.2MB in the beginning and 96.8MB in the end (delta: -37.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.40ms. Allocated memory is still 121.6MB. Free memory was 96.2MB in the beginning and 95.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.83ms. Allocated memory is still 121.6MB. Free memory was 95.1MB in the beginning and 93.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 372.67ms. Allocated memory is still 121.6MB. Free memory was 93.5MB in the beginning and 82.5MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18917.90ms. Allocated memory was 121.6MB in the beginning and 176.2MB in the end (delta: 54.5MB). Free memory was 81.5MB in the beginning and 52.9MB in the end (delta: 28.7MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. * Witness Printer took 48.85ms. Allocated memory is still 176.2MB. Free memory was 52.9MB in the beginning and 49.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 50]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 8, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 692 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 678 mSDsluCounter, 1691 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1538 mSDsCounter, 479 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4283 IncrementalHoareTripleChecker+Invalid, 4762 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 479 mSolverCounterUnsat, 153 mSDtfsCounter, 4283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 932 GetRequests, 520 SyntacticMatches, 2 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6143 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=4, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 125 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 45 NumberOfFragments, 843 HoareAnnotationTreeSize, 14 FomulaSimplifications, 170 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 8539 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 626 NumberOfCodeBlocks, 592 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 903 ConstructedInterpolants, 0 QuantifiedInterpolants, 4606 SizeOfPredicates, 83 NumberOfNonLiveVariables, 1398 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 1436/1848 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(d1 == d2) && d1 == pd2) && 4 == pd1) && 4 == pd2) && d1 == pd1) && 5 + i == unknown-#memory_int-unknown[pd2][pd2]) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0) || (((((((((((d2 == 0 && d1 == 4) && 5 == pd1) && 5 == d2) && pd1 == pd2) && pd2 == pd1) && unknown-#memory_int-unknown[pd2][pd2] <= 6 + i) && i < unknown-#memory_int-unknown[pa][pa] + 1) && d1 == 0) && pa == pd2) && pd2 == pa) && pd1 == 0)) || ((((((((((!(d1 == d2) && unknown-#memory_int-unknown[pd2][pd2] == 9 + i) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && 9 + i <= unknown-#memory_int-unknown[pd2][pd2]) && pa == 4) && pd2 == pa) && pd1 == 0)) || ((((((((((d2 == 0 && d1 == 4) && 5 == pd1) && 5 == d2) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && unknown-#memory_int-unknown[pd2][pd2] == i + 8) && pd2 == pa) && pd1 == 0)) || (((((((((((7 + i <= unknown-#memory_int-unknown[pd2][pd2] && unknown-#memory_int-unknown[pd2][pd2] == 7 + i) && d2 == 0) && d1 == 4) && 5 == pd1) && 5 == d2) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && 3 + i == unknown-#memory_int-unknown[pd2][pd2]) && d1 == pd1) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0)) || ((((((((((unknown-#memory_int-unknown[pd2][pd2] == i + 10 && d2 == 0) && d1 == 4) && 5 == pd1) && 5 == d2) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && unknown-#memory_int-unknown[pd2][pd2] == i + 1) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && d1 == pd1) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0)) || ((((((((((!(d1 == d2) && d1 == pd2) && 4 == pd1) && 4 == pd2) && i < unknown-#memory_int-unknown[pa][pa] + 1) && d1 == pd1) && d1 == 0) && pa == 4) && unknown-#memory_int-unknown[4][0] <= i) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && unknown-#memory_int-unknown[pd2][pd2] == i + 10) && d1 == pd2) && 4 == pd1) && 4 == pd2) && d1 == pd1) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0)) || (((((((((((unknown-#memory_int-unknown[pd2][pd2] == 9 + i && d2 == 0) && d1 == 4) && 5 == pd1) && 5 == d2) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && 9 + i <= unknown-#memory_int-unknown[pd2][pd2]) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && unknown-#memory_int-unknown[pd2][pd2] == 2 + i) && d1 == pd2) && 4 == pd1) && 4 == pd2) && d1 == pd1) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0)) || ((((((((((!(d1 == d2) && 7 + i <= unknown-#memory_int-unknown[pd2][pd2]) && unknown-#memory_int-unknown[pd2][pd2] == 7 + i) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && pa == 4) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && d1 == pd2) && 4 == pd1) && 4 == pd2) && d1 == pd1) && d1 == 0) && pa == 4) && unknown-#memory_int-unknown[pd2][pd2] == 6 + i) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && pa == 4) && unknown-#memory_int-unknown[pd2][pd2] == i + 8) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && d1 == pd1) && i + 4 == unknown-#memory_int-unknown[pd2][pd2]) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((!(d1 == d2) && unknown-#memory_int-unknown[pd2][pd2] == i) && d1 == 4) && 1 <= \result) && pd1 == pd2) && pd2 == pd1) && d1 == 0 RESULT: Ultimate proved your program to be correct! [2022-07-22 14:40:36,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE