./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/list-properties/list-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 a135e953d64ed0fec81eb2a1e42f4031e3e387fc71d5a5cd2177772a202dc706 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:59:27,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:59:27,811 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:59:27,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:59:27,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:59:27,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:59:27,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:59:27,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:59:27,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:59:27,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:59:27,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:59:27,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:59:27,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:59:27,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:59:27,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:59:27,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:59:27,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:59:27,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:59:27,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:59:27,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:59:27,885 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:59:27,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:59:27,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:59:27,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:59:27,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:59:27,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:59:27,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:59:27,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:59:27,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:59:27,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:59:27,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:59:27,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:59:27,901 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:59:27,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:59:27,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:59:27,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:59:27,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:59:27,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:59:27,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:59:27,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:59:27,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:59:27,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:59:27,914 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 01:59:27,944 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:59:27,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:59:27,946 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:59:27,946 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:59:27,947 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:59:27,947 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:59:27,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:59:27,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:59:27,948 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:59:27,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:59:27,949 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:59:27,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 01:59:27,950 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:59:27,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:59:27,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:59:27,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:59:27,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:59:27,956 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:59:27,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:59:27,957 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:59:27,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:59:27,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:59:27,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:59:27,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:59:27,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:59:27,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:59:27,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:59:27,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:59:27,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 01:59:27,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 01:59:27,959 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:59:27,959 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:59:27,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:59:27,960 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 -> a135e953d64ed0fec81eb2a1e42f4031e3e387fc71d5a5cd2177772a202dc706 [2022-07-21 01:59:28,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:59:28,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:59:28,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:59:28,310 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:59:28,311 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:59:28,312 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-2.i [2022-07-21 01:59:28,372 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/634a1f17c/46421c4cbad040a5972482492adc0c44/FLAG3a020eea6 [2022-07-21 01:59:28,881 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:59:28,882 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i [2022-07-21 01:59:28,897 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/634a1f17c/46421c4cbad040a5972482492adc0c44/FLAG3a020eea6 [2022-07-21 01:59:29,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/634a1f17c/46421c4cbad040a5972482492adc0c44 [2022-07-21 01:59:29,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:59:29,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:59:29,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:59:29,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:59:29,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:59:29,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:59:29" (1/1) ... [2022-07-21 01:59:29,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b450db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:29, skipping insertion in model container [2022-07-21 01:59:29,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:59:29" (1/1) ... [2022-07-21 01:59:29,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:59:29,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:59:29,576 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/list-properties/list-2.i[23408,23421] [2022-07-21 01:59:29,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:59:29,588 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:59:29,645 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/list-properties/list-2.i[23408,23421] [2022-07-21 01:59:29,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:59:29,679 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:59:29,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:29 WrapperNode [2022-07-21 01:59:29,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:59:29,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:59:29,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:59:29,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:59:29,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:29" (1/1) ... [2022-07-21 01:59:29,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:29" (1/1) ... [2022-07-21 01:59:29,743 INFO L137 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2022-07-21 01:59:29,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:59:29,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:59:29,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:59:29,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:59:29,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:29" (1/1) ... [2022-07-21 01:59:29,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:29" (1/1) ... [2022-07-21 01:59:29,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:29" (1/1) ... [2022-07-21 01:59:29,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:29" (1/1) ... [2022-07-21 01:59:29,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:29" (1/1) ... [2022-07-21 01:59:29,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:29" (1/1) ... [2022-07-21 01:59:29,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:29" (1/1) ... [2022-07-21 01:59:29,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:59:29,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:59:29,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:59:29,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:59:29,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:29" (1/1) ... [2022-07-21 01:59:29,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:59:29,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:59:29,824 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-21 01:59:29,851 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-21 01:59:29,868 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-21 01:59:29,868 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-21 01:59:29,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 01:59:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 01:59:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 01:59:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:59:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 01:59:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 01:59:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 01:59:29,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:59:29,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:59:30,014 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:59:30,028 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:59:30,064 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-21 01:59:30,174 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:59:30,179 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:59:30,180 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 01:59:30,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:59:30 BoogieIcfgContainer [2022-07-21 01:59:30,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:59:30,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:59:30,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:59:30,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:59:30,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:59:29" (1/3) ... [2022-07-21 01:59:30,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d98b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:59:30, skipping insertion in model container [2022-07-21 01:59:30,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:29" (2/3) ... [2022-07-21 01:59:30,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d98b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:59:30, skipping insertion in model container [2022-07-21 01:59:30,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:59:30" (3/3) ... [2022-07-21 01:59:30,189 INFO L111 eAbstractionObserver]: Analyzing ICFG list-2.i [2022-07-21 01:59:30,201 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:59:30,202 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:59:30,250 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:59:30,256 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@6b63213c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a35600d [2022-07-21 01:59:30,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:59:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 01:59:30,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:30,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:30,268 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:30,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:30,273 INFO L85 PathProgramCache]: Analyzing trace with hash 896526153, now seen corresponding path program 1 times [2022-07-21 01:59:30,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:59:30,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747565770] [2022-07-21 01:59:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:30,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:59:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:30,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:59:30,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747565770] [2022-07-21 01:59:30,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747565770] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:30,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:30,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:59:30,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191771929] [2022-07-21 01:59:30,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:30,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:59:30,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:59:30,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:59:30,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:59:30,465 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:30,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:30,482 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-07-21 01:59:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:59:30,483 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-21 01:59:30,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:30,488 INFO L225 Difference]: With dead ends: 50 [2022-07-21 01:59:30,488 INFO L226 Difference]: Without dead ends: 21 [2022-07-21 01:59:30,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:59:30,494 INFO L413 NwaCegarLoop]: 36 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, 36 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-21 01:59:30,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:59:30,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-21 01:59:30,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-21 01:59:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:30,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-21 01:59:30,522 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2022-07-21 01:59:30,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:30,523 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-21 01:59:30,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:30,523 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-21 01:59:30,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 01:59:30,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:30,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:30,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 01:59:30,525 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:30,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:30,525 INFO L85 PathProgramCache]: Analyzing trace with hash 283143297, now seen corresponding path program 1 times [2022-07-21 01:59:30,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:59:30,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139682619] [2022-07-21 01:59:30,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:30,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:59:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:30,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:30,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:59:30,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139682619] [2022-07-21 01:59:30,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139682619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:30,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:30,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:59:30,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077136826] [2022-07-21 01:59:30,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:30,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:59:30,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:59:30,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:59:30,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:59:30,612 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:30,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:30,715 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-07-21 01:59:30,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:59:30,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 01:59:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:30,719 INFO L225 Difference]: With dead ends: 46 [2022-07-21 01:59:30,735 INFO L226 Difference]: Without dead ends: 42 [2022-07-21 01:59:30,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:59:30,737 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:30,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 55 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 01:59:30,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-21 01:59:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2022-07-21 01:59:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-07-21 01:59:30,743 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2022-07-21 01:59:30,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:30,744 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-07-21 01:59:30,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:30,744 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-07-21 01:59:30,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 01:59:30,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:30,745 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:30,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 01:59:30,745 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:30,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:30,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1566445212, now seen corresponding path program 1 times [2022-07-21 01:59:30,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:59:30,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395951317] [2022-07-21 01:59:30,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:30,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:59:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:30,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:59:30,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395951317] [2022-07-21 01:59:30,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395951317] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:30,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:30,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:59:30,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997058565] [2022-07-21 01:59:30,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:30,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:59:30,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:59:30,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:59:30,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:59:30,826 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:30,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:30,927 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-07-21 01:59:30,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:59:30,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-21 01:59:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:30,928 INFO L225 Difference]: With dead ends: 48 [2022-07-21 01:59:30,928 INFO L226 Difference]: Without dead ends: 40 [2022-07-21 01:59:30,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:59:30,930 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:30,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 60 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 01:59:30,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-21 01:59:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-07-21 01:59:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-07-21 01:59:30,936 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2022-07-21 01:59:30,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:30,936 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-21 01:59:30,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:30,937 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-07-21 01:59:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 01:59:30,938 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:30,938 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:30,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 01:59:30,938 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:30,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:30,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1703819108, now seen corresponding path program 1 times [2022-07-21 01:59:30,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:59:30,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340993498] [2022-07-21 01:59:30,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:30,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:59:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:31,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:59:31,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340993498] [2022-07-21 01:59:31,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340993498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:31,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:31,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:59:31,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409166728] [2022-07-21 01:59:31,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:31,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:59:31,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:59:31,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:59:31,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:59:31,017 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:31,080 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-07-21 01:59:31,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:59:31,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-21 01:59:31,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:31,081 INFO L225 Difference]: With dead ends: 48 [2022-07-21 01:59:31,082 INFO L226 Difference]: Without dead ends: 37 [2022-07-21 01:59:31,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:59:31,083 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:31,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:59:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-21 01:59:31,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2022-07-21 01:59:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-07-21 01:59:31,089 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2022-07-21 01:59:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:31,089 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-21 01:59:31,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-07-21 01:59:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 01:59:31,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:31,091 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:31,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 01:59:31,096 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:31,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:31,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1538293272, now seen corresponding path program 1 times [2022-07-21 01:59:31,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:59:31,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189890000] [2022-07-21 01:59:31,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:31,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:59:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:31,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:59:31,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189890000] [2022-07-21 01:59:31,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189890000] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:59:31,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475143906] [2022-07-21 01:59:31,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:31,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:31,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:59:31,291 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-21 01:59:31,316 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-21 01:59:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:31,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-21 01:59:31,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:31,449 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 6 treesize of output 5 [2022-07-21 01:59:31,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 01:59:31,593 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:59:31,600 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-21 01:59:31,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:31,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 01:59:31,706 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-21 01:59:31,731 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 15 treesize of output 7 [2022-07-21 01:59:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:31,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:31,761 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_84 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_84) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-21 01:59:31,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_84 (Array Int Int)) (v_ArrVal_82 Int)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_82)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_84) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-21 01:59:31,827 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 01:59:31,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-21 01:59:31,840 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:31,841 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 30 treesize of output 33 [2022-07-21 01:59:31,850 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 9 treesize of output 7 [2022-07-21 01:59:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-21 01:59:32,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475143906] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:59:32,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:59:32,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-07-21 01:59:32,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244859329] [2022-07-21 01:59:32,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:32,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 01:59:32,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:59:32,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 01:59:32,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=167, Unknown=2, NotChecked=54, Total=272 [2022-07-21 01:59:32,023 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:32,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:32,164 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-07-21 01:59:32,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 01:59:32,165 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-21 01:59:32,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:32,166 INFO L225 Difference]: With dead ends: 45 [2022-07-21 01:59:32,166 INFO L226 Difference]: Without dead ends: 39 [2022-07-21 01:59:32,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=268, Unknown=2, NotChecked=70, Total=420 [2022-07-21 01:59:32,168 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:32,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 107 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2022-07-21 01:59:32,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-21 01:59:32,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-07-21 01:59:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-07-21 01:59:32,173 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 20 [2022-07-21 01:59:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:32,173 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-07-21 01:59:32,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-07-21 01:59:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 01:59:32,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:32,174 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:32,210 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-21 01:59:32,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:32,388 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:32,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:32,388 INFO L85 PathProgramCache]: Analyzing trace with hash -674891608, now seen corresponding path program 1 times [2022-07-21 01:59:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:59:32,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064768135] [2022-07-21 01:59:32,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:32,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:59:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:32,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:59:32,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064768135] [2022-07-21 01:59:32,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064768135] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:59:32,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105037332] [2022-07-21 01:59:32,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:32,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:32,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:59:32,511 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-21 01:59:32,522 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-21 01:59:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:32,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-21 01:59:32,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:32,599 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 6 treesize of output 5 [2022-07-21 01:59:32,665 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:59:32,667 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-21 01:59:32,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 01:59:32,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:32,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 01:59:32,770 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-21 01:59:32,795 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 15 treesize of output 7 [2022-07-21 01:59:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:32,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:32,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_136 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-21 01:59:32,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_135 Int) (v_ArrVal_136 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_135)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-21 01:59:32,854 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 01:59:32,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-21 01:59:32,863 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:32,864 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 30 treesize of output 33 [2022-07-21 01:59:32,869 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 9 treesize of output 7 [2022-07-21 01:59:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-21 01:59:32,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105037332] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:59:32,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:59:32,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-07-21 01:59:32,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858516653] [2022-07-21 01:59:32,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:32,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 01:59:32,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:59:32,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 01:59:32,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=167, Unknown=2, NotChecked=54, Total=272 [2022-07-21 01:59:32,988 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:33,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:33,164 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-07-21 01:59:33,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 01:59:33,165 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-21 01:59:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:33,166 INFO L225 Difference]: With dead ends: 70 [2022-07-21 01:59:33,166 INFO L226 Difference]: Without dead ends: 66 [2022-07-21 01:59:33,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=257, Unknown=2, NotChecked=70, Total=420 [2022-07-21 01:59:33,168 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 81 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:33,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 108 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 90 Invalid, 0 Unknown, 96 Unchecked, 0.1s Time] [2022-07-21 01:59:33,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-21 01:59:33,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2022-07-21 01:59:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-07-21 01:59:33,175 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 20 [2022-07-21 01:59:33,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:33,175 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-07-21 01:59:33,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-07-21 01:59:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 01:59:33,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:33,177 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] [2022-07-21 01:59:33,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-21 01:59:33,387 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,SelfDestructingSolverStorable5 [2022-07-21 01:59:33,388 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:33,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:33,388 INFO L85 PathProgramCache]: Analyzing trace with hash 242294851, now seen corresponding path program 1 times [2022-07-21 01:59:33,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:59:33,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727289656] [2022-07-21 01:59:33,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:33,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:59:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:33,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:59:33,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727289656] [2022-07-21 01:59:33,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727289656] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:59:33,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989273406] [2022-07-21 01:59:33,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:33,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:33,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:59:33,570 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-21 01:59:33,581 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-21 01:59:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:33,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-21 01:59:33,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:33,657 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 6 treesize of output 5 [2022-07-21 01:59:33,714 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:59:33,715 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-21 01:59:33,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 01:59:33,756 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-21 01:59:33,804 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 01:59:33,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-07-21 01:59:33,809 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 42 treesize of output 44 [2022-07-21 01:59:33,811 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 29 treesize of output 19 [2022-07-21 01:59:33,837 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 39 treesize of output 21 [2022-07-21 01:59:33,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-21 01:59:33,852 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 15 treesize of output 7 [2022-07-21 01:59:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:33,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:33,884 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 79 treesize of output 57 [2022-07-21 01:59:33,891 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_189 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_189) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_ArrVal_186 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_186) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-07-21 01:59:33,912 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:33,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-21 01:59:33,919 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:33,919 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 36 treesize of output 39 [2022-07-21 01:59:33,929 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 11 treesize of output 7 [2022-07-21 01:59:33,948 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 01:59:33,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-07-21 01:59:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-21 01:59:34,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989273406] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:59:34,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:59:34,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-07-21 01:59:34,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799839545] [2022-07-21 01:59:34,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:34,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 01:59:34,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:59:34,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 01:59:34,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=226, Unknown=1, NotChecked=30, Total=306 [2022-07-21 01:59:34,052 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:34,281 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-07-21 01:59:34,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 01:59:34,282 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-21 01:59:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:34,283 INFO L225 Difference]: With dead ends: 63 [2022-07-21 01:59:34,283 INFO L226 Difference]: Without dead ends: 59 [2022-07-21 01:59:34,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=368, Unknown=1, NotChecked=40, Total=506 [2022-07-21 01:59:34,284 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 106 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:34,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 129 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 173 Invalid, 0 Unknown, 88 Unchecked, 0.1s Time] [2022-07-21 01:59:34,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-21 01:59:34,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2022-07-21 01:59:34,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-07-21 01:59:34,289 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 22 [2022-07-21 01:59:34,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:34,289 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-07-21 01:59:34,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-07-21 01:59:34,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 01:59:34,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:34,290 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:34,316 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-21 01:59:34,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:34,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:34,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:34,491 INFO L85 PathProgramCache]: Analyzing trace with hash 965794270, now seen corresponding path program 1 times [2022-07-21 01:59:34,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:59:34,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458924277] [2022-07-21 01:59:34,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:59:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:34,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:59:34,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458924277] [2022-07-21 01:59:34,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458924277] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:59:34,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138533231] [2022-07-21 01:59:34,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:34,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:34,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:59:34,623 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 01:59:34,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 01:59:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:34,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-21 01:59:34,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:34,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 6 treesize of output 5 [2022-07-21 01:59:34,739 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:59:34,739 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-21 01:59:34,765 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-21 01:59:34,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 01:59:34,808 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 01:59:34,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-07-21 01:59:34,812 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 29 treesize of output 19 [2022-07-21 01:59:34,815 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 32 treesize of output 34 [2022-07-21 01:59:34,839 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 39 treesize of output 21 [2022-07-21 01:59:34,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-21 01:59:34,857 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 15 treesize of output 7 [2022-07-21 01:59:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:34,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:34,904 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 52 treesize of output 30 [2022-07-21 01:59:34,909 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_240 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_240) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_ArrVal_242 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_242) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-07-21 01:59:34,932 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:34,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-21 01:59:34,938 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:34,939 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 38 treesize of output 35 [2022-07-21 01:59:34,942 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 11 treesize of output 7 [2022-07-21 01:59:34,962 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 01:59:34,962 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-07-21 01:59:35,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-21 01:59:35,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138533231] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:59:35,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:59:35,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-07-21 01:59:35,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572345485] [2022-07-21 01:59:35,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:35,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 01:59:35,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:59:35,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 01:59:35,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2022-07-21 01:59:35,065 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:35,318 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-07-21 01:59:35,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 01:59:35,319 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-21 01:59:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:35,319 INFO L225 Difference]: With dead ends: 57 [2022-07-21 01:59:35,319 INFO L226 Difference]: Without dead ends: 47 [2022-07-21 01:59:35,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=577, Unknown=1, NotChecked=50, Total=756 [2022-07-21 01:59:35,320 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:35,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 129 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 183 Invalid, 0 Unknown, 56 Unchecked, 0.1s Time] [2022-07-21 01:59:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-21 01:59:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2022-07-21 01:59:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-07-21 01:59:35,325 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 24 [2022-07-21 01:59:35,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:35,325 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-07-21 01:59:35,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:35,325 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-07-21 01:59:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 01:59:35,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:35,326 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:35,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:35,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:35,539 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:35,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1990497246, now seen corresponding path program 2 times [2022-07-21 01:59:35,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:59:35,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564074407] [2022-07-21 01:59:35,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:35,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:59:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:35,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:59:35,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564074407] [2022-07-21 01:59:35,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564074407] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:59:35,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792298666] [2022-07-21 01:59:35,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 01:59:35,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:35,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:59:35,682 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 01:59:35,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 01:59:35,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 01:59:35,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:59:35,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-21 01:59:35,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:35,756 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 6 treesize of output 5 [2022-07-21 01:59:35,809 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:59:35,809 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-21 01:59:35,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 01:59:35,840 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-21 01:59:35,888 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 01:59:35,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-07-21 01:59:35,892 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 29 treesize of output 19 [2022-07-21 01:59:35,896 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 32 treesize of output 34 [2022-07-21 01:59:35,921 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 39 treesize of output 21 [2022-07-21 01:59:35,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-21 01:59:35,931 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 15 treesize of output 7 [2022-07-21 01:59:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:35,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:35,982 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 52 treesize of output 30 [2022-07-21 01:59:35,987 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_293 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-07-21 01:59:36,002 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:36,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-21 01:59:36,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:36,009 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 38 treesize of output 35 [2022-07-21 01:59:36,013 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 11 treesize of output 7 [2022-07-21 01:59:36,031 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 01:59:36,031 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-07-21 01:59:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-21 01:59:36,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792298666] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:59:36,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:59:36,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-07-21 01:59:36,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841137448] [2022-07-21 01:59:36,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:36,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 01:59:36,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:59:36,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 01:59:36,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2022-07-21 01:59:36,122 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:36,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:36,368 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-07-21 01:59:36,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 01:59:36,369 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-21 01:59:36,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:36,369 INFO L225 Difference]: With dead ends: 58 [2022-07-21 01:59:36,369 INFO L226 Difference]: Without dead ends: 45 [2022-07-21 01:59:36,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=566, Unknown=1, NotChecked=50, Total=756 [2022-07-21 01:59:36,370 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 112 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:36,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 117 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 160 Invalid, 0 Unknown, 71 Unchecked, 0.1s Time] [2022-07-21 01:59:36,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-21 01:59:36,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2022-07-21 01:59:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:36,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-07-21 01:59:36,374 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 24 [2022-07-21 01:59:36,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:36,374 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-07-21 01:59:36,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-07-21 01:59:36,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 01:59:36,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:36,375 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:36,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:36,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:36,585 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:36,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:36,585 INFO L85 PathProgramCache]: Analyzing trace with hash 366447567, now seen corresponding path program 2 times [2022-07-21 01:59:36,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:59:36,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135660307] [2022-07-21 01:59:36,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:36,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:59:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:36,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:59:36,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135660307] [2022-07-21 01:59:36,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135660307] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:59:36,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755755337] [2022-07-21 01:59:36,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 01:59:36,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:36,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:59:36,731 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 01:59:36,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 01:59:36,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 01:59:36,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:59:36,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-21 01:59:36,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:36,827 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 6 treesize of output 5 [2022-07-21 01:59:36,866 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:59:36,866 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-21 01:59:36,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 01:59:36,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:36,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 01:59:36,903 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-21 01:59:36,935 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-21 01:59:36,971 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 01:59:36,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-21 01:59:37,072 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 15 treesize of output 7 [2022-07-21 01:59:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:37,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:39,098 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse0) (= 3 .cse0)))) is different from false [2022-07-21 01:59:39,120 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= 2 .cse0)))) is different from false [2022-07-21 01:59:39,136 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) is different from false [2022-07-21 01:59:39,153 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_373 Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_373)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 2)))) is different from false [2022-07-21 01:59:39,196 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 01:59:39,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2022-07-21 01:59:39,218 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:39,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 547 treesize of output 537 [2022-07-21 01:59:39,236 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 535 treesize of output 503 [2022-07-21 01:59:47,874 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 6 treesize of output 4 [2022-07-21 01:59:47,883 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:47,883 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 31 treesize of output 33 [2022-07-21 01:59:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-21 01:59:47,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755755337] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:59:47,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:59:47,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-07-21 01:59:47,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273716796] [2022-07-21 01:59:47,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:47,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 01:59:47,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:59:47,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 01:59:47,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=286, Unknown=4, NotChecked=148, Total=506 [2022-07-21 01:59:47,986 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:48,066 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-21 01:59:48,070 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-21 01:59:48,073 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= 2 .cse0)))) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-21 01:59:49,647 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse0) (= 3 .cse0)))) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-21 01:59:49,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:49,729 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2022-07-21 01:59:49,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 01:59:49,730 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-21 01:59:49,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:49,731 INFO L225 Difference]: With dead ends: 79 [2022-07-21 01:59:49,731 INFO L226 Difference]: Without dead ends: 75 [2022-07-21 01:59:49,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=100, Invalid=386, Unknown=8, NotChecked=376, Total=870 [2022-07-21 01:59:49,732 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 65 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:49,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 163 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 186 Invalid, 0 Unknown, 184 Unchecked, 0.1s Time] [2022-07-21 01:59:49,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-21 01:59:49,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 44. [2022-07-21 01:59:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-07-21 01:59:49,737 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 24 [2022-07-21 01:59:49,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:49,738 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-07-21 01:59:49,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-07-21 01:59:49,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 01:59:49,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:49,738 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] [2022-07-21 01:59:49,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:49,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:49,952 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:49,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:49,952 INFO L85 PathProgramCache]: Analyzing trace with hash 666149519, now seen corresponding path program 1 times [2022-07-21 01:59:49,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:59:49,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944996120] [2022-07-21 01:59:49,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:49,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:59:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:50,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:59:50,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944996120] [2022-07-21 01:59:50,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944996120] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:59:50,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578597105] [2022-07-21 01:59:50,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:50,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:50,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:59:50,082 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 01:59:50,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 01:59:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:50,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-21 01:59:50,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:50,168 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 6 treesize of output 5 [2022-07-21 01:59:50,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 01:59:50,199 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:59:50,199 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-21 01:59:50,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:50,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 01:59:50,231 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-21 01:59:50,257 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-21 01:59:50,293 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 01:59:50,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-21 01:59:50,400 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 15 treesize of output 7 [2022-07-21 01:59:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:50,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:52,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-07-21 01:59:52,100 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2022-07-21 01:59:52,110 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 1)))) is different from false [2022-07-21 01:59:52,135 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_457 Int)) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_457)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2022-07-21 01:59:52,156 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 01:59:52,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2022-07-21 01:59:52,175 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:52,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 547 treesize of output 537 [2022-07-21 01:59:52,185 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 535 treesize of output 503 [2022-07-21 01:59:56,010 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 6 treesize of output 4 [2022-07-21 01:59:56,120 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:56,120 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 27 treesize of output 29 [2022-07-21 01:59:56,133 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 21 treesize of output 17 [2022-07-21 01:59:56,156 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-07-21 01:59:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-21 01:59:56,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578597105] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:59:56,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:59:56,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-07-21 01:59:56,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357641466] [2022-07-21 01:59:56,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:56,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 01:59:56,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:59:56,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 01:59:56,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=286, Unknown=4, NotChecked=148, Total=506 [2022-07-21 01:59:56,218 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:56,261 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 1)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-21 01:59:56,264 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 1)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-21 01:59:56,278 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-21 01:59:57,424 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) is different from false [2022-07-21 01:59:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:57,491 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-07-21 01:59:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 01:59:57,492 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-21 01:59:57,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:57,492 INFO L225 Difference]: With dead ends: 86 [2022-07-21 01:59:57,492 INFO L226 Difference]: Without dead ends: 82 [2022-07-21 01:59:57,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=94, Invalid=350, Unknown=8, NotChecked=360, Total=812 [2022-07-21 01:59:57,493 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 58 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:57,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 192 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 93 Invalid, 0 Unknown, 241 Unchecked, 0.1s Time] [2022-07-21 01:59:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-21 01:59:57,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 42. [2022-07-21 01:59:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-07-21 01:59:57,498 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 24 [2022-07-21 01:59:57,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:57,498 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-07-21 01:59:57,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:59:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-07-21 01:59:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 01:59:57,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:57,499 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:57,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:57,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:57,699 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:57,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:57,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1529551183, now seen corresponding path program 2 times [2022-07-21 01:59:57,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:59:57,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548293480] [2022-07-21 01:59:57,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:57,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:59:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:57,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:59:57,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548293480] [2022-07-21 01:59:57,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548293480] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:59:57,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245141060] [2022-07-21 01:59:57,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 01:59:57,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:57,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:59:57,829 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 01:59:57,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 01:59:57,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 01:59:57,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:59:57,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-21 01:59:57,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:57,908 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 6 treesize of output 5 [2022-07-21 01:59:57,944 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:59:57,945 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-21 01:59:57,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 01:59:57,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:57,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 01:59:58,005 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-21 01:59:58,038 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-21 01:59:58,103 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 01:59:58,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-21 01:59:58,221 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 15 treesize of output 7 [2022-07-21 01:59:58,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:58,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:59,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-07-21 01:59:59,762 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-07-21 01:59:59,772 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2022-07-21 01:59:59,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_544)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-07-21 01:59:59,804 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 01:59:59,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2022-07-21 01:59:59,818 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:59,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 547 treesize of output 537 [2022-07-21 01:59:59,829 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 535 treesize of output 503 [2022-07-21 01:59:59,981 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 142 treesize of output 134 [2022-07-21 02:00:00,119 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 6 treesize of output 4 [2022-07-21 02:00:00,145 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:00,145 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 312 treesize of output 302 [2022-07-21 02:00:00,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-21 02:00:00,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245141060] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:00:00,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:00:00,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 29 [2022-07-21 02:00:00,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630521371] [2022-07-21 02:00:00,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:00:00,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-21 02:00:00,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:00:00,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-21 02:00:00,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=517, Unknown=4, NotChecked=196, Total=812 [2022-07-21 02:00:00,695 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:00:00,776 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-21 02:00:00,780 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-21 02:00:00,788 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0))))) is different from false [2022-07-21 02:00:01,926 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) is different from false [2022-07-21 02:00:02,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:00:02,018 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2022-07-21 02:00:02,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 02:00:02,018 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-21 02:00:02,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:00:02,019 INFO L225 Difference]: With dead ends: 83 [2022-07-21 02:00:02,019 INFO L226 Difference]: Without dead ends: 79 [2022-07-21 02:00:02,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=130, Invalid=650, Unknown=8, NotChecked=472, Total=1260 [2022-07-21 02:00:02,020 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:00:02,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 267 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 226 Invalid, 0 Unknown, 305 Unchecked, 0.1s Time] [2022-07-21 02:00:02,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-21 02:00:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 46. [2022-07-21 02:00:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:00:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-07-21 02:00:02,025 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 24 [2022-07-21 02:00:02,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:00:02,025 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-07-21 02:00:02,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:00:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-07-21 02:00:02,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 02:00:02,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:00:02,026 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:00:02,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 02:00:02,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-21 02:00:02,232 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:00:02,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:00:02,232 INFO L85 PathProgramCache]: Analyzing trace with hash 17470058, now seen corresponding path program 1 times [2022-07-21 02:00:02,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:00:02,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087531088] [2022-07-21 02:00:02,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:02,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:00:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:00:02,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:00:02,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087531088] [2022-07-21 02:00:02,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087531088] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:02,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932516247] [2022-07-21 02:00:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:02,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:00:02,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:00:02,367 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:00:02,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 02:00:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:02,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-21 02:00:02,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:00:02,454 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 6 treesize of output 5 [2022-07-21 02:00:02,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:00:02,496 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:00:02,497 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-21 02:00:02,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:02,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 02:00:02,525 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-21 02:00:02,554 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-21 02:00:02,597 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 02:00:02,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-21 02:00:02,642 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:02,642 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 26 treesize of output 22 [2022-07-21 02:00:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:00:02,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:00:03,568 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-07-21 02:00:03,576 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_85| Int) (v_ArrVal_632 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_632))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-07-21 02:00:03,583 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_85| Int) (v_ArrVal_632 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_632))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-07-21 02:00:03,591 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_85| Int) (v_ArrVal_626 Int) (v_ArrVal_632 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_626)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_632))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-07-21 02:00:03,617 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 02:00:03,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 41 [2022-07-21 02:00:03,629 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:03,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 301 [2022-07-21 02:00:03,635 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 270 treesize of output 254 [2022-07-21 02:00:03,740 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 6 treesize of output 4 [2022-07-21 02:00:03,749 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:03,750 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 22 treesize of output 26 [2022-07-21 02:00:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-21 02:00:03,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932516247] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:00:03,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:00:03,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 24 [2022-07-21 02:00:03,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625155405] [2022-07-21 02:00:03,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:00:03,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 02:00:03,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:00:03,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 02:00:03,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=322, Unknown=4, NotChecked=156, Total=552 [2022-07-21 02:00:03,852 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:00:03,927 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_85| Int) (v_ArrVal_632 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_632))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-21 02:00:03,933 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_85| Int) (v_ArrVal_632 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_632))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-21 02:00:03,936 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_85| Int) (v_ArrVal_632 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_632))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-21 02:00:05,043 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-21 02:00:05,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:00:05,143 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2022-07-21 02:00:05,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 02:00:05,144 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-21 02:00:05,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:00:05,145 INFO L225 Difference]: With dead ends: 92 [2022-07-21 02:00:05,145 INFO L226 Difference]: Without dead ends: 84 [2022-07-21 02:00:05,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=122, Invalid=502, Unknown=8, NotChecked=424, Total=1056 [2022-07-21 02:00:05,146 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 62 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:00:05,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 209 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 168 Invalid, 0 Unknown, 204 Unchecked, 0.1s Time] [2022-07-21 02:00:05,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-21 02:00:05,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 55. [2022-07-21 02:00:05,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:00:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-07-21 02:00:05,151 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 26 [2022-07-21 02:00:05,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:00:05,151 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-07-21 02:00:05,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:00:05,152 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-07-21 02:00:05,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 02:00:05,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:00:05,152 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:00:05,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 02:00:05,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 02:00:05,376 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:00:05,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:00:05,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1042173034, now seen corresponding path program 3 times [2022-07-21 02:00:05,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:00:05,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104201219] [2022-07-21 02:00:05,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:05,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:00:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:00:05,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:00:05,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104201219] [2022-07-21 02:00:05,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104201219] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:05,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067712112] [2022-07-21 02:00:05,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 02:00:05,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:00:05,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:00:05,587 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:00:05,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 02:00:05,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-21 02:00:05,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:00:05,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-21 02:00:05,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:00:05,680 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 6 treesize of output 5 [2022-07-21 02:00:05,711 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:00:05,711 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-21 02:00:05,741 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 11 treesize of output 7 [2022-07-21 02:00:05,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:00:05,781 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:00:05,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-07-21 02:00:05,785 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 11 treesize of output 7 [2022-07-21 02:00:05,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:00:05,807 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:00:05,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-21 02:00:05,862 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:00:05,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 92 [2022-07-21 02:00:05,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:05,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-07-21 02:00:05,879 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2022-07-21 02:00:05,946 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:00:05,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 72 [2022-07-21 02:00:05,970 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-07-21 02:00:05,970 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 2 case distinctions, treesize of input 65 treesize of output 70 [2022-07-21 02:00:05,981 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-21 02:00:05,981 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 1 case distinctions, treesize of input 29 treesize of output 34 [2022-07-21 02:00:06,053 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 23 treesize of output 11 [2022-07-21 02:00:06,082 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 47 treesize of output 39 [2022-07-21 02:00:06,117 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 02:00:06,232 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 115 treesize of output 99 [2022-07-21 02:00:06,473 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 125 treesize of output 101 [2022-07-21 02:00:06,489 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-07-21 02:00:06,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 85 [2022-07-21 02:00:06,651 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:00:06,652 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 22 treesize of output 14 [2022-07-21 02:00:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:00:06,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:00:08,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (or (= .cse0 2) (= .cse0 3)))) (not (= 2 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-07-21 02:00:08,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_720 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_717)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_95| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_95|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= 3 .cse0) (= 2 .cse0) (not (= 2 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) is different from false [2022-07-21 02:00:08,863 INFO L356 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2022-07-21 02:00:08,864 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 4279 treesize of output 4035 [2022-07-21 02:00:08,917 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:08,918 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2154 treesize of output 1887 [2022-07-21 02:00:13,399 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 8 treesize of output 4 [2022-07-21 02:00:13,744 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 8 treesize of output 4 [2022-07-21 02:00:13,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 8 treesize of output 4 [2022-07-21 02:00:21,951 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 8 treesize of output 4 [2022-07-21 02:00:22,513 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 8 treesize of output 4 [2022-07-21 02:00:22,617 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 8 treesize of output 4 [2022-07-21 02:00:27,384 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 8 treesize of output 4 [2022-07-21 02:00:29,195 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 8 treesize of output 4 [2022-07-21 02:00:29,899 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 8 treesize of output 4 [2022-07-21 02:00:30,019 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 8 treesize of output 4 [2022-07-21 02:00:30,468 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 8 treesize of output 4 [2022-07-21 02:00:31,859 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 8 treesize of output 4 [2022-07-21 02:00:31,988 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 8 treesize of output 4 [2022-07-21 02:00:37,365 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (and (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select v_arrayElimArr_13 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (and (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (and (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse0) (= .cse1 0)) (and (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) is different from false [2022-07-21 02:00:41,069 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 8 treesize of output 4 [2022-07-21 02:00:41,777 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 8 treesize of output 4 [2022-07-21 02:00:41,903 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 8 treesize of output 4 [2022-07-21 02:00:45,555 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 8 treesize of output 4 [2022-07-21 02:00:47,192 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 8 treesize of output 4 [2022-07-21 02:00:48,083 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 8 treesize of output 4 [2022-07-21 02:00:48,254 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 8 treesize of output 4 [2022-07-21 02:00:48,559 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 8 treesize of output 4 [2022-07-21 02:00:49,355 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 8 treesize of output 4 [2022-07-21 02:00:49,515 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 8 treesize of output 4 [2022-07-21 02:00:54,982 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:54,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 134 [2022-07-21 02:00:54,988 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:54,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 104 [2022-07-21 02:00:54,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:55,000 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 449 treesize of output 422 [2022-07-21 02:00:55,012 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:55,012 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 411 treesize of output 395 [2022-07-21 02:00:55,020 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 379 treesize of output 331 [2022-07-21 02:00:55,033 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:55,033 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 476 treesize of output 467 [2022-07-21 02:00:55,042 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 448 treesize of output 424 [2022-07-21 02:00:55,048 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 424 treesize of output 412 [2022-07-21 02:00:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-21 02:00:56,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067712112] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:00:56,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:00:56,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 33 [2022-07-21 02:00:56,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097404686] [2022-07-21 02:00:56,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:00:56,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-21 02:00:56,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:00:56,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-21 02:00:56,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=779, Unknown=3, NotChecked=174, Total=1056 [2022-07-21 02:00:56,056 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:00:58,381 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (let ((.cse3 (= (select (select |c_#memory_int| .cse0) .cse4) 2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) (+ .cse4 4)))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 0) (let ((.cse2 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2) (and (not (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|)) (not .cse2) .cse3))) (= .cse4 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse5 (let ((.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))))) (or (= .cse5 2) (= .cse5 3)))) (not (= 2 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) .cse3 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse1)))) is different from false [2022-07-21 02:01:00,387 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (let ((.cse3 (= (select (select |c_#memory_int| .cse0) .cse4) 2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) (+ .cse4 4)))) (and (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 0) (let ((.cse2 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2) (and (not (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|)) (not .cse2) .cse3))) (= .cse4 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse5 (let ((.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))))) (or (= .cse5 2) (= .cse5 3)))) (not (= 2 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) .cse3 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse1)))) is different from false [2022-07-21 02:01:00,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:01:00,661 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2022-07-21 02:01:00,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 02:01:00,661 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-21 02:01:00,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:01:00,662 INFO L225 Difference]: With dead ends: 93 [2022-07-21 02:01:00,662 INFO L226 Difference]: Without dead ends: 87 [2022-07-21 02:01:00,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=188, Invalid=1379, Unknown=13, NotChecked=400, Total=1980 [2022-07-21 02:01:00,664 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 58 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:01:00,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 366 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 286 Invalid, 0 Unknown, 207 Unchecked, 0.2s Time] [2022-07-21 02:01:00,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-21 02:01:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 62. [2022-07-21 02:01:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2022-07-21 02:01:00,669 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 26 [2022-07-21 02:01:00,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:01:00,669 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2022-07-21 02:01:00,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:01:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-07-21 02:01:00,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 02:01:00,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:01:00,671 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:01:00,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 02:01:00,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-21 02:01:00,884 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:01:00,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:01:00,884 INFO L85 PathProgramCache]: Analyzing trace with hash 268237098, now seen corresponding path program 1 times [2022-07-21 02:01:00,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:01:00,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777849959] [2022-07-21 02:01:00,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:00,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:01:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 02:01:00,907 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 02:01:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 02:01:00,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 02:01:00,958 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 02:01:00,959 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 02:01:00,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 02:01:00,964 INFO L356 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:01:00,968 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 02:01:01,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 02:01:01 BoogieIcfgContainer [2022-07-21 02:01:01,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 02:01:01,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 02:01:01,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 02:01:01,009 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 02:01:01,010 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:59:30" (3/4) ... [2022-07-21 02:01:01,012 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 02:01:01,063 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 02:01:01,063 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 02:01:01,064 INFO L158 Benchmark]: Toolchain (without parser) took 91852.85ms. Allocated memory was 52.4MB in the beginning and 499.1MB in the end (delta: 446.7MB). Free memory was 28.4MB in the beginning and 303.6MB in the end (delta: -275.2MB). Peak memory consumption was 171.2MB. Max. memory is 16.1GB. [2022-07-21 02:01:01,064 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 52.4MB. Free memory was 34.1MB in the beginning and 34.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:01:01,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.67ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 28.2MB in the beginning and 39.4MB in the end (delta: -11.2MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-07-21 02:01:01,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.79ms. Allocated memory is still 62.9MB. Free memory was 39.4MB in the beginning and 37.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:01:01,065 INFO L158 Benchmark]: Boogie Preprocessor took 48.62ms. Allocated memory is still 62.9MB. Free memory was 37.4MB in the beginning and 36.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:01:01,068 INFO L158 Benchmark]: RCFGBuilder took 387.95ms. Allocated memory is still 62.9MB. Free memory was 36.0MB in the beginning and 36.4MB in the end (delta: -462.0kB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2022-07-21 02:01:01,069 INFO L158 Benchmark]: TraceAbstraction took 90825.20ms. Allocated memory was 62.9MB in the beginning and 499.1MB in the end (delta: 436.2MB). Free memory was 35.9MB in the beginning and 305.7MB in the end (delta: -269.8MB). Peak memory consumption was 164.8MB. Max. memory is 16.1GB. [2022-07-21 02:01:01,071 INFO L158 Benchmark]: Witness Printer took 54.17ms. Allocated memory is still 499.1MB. Free memory was 305.7MB in the beginning and 303.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:01:01,076 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.22ms. Allocated memory is still 52.4MB. Free memory was 34.1MB in the beginning and 34.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 464.67ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 28.2MB in the beginning and 39.4MB in the end (delta: -11.2MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.79ms. Allocated memory is still 62.9MB. Free memory was 39.4MB in the beginning and 37.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.62ms. Allocated memory is still 62.9MB. Free memory was 37.4MB in the beginning and 36.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 387.95ms. Allocated memory is still 62.9MB. Free memory was 36.0MB in the beginning and 36.4MB in the end (delta: -462.0kB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * TraceAbstraction took 90825.20ms. Allocated memory was 62.9MB in the beginning and 499.1MB in the end (delta: 436.2MB). Free memory was 35.9MB in the beginning and 305.7MB in the end (delta: -269.8MB). Peak memory consumption was 164.8MB. Max. memory is 16.1GB. * Witness Printer took 54.17ms. Allocated memory is still 499.1MB. Free memory was 305.7MB in the beginning and 303.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 557]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={-1:0}] [L534] List t; [L535] List p = a; VAL [a={-1:0}, p={-1:0}] [L536] COND TRUE __VERIFIER_nondet_int() [L537] p->h = 1 [L538] t = (List) malloc(sizeof(struct node)) [L539] COND FALSE !(t == 0) VAL [a={-1:0}, p={-1:0}, t={-2:0}] [L540] p->n = t [L541] EXPR p->n [L541] p = p->n [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND TRUE __VERIFIER_nondet_int() [L544] p->h = 2 [L545] t = (List) malloc(sizeof(struct node)) [L546] COND FALSE !(t == 0) VAL [a={-1:0}, p={-2:0}, t={-3:0}] [L547] p->n = t [L548] EXPR p->n [L548] p = p->n [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 [L551] p = a VAL [a={-1:0}, p={-1:0}, t={-3:0}] [L552] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=1, t={-3:0}] [L552] COND FALSE !(p->h == 2) [L554] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=1, t={-3:0}] [L554] COND TRUE p->h == 1 [L555] EXPR p->n [L555] p = p->n [L554] EXPR p->h VAL [a={-1:0}, p={-2:0}, p->h=2, t={-3:0}] [L554] COND FALSE !(p->h == 1) [L556] EXPR p->h VAL [a={-1:0}, p={-2:0}, p->h=2, t={-3:0}] [L556] COND TRUE p->h != 3 [L557] reach_error() VAL [a={-1:0}, p={-2:0}, t={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 90.7s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 693 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 693 mSDsluCounter, 1986 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1522 IncrementalHoareTripleChecker+Unchecked, 1718 mSDsCounter, 262 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1784 IncrementalHoareTripleChecker+Invalid, 3568 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 262 mSolverCounterUnsat, 268 mSDtfsCounter, 1784 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 652 GetRequests, 358 SyntacticMatches, 5 SemanticMatches, 289 ConstructedPredicates, 44 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 20.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=14, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 257 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 75.4s InterpolantComputationTime, 558 NumberOfCodeBlocks, 558 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 732 ConstructedInterpolants, 124 QuantifiedInterpolants, 10621 SizeOfPredicates, 111 NumberOfNonLiveVariables, 1436 ConjunctsInSsa, 432 ConjunctsInUnsatCore, 34 InterpolantComputations, 4 PerfectInterpolantSequences, 28/190 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-21 02:01:01,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE