./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_add-2.i --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-sets/test_add-2.i -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 b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:48:02,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:48:02,667 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:48:02,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:48:02,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:48:02,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:48:02,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:48:02,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:48:02,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:48:02,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:48:02,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:48:02,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:48:02,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:48:02,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:48:02,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:48:02,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:48:02,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:48:02,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:48:02,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:48:02,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:48:02,726 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:48:02,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:48:02,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:48:02,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:48:02,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:48:02,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:48:02,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:48:02,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:48:02,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:48:02,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:48:02,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:48:02,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:48:02,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:48:02,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:48:02,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:48:02,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:48:02,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:48:02,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:48:02,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:48:02,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:48:02,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:48:02,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:48:02,740 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:48:02,765 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:48:02,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:48:02,766 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:48:02,766 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:48:02,767 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:48:02,767 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:48:02,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:48:02,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:48:02,768 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:48:02,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:48:02,769 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:48:02,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:48:02,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:48:02,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:48:02,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:48:02,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:48:02,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:48:02,769 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:48:02,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:48:02,770 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:48:02,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:48:02,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:48:02,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:48:02,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:48:02,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:48:02,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:48:02,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:48:02,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:48:02,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:48:02,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:48:02,771 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:48:02,772 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:48:02,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:48:02,772 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 -> b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff [2022-07-22 14:48:02,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:48:02,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:48:02,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:48:02,964 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:48:02,965 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:48:02,966 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_add-2.i [2022-07-22 14:48:03,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c9501f9e/1d5e71a12721490bb8012028b35cf284/FLAG497925673 [2022-07-22 14:48:03,423 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:48:03,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i [2022-07-22 14:48:03,435 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c9501f9e/1d5e71a12721490bb8012028b35cf284/FLAG497925673 [2022-07-22 14:48:03,446 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c9501f9e/1d5e71a12721490bb8012028b35cf284 [2022-07-22 14:48:03,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:48:03,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:48:03,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:48:03,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:48:03,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:48:03,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:48:03" (1/1) ... [2022-07-22 14:48:03,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18ddb537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:03, skipping insertion in model container [2022-07-22 14:48:03,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:48:03" (1/1) ... [2022-07-22 14:48:03,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:48:03,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:48:03,733 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-sets/test_add-2.i[25793,25806] [2022-07-22 14:48:03,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:48:03,739 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:48:03,792 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-sets/test_add-2.i[25793,25806] [2022-07-22 14:48:03,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:48:03,825 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:48:03,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:03 WrapperNode [2022-07-22 14:48:03,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:48:03,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:48:03,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:48:03,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:48:03,835 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:48:03" (1/1) ... [2022-07-22 14:48:03,861 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:48:03" (1/1) ... [2022-07-22 14:48:03,878 INFO L137 Inliner]: procedures = 135, calls = 46, calls flagged for inlining = 11, calls inlined = 7, statements flattened = 55 [2022-07-22 14:48:03,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:48:03,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:48:03,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:48:03,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:48:03,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:03" (1/1) ... [2022-07-22 14:48:03,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:03" (1/1) ... [2022-07-22 14:48:03,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:03" (1/1) ... [2022-07-22 14:48:03,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:03" (1/1) ... [2022-07-22 14:48:03,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:03" (1/1) ... [2022-07-22 14:48:03,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:03" (1/1) ... [2022-07-22 14:48:03,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:03" (1/1) ... [2022-07-22 14:48:03,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:48:03,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:48:03,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:48:03,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:48:03,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:03" (1/1) ... [2022-07-22 14:48:03,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:48:03,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:48:03,960 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:48:03,969 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:48:03,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 14:48:03,989 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-22 14:48:03,989 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-22 14:48:03,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 14:48:03,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:48:03,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:48:03,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:48:03,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2022-07-22 14:48:03,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2022-07-22 14:48:03,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:48:03,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 14:48:03,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:48:03,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:48:03,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:48:04,105 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:48:04,106 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:48:04,239 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:48:04,243 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:48:04,243 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 14:48:04,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:48:04 BoogieIcfgContainer [2022-07-22 14:48:04,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:48:04,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:48:04,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:48:04,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:48:04,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:48:03" (1/3) ... [2022-07-22 14:48:04,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638c9876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:48:04, skipping insertion in model container [2022-07-22 14:48:04,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:03" (2/3) ... [2022-07-22 14:48:04,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638c9876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:48:04, skipping insertion in model container [2022-07-22 14:48:04,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:48:04" (3/3) ... [2022-07-22 14:48:04,253 INFO L111 eAbstractionObserver]: Analyzing ICFG test_add-2.i [2022-07-22 14:48:04,263 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:48:04,263 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:48:04,294 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:48:04,299 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@66cb9996, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62df59c8 [2022-07-22 14:48:04,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:48:04,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:48:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 14:48:04,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:48:04,313 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:48:04,319 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:48:04,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:48:04,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1019691704, now seen corresponding path program 1 times [2022-07-22 14:48:04,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:48:04,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926447024] [2022-07-22 14:48:04,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:48:04,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:48:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:04,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:48:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:04,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 14:48:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 14:48:04,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:48:04,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926447024] [2022-07-22 14:48:04,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926447024] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:48:04,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:48:04,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:48:04,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423358980] [2022-07-22 14:48:04,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:48:04,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:48:04,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:48:04,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:48:04,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:48:04,485 INFO L87 Difference]: Start difference. First operand has 31 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:48:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:48:04,498 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-07-22 14:48:04,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:48:04,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-07-22 14:48:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:48:04,505 INFO L225 Difference]: With dead ends: 59 [2022-07-22 14:48:04,505 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 14:48:04,507 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:48:04,509 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:48:04,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:48:04,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 14:48:04,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-22 14:48:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:48:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-22 14:48:04,531 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 20 [2022-07-22 14:48:04,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:48:04,532 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-22 14:48:04,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:48:04,533 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-22 14:48:04,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 14:48:04,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:48:04,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:48:04,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:48:04,536 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:48:04,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:48:04,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1544963960, now seen corresponding path program 1 times [2022-07-22 14:48:04,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:48:04,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181969245] [2022-07-22 14:48:04,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:48:04,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:48:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:04,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:48:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:04,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 14:48:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:48:04,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:48:04,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181969245] [2022-07-22 14:48:04,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181969245] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:48:04,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858724740] [2022-07-22 14:48:04,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:48:04,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:48:04,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:48:04,655 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:48:04,675 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:48:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:04,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 14:48:04,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:48:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:48:04,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:48:04,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858724740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:48:04,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 14:48:04,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-07-22 14:48:04,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503426941] [2022-07-22 14:48:04,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:48:04,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:48:04,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:48:04,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:48:04,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:48:04,763 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:48:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:48:04,778 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-07-22 14:48:04,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:48:04,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-07-22 14:48:04,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:48:04,780 INFO L225 Difference]: With dead ends: 44 [2022-07-22 14:48:04,781 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 14:48:04,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:48:04,782 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:48:04,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:48:04,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 14:48:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-22 14:48:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-22 14:48:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-07-22 14:48:04,787 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2022-07-22 14:48:04,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:48:04,788 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-07-22 14:48:04,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:48:04,788 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-07-22 14:48:04,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 14:48:04,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:48:04,789 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:48:04,806 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:48:05,003 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:48:05,004 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:48:05,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:48:05,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1439032465, now seen corresponding path program 1 times [2022-07-22 14:48:05,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:48:05,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542271512] [2022-07-22 14:48:05,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:48:05,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:48:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:05,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:48:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:05,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 14:48:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:48:05,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:48:05,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542271512] [2022-07-22 14:48:05,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542271512] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:48:05,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533088515] [2022-07-22 14:48:05,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:48:05,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:48:05,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:48:05,209 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:48:05,254 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:48:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:05,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-22 14:48:05,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:48:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:48:05,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:48:05,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533088515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:48:05,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 14:48:05,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2022-07-22 14:48:05,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90887166] [2022-07-22 14:48:05,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:48:05,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 14:48:05,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:48:05,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 14:48:05,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-22 14:48:05,442 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:48:05,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:48:05,608 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-07-22 14:48:05,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 14:48:05,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-07-22 14:48:05,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:48:05,609 INFO L225 Difference]: With dead ends: 74 [2022-07-22 14:48:05,609 INFO L226 Difference]: Without dead ends: 34 [2022-07-22 14:48:05,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-07-22 14:48:05,611 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:48:05,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:48:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-22 14:48:05,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-07-22 14:48:05,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:48:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-07-22 14:48:05,615 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 20 [2022-07-22 14:48:05,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:48:05,616 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-07-22 14:48:05,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:48:05,616 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-07-22 14:48:05,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 14:48:05,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:48:05,617 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:48:05,653 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:48:05,833 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:48:05,834 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:48:05,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:48:05,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1950106983, now seen corresponding path program 1 times [2022-07-22 14:48:05,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:48:05,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626858705] [2022-07-22 14:48:05,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:48:05,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:48:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:05,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:48:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:06,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 14:48:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:06,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 14:48:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:48:06,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:48:06,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626858705] [2022-07-22 14:48:06,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626858705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:48:06,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:48:06,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 14:48:06,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28206567] [2022-07-22 14:48:06,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:48:06,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 14:48:06,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:48:06,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 14:48:06,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-22 14:48:06,096 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:48:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:48:06,412 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-07-22 14:48:06,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 14:48:06,412 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-07-22 14:48:06,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:48:06,413 INFO L225 Difference]: With dead ends: 44 [2022-07-22 14:48:06,413 INFO L226 Difference]: Without dead ends: 37 [2022-07-22 14:48:06,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-07-22 14:48:06,414 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 97 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:48:06,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 66 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:48:06,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-22 14:48:06,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-07-22 14:48:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:48:06,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-07-22 14:48:06,418 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2022-07-22 14:48:06,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:48:06,418 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-07-22 14:48:06,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:48:06,418 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-07-22 14:48:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 14:48:06,419 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:48:06,419 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:48:06,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 14:48:06,421 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:48:06,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:48:06,422 INFO L85 PathProgramCache]: Analyzing trace with hash -375503678, now seen corresponding path program 1 times [2022-07-22 14:48:06,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:48:06,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309463039] [2022-07-22 14:48:06,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:48:06,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:48:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:06,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:48:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:06,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 14:48:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:06,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 14:48:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 14:48:06,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:48:06,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309463039] [2022-07-22 14:48:06,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309463039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:48:06,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:48:06,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 14:48:06,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420935406] [2022-07-22 14:48:06,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:48:06,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:48:06,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:48:06,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:48:06,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:48:06,479 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 14:48:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:48:06,528 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-07-22 14:48:06,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:48:06,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-22 14:48:06,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:48:06,546 INFO L225 Difference]: With dead ends: 39 [2022-07-22 14:48:06,546 INFO L226 Difference]: Without dead ends: 33 [2022-07-22 14:48:06,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:48:06,547 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:48:06,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 69 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:48:06,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-22 14:48:06,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-22 14:48:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:48:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-07-22 14:48:06,551 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2022-07-22 14:48:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:48:06,551 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-07-22 14:48:06,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 14:48:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-07-22 14:48:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 14:48:06,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:48:06,552 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:48:06,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 14:48:06,552 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:48:06,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:48:06,553 INFO L85 PathProgramCache]: Analyzing trace with hash -714160700, now seen corresponding path program 1 times [2022-07-22 14:48:06,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:48:06,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66918058] [2022-07-22 14:48:06,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:48:06,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:48:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:06,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 14:48:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:06,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 14:48:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:06,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 14:48:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 14:48:07,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:48:07,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66918058] [2022-07-22 14:48:07,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66918058] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:48:07,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268019185] [2022-07-22 14:48:07,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:48:07,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:48:07,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:48:07,145 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:48:07,195 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:48:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:07,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-22 14:48:07,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:48:07,620 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:48:07,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:48:07,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:48:07,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:48:07,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:48:07,835 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 7 treesize of output 3 [2022-07-22 14:48:07,842 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 7 treesize of output 3 [2022-07-22 14:48:08,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:48:08,066 INFO L356 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2022-07-22 14:48:08,067 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-22 14:48:08,088 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:48:08,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:48:08,288 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_old(#memory_$Pointer$.base)_AFTER_CALL_1| input size 70 context size 70 output size 70 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:298) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:284) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 14:48:08,292 INFO L158 Benchmark]: Toolchain (without parser) took 4843.47ms. Allocated memory was 121.6MB in the beginning and 167.8MB in the end (delta: 46.1MB). Free memory was 82.6MB in the beginning and 125.4MB in the end (delta: -42.8MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2022-07-22 14:48:08,292 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory was 100.5MB in the beginning and 100.4MB in the end (delta: 72.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:48:08,292 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.77ms. Allocated memory is still 121.6MB. Free memory was 82.4MB in the beginning and 86.9MB in the end (delta: -4.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 14:48:08,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.59ms. Allocated memory is still 121.6MB. Free memory was 86.9MB in the beginning and 85.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:48:08,293 INFO L158 Benchmark]: Boogie Preprocessor took 44.85ms. Allocated memory is still 121.6MB. Free memory was 85.2MB in the beginning and 83.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:48:08,293 INFO L158 Benchmark]: RCFGBuilder took 320.03ms. Allocated memory is still 121.6MB. Free memory was 83.3MB in the beginning and 70.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 14:48:08,293 INFO L158 Benchmark]: TraceAbstraction took 4044.37ms. Allocated memory was 121.6MB in the beginning and 167.8MB in the end (delta: 46.1MB). Free memory was 70.1MB in the beginning and 125.4MB in the end (delta: -55.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:48:08,294 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.15ms. Allocated memory is still 121.6MB. Free memory was 100.5MB in the beginning and 100.4MB in the end (delta: 72.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.77ms. Allocated memory is still 121.6MB. Free memory was 82.4MB in the beginning and 86.9MB in the end (delta: -4.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.59ms. Allocated memory is still 121.6MB. Free memory was 86.9MB in the beginning and 85.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.85ms. Allocated memory is still 121.6MB. Free memory was 85.2MB in the beginning and 83.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 320.03ms. Allocated memory is still 121.6MB. Free memory was 83.3MB in the beginning and 70.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4044.37ms. Allocated memory was 121.6MB in the beginning and 167.8MB in the end (delta: 46.1MB). Free memory was 70.1MB in the beginning and 125.4MB in the end (delta: -55.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_old(#memory_$Pointer$.base)_AFTER_CALL_1| input size 70 context size 70 output size 70 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_old(#memory_$Pointer$.base)_AFTER_CALL_1| input size 70 context size 70 output size 70: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 14:48:08,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-sets/test_add-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:48:10,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:48:10,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:48:10,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:48:10,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:48:10,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:48:10,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:48:10,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:48:10,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:48:10,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:48:10,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:48:10,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:48:10,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:48:10,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:48:10,127 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:48:10,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:48:10,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:48:10,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:48:10,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:48:10,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:48:10,137 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:48:10,138 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:48:10,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:48:10,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:48:10,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:48:10,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:48:10,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:48:10,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:48:10,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:48:10,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:48:10,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:48:10,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:48:10,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:48:10,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:48:10,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:48:10,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:48:10,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:48:10,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:48:10,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:48:10,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:48:10,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:48:10,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:48:10,162 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 14:48:10,187 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:48:10,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:48:10,188 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:48:10,188 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:48:10,189 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:48:10,189 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:48:10,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:48:10,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:48:10,190 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:48:10,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:48:10,190 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:48:10,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:48:10,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:48:10,191 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:48:10,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:48:10,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:48:10,191 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 14:48:10,191 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 14:48:10,192 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 14:48:10,192 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:48:10,192 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:48:10,192 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:48:10,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:48:10,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:48:10,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:48:10,193 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:48:10,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:48:10,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:48:10,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:48:10,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:48:10,193 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 14:48:10,194 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 14:48:10,194 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:48:10,194 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:48:10,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:48:10,194 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 14:48:10,194 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> b0bf6ee66b233cfe70507a3d8d55aa219725b8ce14e12bc2fdcf83f18b236eff [2022-07-22 14:48:10,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:48:10,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:48:10,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:48:10,489 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:48:10,489 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:48:10,490 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_add-2.i [2022-07-22 14:48:10,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ff34f7bf/009303aff0d44ddf9145c6cbc65b8a1a/FLAGd1b9d89ac [2022-07-22 14:48:10,911 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:48:10,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i [2022-07-22 14:48:10,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ff34f7bf/009303aff0d44ddf9145c6cbc65b8a1a/FLAGd1b9d89ac [2022-07-22 14:48:11,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ff34f7bf/009303aff0d44ddf9145c6cbc65b8a1a [2022-07-22 14:48:11,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:48:11,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:48:11,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:48:11,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:48:11,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:48:11,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:48:11" (1/1) ... [2022-07-22 14:48:11,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cfae06c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:11, skipping insertion in model container [2022-07-22 14:48:11,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:48:11" (1/1) ... [2022-07-22 14:48:11,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:48:11,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:48:11,618 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-sets/test_add-2.i[25793,25806] [2022-07-22 14:48:11,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:48:11,637 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-22 14:48:11,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:48:11,692 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-sets/test_add-2.i[25793,25806] [2022-07-22 14:48:11,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:48:11,696 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:48:11,738 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-sets/test_add-2.i[25793,25806] [2022-07-22 14:48:11,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:48:11,777 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:48:11,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:11 WrapperNode [2022-07-22 14:48:11,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:48:11,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:48:11,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:48:11,779 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:48:11,783 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:48:11" (1/1) ... [2022-07-22 14:48:11,812 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:48:11" (1/1) ... [2022-07-22 14:48:11,831 INFO L137 Inliner]: procedures = 138, calls = 46, calls flagged for inlining = 11, calls inlined = 7, statements flattened = 53 [2022-07-22 14:48:11,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:48:11,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:48:11,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:48:11,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:48:11,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:11" (1/1) ... [2022-07-22 14:48:11,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:11" (1/1) ... [2022-07-22 14:48:11,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:11" (1/1) ... [2022-07-22 14:48:11,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:11" (1/1) ... [2022-07-22 14:48:11,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:11" (1/1) ... [2022-07-22 14:48:11,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:11" (1/1) ... [2022-07-22 14:48:11,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:11" (1/1) ... [2022-07-22 14:48:11,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:48:11,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:48:11,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:48:11,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:48:11,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:11" (1/1) ... [2022-07-22 14:48:11,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:48:11,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:48:11,946 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:48:11,965 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:48:11,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-22 14:48:11,977 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-22 14:48:11,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-22 14:48:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:48:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:48:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:48:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2022-07-22 14:48:11,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2022-07-22 14:48:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:48:11,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 14:48:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 14:48:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 14:48:11,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:48:11,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:48:12,108 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:48:12,109 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:48:12,311 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:48:12,315 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:48:12,315 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 14:48:12,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:48:12 BoogieIcfgContainer [2022-07-22 14:48:12,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:48:12,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:48:12,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:48:12,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:48:12,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:48:11" (1/3) ... [2022-07-22 14:48:12,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c74806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:48:12, skipping insertion in model container [2022-07-22 14:48:12,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:48:11" (2/3) ... [2022-07-22 14:48:12,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c74806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:48:12, skipping insertion in model container [2022-07-22 14:48:12,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:48:12" (3/3) ... [2022-07-22 14:48:12,320 INFO L111 eAbstractionObserver]: Analyzing ICFG test_add-2.i [2022-07-22 14:48:12,329 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:48:12,329 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:48:12,369 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:48:12,376 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@31e658c0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@666d87f9 [2022-07-22 14:48:12,376 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:48:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:48:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 14:48:12,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:48:12,388 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:48:12,389 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:48:12,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:48:12,395 INFO L85 PathProgramCache]: Analyzing trace with hash -313984218, now seen corresponding path program 1 times [2022-07-22 14:48:12,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:48:12,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24217984] [2022-07-22 14:48:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:48:12,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:48:12,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:48:12,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:48:12,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-22 14:48:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:12,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 14:48:12,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:48:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:48:12,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:48:12,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:48:12,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24217984] [2022-07-22 14:48:12,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24217984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:48:12,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:48:12,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:48:12,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275694422] [2022-07-22 14:48:12,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:48:12,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:48:12,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:48:12,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:48:12,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:48:12,592 INFO L87 Difference]: Start difference. First operand has 29 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:48:12,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:48:12,609 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-07-22 14:48:12,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:48:12,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-07-22 14:48:12,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:48:12,616 INFO L225 Difference]: With dead ends: 55 [2022-07-22 14:48:12,616 INFO L226 Difference]: Without dead ends: 25 [2022-07-22 14:48:12,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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:48:12,628 INFO L413 NwaCegarLoop]: 32 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, 32 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:48:12,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:48:12,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-22 14:48:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-22 14:48:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:48:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-07-22 14:48:12,654 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-07-22 14:48:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:48:12,655 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-22 14:48:12,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:48:12,655 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-07-22 14:48:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 14:48:12,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:48:12,656 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:48:12,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-22 14:48:12,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:48:12,863 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:48:12,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:48:12,864 INFO L85 PathProgramCache]: Analyzing trace with hash 160343226, now seen corresponding path program 1 times [2022-07-22 14:48:12,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:48:12,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512608955] [2022-07-22 14:48:12,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:48:12,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:48:12,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:48:12,870 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:48:12,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-22 14:48:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:12,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 14:48:12,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:48:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:48:12,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:48:12,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:48:12,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512608955] [2022-07-22 14:48:12,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512608955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:48:12,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:48:12,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:48:12,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297600230] [2022-07-22 14:48:12,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:48:12,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:48:12,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:48:12,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:48:12,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:48:12,964 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:48:12,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:48:12,994 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-07-22 14:48:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:48:12,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-07-22 14:48:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:48:12,997 INFO L225 Difference]: With dead ends: 40 [2022-07-22 14:48:12,997 INFO L226 Difference]: Without dead ends: 28 [2022-07-22 14:48:12,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:48:12,998 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:48:13,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:48:13,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-22 14:48:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-22 14:48:13,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-22 14:48:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-22 14:48:13,009 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2022-07-22 14:48:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:48:13,009 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-22 14:48:13,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:48:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-22 14:48:13,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 14:48:13,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:48:13,011 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:48:13,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:48:13,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:48:13,221 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:48:13,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:48:13,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1203047025, now seen corresponding path program 1 times [2022-07-22 14:48:13,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:48:13,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895313790] [2022-07-22 14:48:13,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:48:13,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:48:13,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:48:13,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:48:13,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-22 14:48:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:13,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-22 14:48:13,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:48:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:48:13,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:48:13,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:48:13,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895313790] [2022-07-22 14:48:13,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895313790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:48:13,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:48:13,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 14:48:13,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883746727] [2022-07-22 14:48:13,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:48:13,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 14:48:13,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:48:13,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 14:48:13,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:48:13,525 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:48:13,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:48:13,879 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-07-22 14:48:13,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 14:48:13,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-07-22 14:48:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:48:13,880 INFO L225 Difference]: With dead ends: 69 [2022-07-22 14:48:13,880 INFO L226 Difference]: Without dead ends: 32 [2022-07-22 14:48:13,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-07-22 14:48:13,882 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 33 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:48:13,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 95 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 14:48:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-22 14:48:13,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-07-22 14:48:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:48:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-07-22 14:48:13,886 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 18 [2022-07-22 14:48:13,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:48:13,886 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-07-22 14:48:13,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 14:48:13,886 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-07-22 14:48:13,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 14:48:13,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:48:13,887 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:48:13,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-22 14:48:14,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:48:14,087 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:48:14,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:48:14,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1209896972, now seen corresponding path program 1 times [2022-07-22 14:48:14,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:48:14,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227380385] [2022-07-22 14:48:14,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:48:14,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:48:14,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:48:14,094 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:48:14,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-22 14:48:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:14,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-22 14:48:14,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:48:14,390 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:48:14,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-22 14:48:14,687 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-22 14:48:14,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-07-22 14:48:14,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:48:14,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:48:14,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:48:15,326 INFO L356 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2022-07-22 14:48:15,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 39 [2022-07-22 14:48:15,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:48:15,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:15,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:15,407 INFO L356 Elim1Store]: treesize reduction 49, result has 33.8 percent of original size [2022-07-22 14:48:15,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 258 treesize of output 372 [2022-07-22 14:48:15,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:48:15,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:48:15,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:48:15,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:15,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:15,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:15,566 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-22 14:48:15,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 121 treesize of output 114 [2022-07-22 14:48:16,104 WARN L855 $PredicateComparison]: unable to prove that (and (= c_ldv_is_in_set_~s.base |c_ldv_is_in_set_#in~s.base|) (= (select (select |c_#memory_$Pointer$.base| c_ldv_is_in_set_~s.base) |c_ldv_is_in_set_#in~s.offset|) c_ldv_is_in_set_~m~1.base) (or (exists ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (__ldv_list_add_~next.base (_ BitVec 32)) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_DerPreprocessor_11 |c_~#s1~0.offset|))) (let ((.cse1 (store (store (store (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_9) .cse0 v_DerPreprocessor_10) |c_~#s1~0.base| v_DerPreprocessor_11) __ldv_list_add_~next.base v_DerPreprocessor_9) .cse0 v_DerPreprocessor_10) |c_~#s1~0.base| v_DerPreprocessor_11))) (let ((.cse2 (select .cse1 __ldv_list_add_~next.base))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| |c_~#s1~0.base|) |c_~#s1~0.offset|)) (= (select |c_#memory_$Pointer$.base| .cse0) (select .cse1 .cse0)) (not (= |c_~#s1~0.base| .cse0)) (= .cse2 v_DerPreprocessor_9) (= (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base) .cse2) (not (= |c_~#s1~0.base| __ldv_list_add_~next.base))))))) (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select v_DerPreprocessor_6 |c_~#s1~0.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse3))) (and (= .cse3 (select v_DerPreprocessor_7 |c_~#s1~0.offset|)) (= (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_~#s1~0.base| v_DerPreprocessor_7) .cse3 v_DerPreprocessor_8) |c_~#s1~0.base| v_DerPreprocessor_7) .cse3 v_DerPreprocessor_8) |c_~#s1~0.base| v_DerPreprocessor_7) .cse3) .cse4) (= .cse4 (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_~#s1~0.base| v_DerPreprocessor_6) .cse3 v_DerPreprocessor_5) |c_~#s1~0.base| v_DerPreprocessor_6) .cse3 v_DerPreprocessor_5) |c_~#s1~0.base| v_DerPreprocessor_6) .cse3)) (= .cse3 (select (select |c_#memory_$Pointer$.base| |c_~#s1~0.base|) |c_~#s1~0.offset|)) (not (= .cse3 (_ bv3 32)))))))) (= (_ bv3 32) |c_~#s1~0.base|)) is different from true [2022-07-22 14:48:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-22 14:48:16,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:48:16,530 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:48:16,530 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 3014 treesize of output 2943 [2022-07-22 14:48:16,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3638 treesize of output 3510 [2022-07-22 14:48:16,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3862 treesize of output 3798 [2022-07-22 14:48:16,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3798 treesize of output 3782 [2022-07-22 14:48:16,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3782 treesize of output 3750 [2022-07-22 14:48:16,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:16,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:48:16,861 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 30 treesize of output 28 [2022-07-22 14:48:16,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:48:16,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:48:16,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:48:16,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227380385] [2022-07-22 14:48:16,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227380385] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:48:16,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1498211217] [2022-07-22 14:48:16,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:48:16,980 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-22 14:48:16,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-22 14:48:16,982 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-22 14:48:17,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-07-22 14:48:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:17,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-22 14:48:17,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:48:17,281 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:48:17,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-22 14:48:17,680 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-22 14:48:17,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-07-22 14:48:17,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:48:17,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:48:17,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:48:18,050 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-22 14:48:18,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 21 [2022-07-22 14:48:18,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:48:18,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:48:18,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2022-07-22 14:48:18,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:48:18,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:48:18,267 WARN L855 $PredicateComparison]: unable to prove that (and (let ((.cse1 (= |c___ldv_list_add_#in~new.base| |c___ldv_list_add_#in~prev.base|))) (let ((.cse5 (not .cse1)) (.cse0 (= (select (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset|) |c___ldv_list_add_#in~new.base|))) (or (and .cse0 .cse1 (exists ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32))) (__ldv_list_add_~next.base (_ BitVec 32)) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store (store (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_20) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_21) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_22) __ldv_list_add_~next.base v_DerPreprocessor_20) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_21) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_22)) (.cse3 (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base)) (.cse4 (store (store (store (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_17) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_18) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_19) __ldv_list_add_~next.base v_DerPreprocessor_17) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_18) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_19))) (and (= (select v_DerPreprocessor_22 |c___ldv_list_add_#in~prev.offset|) |c___ldv_list_add_#in~new.base|) (= |c___ldv_list_add_#in~new.base| (select v_DerPreprocessor_19 |c___ldv_list_add_#in~prev.offset|)) (not (= |c___ldv_list_add_#in~prev.base| __ldv_list_add_~next.base)) (= (select .cse2 |c___ldv_list_add_#in~new.base|) v_DerPreprocessor_21) (= .cse3 (select .cse2 __ldv_list_add_~next.base)) (= (select .cse4 |c___ldv_list_add_#in~new.base|) v_DerPreprocessor_18) (= .cse3 (select .cse4 __ldv_list_add_~next.base)))))) (and .cse0 .cse5) (and .cse0 .cse5 (exists ((v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (__ldv_list_add_~next.base (_ BitVec 32))) (let ((.cse7 (store (store (store (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_25) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_27) __ldv_list_add_~next.base v_DerPreprocessor_25) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_26) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_27))) (let ((.cse6 (select .cse7 __ldv_list_add_~next.base))) (and (= v_DerPreprocessor_25 .cse6) (= (select .cse7 |c___ldv_list_add_#in~new.base|) (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~new.base|)) (= |c___ldv_list_add_#in~new.base| (select v_DerPreprocessor_27 |c___ldv_list_add_#in~prev.offset|)) (= (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base) .cse6) (not (= |c___ldv_list_add_#in~prev.base| __ldv_list_add_~next.base))))))) (and .cse0 .cse1 (or (and (exists ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |c___ldv_list_add_#in~new.base| (select v_DerPreprocessor_23 |c___ldv_list_add_#in~prev.offset|)) (= v_DerPreprocessor_24 (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_23) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_24) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_23) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_24) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_23) |c___ldv_list_add_#in~new.base|)))) (exists ((v_prenex_42 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |c___ldv_list_add_#in~new.base| (select v_prenex_41 |c___ldv_list_add_#in~prev.offset|)) (= (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~prev.base| v_prenex_41) |c___ldv_list_add_#in~new.base| v_prenex_42) |c___ldv_list_add_#in~prev.base| v_prenex_41) |c___ldv_list_add_#in~new.base| v_prenex_42) |c___ldv_list_add_#in~prev.base| v_prenex_41) |c___ldv_list_add_#in~new.base|) v_prenex_42)))) (exists ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |c___ldv_list_add_#in~new.base| (select v_DerPreprocessor_23 |c___ldv_list_add_#in~prev.offset|)) (exists ((v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_23) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_24) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_23) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_24) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_23) |c___ldv_list_add_#in~new.base|))) (and (exists ((v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_16) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_15) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_16) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_15) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_16) |c___ldv_list_add_#in~new.base|))) (and (= v_DerPreprocessor_15 .cse8) (= (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_23) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_24) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_23) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_24) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_23) |c___ldv_list_add_#in~new.base|) .cse8)))) (= .cse9 (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~new.base|)) (= v_DerPreprocessor_24 .cse9))))))))))) (= |c_~#s1~0.offset| (_ bv0 32)) (= (_ bv3 32) |c_~#s1~0.base|)) is different from true [2022-07-22 14:48:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:48:18,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:48:18,810 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:48:18,810 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 3014 treesize of output 2943 [2022-07-22 14:48:18,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3638 treesize of output 3510 [2022-07-22 14:48:18,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3862 treesize of output 3798 [2022-07-22 14:48:18,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3798 treesize of output 3782 [2022-07-22 14:48:18,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3782 treesize of output 3750 [2022-07-22 14:48:18,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:48:19,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:19,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:48:19,016 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 30 treesize of output 28 [2022-07-22 14:48:19,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:48:19,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:48:19,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1498211217] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:48:19,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:48:19,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2022-07-22 14:48:19,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777283449] [2022-07-22 14:48:19,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:48:19,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-22 14:48:19,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:48:19,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-22 14:48:19,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=677, Unknown=19, NotChecked=110, Total=930 [2022-07-22 14:48:19,080 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 23 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:48:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:48:20,010 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-07-22 14:48:20,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 14:48:20,010 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2022-07-22 14:48:20,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:48:20,011 INFO L225 Difference]: With dead ends: 37 [2022-07-22 14:48:20,011 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 14:48:20,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=222, Invalid=1087, Unknown=31, NotChecked=142, Total=1482 [2022-07-22 14:48:20,012 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:48:20,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 203 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 108 Unchecked, 0.1s Time] [2022-07-22 14:48:20,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 14:48:20,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-22 14:48:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:48:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-07-22 14:48:20,017 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2022-07-22 14:48:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:48:20,017 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-07-22 14:48:20,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 14:48:20,018 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-07-22 14:48:20,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 14:48:20,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:48:20,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:48:20,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-22 14:48:20,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2022-07-22 14:48:20,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-22 14:48:20,423 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:48:20,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:48:20,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1260690627, now seen corresponding path program 1 times [2022-07-22 14:48:20,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:48:20,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466561941] [2022-07-22 14:48:20,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:48:20,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:48:20,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:48:20,427 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:48:20,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-22 14:48:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:20,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 14:48:20,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:48:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 14:48:20,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:48:20,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:48:20,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466561941] [2022-07-22 14:48:20,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466561941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:48:20,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:48:20,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:48:20,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468439398] [2022-07-22 14:48:20,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:48:20,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:48:20,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:48:20,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:48:20,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:48:20,537 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 14:48:20,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:48:20,545 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-07-22 14:48:20,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:48:20,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-07-22 14:48:20,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:48:20,546 INFO L225 Difference]: With dead ends: 36 [2022-07-22 14:48:20,546 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 14:48:20,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:48:20,547 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:48:20,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:48:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 14:48:20,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-22 14:48:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 14:48:20,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-07-22 14:48:20,550 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2022-07-22 14:48:20,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:48:20,550 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-07-22 14:48:20,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 14:48:20,550 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-07-22 14:48:20,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 14:48:20,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:48:20,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:48:20,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-22 14:48:20,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:48:20,752 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:48:20,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:48:20,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1228732403, now seen corresponding path program 1 times [2022-07-22 14:48:20,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:48:20,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152390316] [2022-07-22 14:48:20,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:48:20,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:48:20,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:48:20,754 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:48:20,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-22 14:48:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:48:20,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-22 14:48:20,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:48:21,101 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:48:21,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-22 14:48:21,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2022-07-22 14:48:21,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:48:21,231 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:48:21,520 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-22 14:48:21,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-07-22 14:48:21,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:48:21,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:48:21,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:48:21,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:21,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:21,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:21,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 74 [2022-07-22 14:48:21,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:48:21,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:21,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:21,703 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-22 14:48:21,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 92 [2022-07-22 14:48:21,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:48:21,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:48:21,754 INFO L356 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2022-07-22 14:48:21,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 87 [2022-07-22 14:48:21,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:48:22,056 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-22 14:48:22,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-07-22 14:48:22,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:48:22,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:48:22,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:48:22,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:22,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:22,248 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-22 14:48:22,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 94 [2022-07-22 14:48:22,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:48:22,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:22,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:22,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:22,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 74 [2022-07-22 14:48:22,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:48:22,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:48:22,455 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-22 14:48:22,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 19 [2022-07-22 14:48:22,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:48:22,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:48:22,512 INFO L356 Elim1Store]: treesize reduction 88, result has 8.3 percent of original size [2022-07-22 14:48:22,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 184 treesize of output 65 [2022-07-22 14:48:22,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:48:22,991 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c___ldv_list_add_#in~new.base| |c___ldv_list_add_#in~prev.base|)) (.cse4 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~prev.base|))) (and (let ((.cse0 (= |c___ldv_list_add_#in~new.offset| (select (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset|)))) (or (and .cse0 .cse1) (and .cse0 (exists ((v_DerPreprocessor_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_31) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_32) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_33) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_31) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_32) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_33))) (let ((.cse3 (select .cse2 |c___ldv_list_add_#in~next.base|))) (and (= (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~new.base|) (select .cse2 |c___ldv_list_add_#in~new.base|)) (= v_DerPreprocessor_31 .cse3) (= .cse3 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base|)) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_33 |c___ldv_list_add_#in~prev.offset|))))))) (and .cse0 .cse4 (exists ((v_DerPreprocessor_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_34) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_35) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_36) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_34) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_35) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_36))) (and (= (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~new.base|) (select .cse5 |c___ldv_list_add_#in~new.base|)) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_36 |c___ldv_list_add_#in~prev.offset|)) (= v_DerPreprocessor_34 (select .cse5 |c___ldv_list_add_#in~next.base|)))))))) (let ((.cse6 (= (select (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset|) |c___ldv_list_add_#in~new.base|))) (or (and .cse6 (not .cse1)) (and .cse6 (or .cse4 (exists ((v_DerPreprocessor_30 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_DerPreprocessor_30 |c___ldv_list_add_#in~prev.offset|) |c___ldv_list_add_#in~new.base|) (exists ((v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_28) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_29) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_30) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_28) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_29) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_30))) (and (= (select .cse7 |c___ldv_list_add_#in~new.base|) v_DerPreprocessor_29) (= (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~next.base|) (select .cse7 |c___ldv_list_add_#in~next.base|))))))))))) (exists ((v_ArrVal_290 (_ BitVec 8)) (v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_291 (_ BitVec 8))) (= |c_#memory_int| (store (let ((.cse8 (store |c_old(#memory_int)| |c___ldv_list_add_#in~next.base| v_ArrVal_277))) (store .cse8 |c___ldv_list_add_#in~new.base| (store (store (select .cse8 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| v_ArrVal_291) (bvadd |c___ldv_list_add_#in~new.offset| (_ bv4 32)) v_ArrVal_290))) |c___ldv_list_add_#in~prev.base| v_ArrVal_275))) (= (_ bv3 32) |c_~#s1~0.base|))) is different from true [2022-07-22 14:48:23,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:48:23,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 45 [2022-07-22 14:48:23,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 83 [2022-07-22 14:48:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:48:29,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:48:30,396 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:48:30,396 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 17822 treesize of output 17686 [2022-07-22 14:48:30,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21118 treesize of output 20990 [2022-07-22 14:48:31,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:48:31,140 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 1142134 treesize of output 1128062 [2022-07-22 14:48:31,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1477750 treesize of output 1457270 [2022-07-22 14:48:32,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1691894 treesize of output 1676534 [2022-07-22 14:48:32,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2145782 treesize of output 2115062 [2022-07-22 14:48:33,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2115062 treesize of output 2111222 [2022-07-22 14:48:34,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2111222 treesize of output 2103542 [2022-07-22 14:48:35,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2103542 treesize of output 2101494 [2022-07-22 14:48:36,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2101494 treesize of output 2097398 [2022-07-22 14:48:46,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1049718 treesize of output 1047670