./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list_search-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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_search-1.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 ef935aaf7590747bfbe771bbb249e6b84337edbf0e97024d9de82d0d23d44f30 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:23:41,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:23:41,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:23:41,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:23:41,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:23:41,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:23:41,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:23:41,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:23:41,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:23:41,852 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:23:41,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:23:41,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:23:41,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:23:41,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:23:41,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:23:41,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:23:41,864 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:23:41,865 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:23:41,867 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:23:41,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:23:41,873 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:23:41,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:23:41,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:23:41,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:23:41,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:23:41,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:23:41,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:23:41,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:23:41,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:23:41,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:23:41,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:23:41,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:23:41,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:23:41,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:23:41,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:23:41,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:23:41,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:23:41,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:23:41,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:23:41,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:23:41,891 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:23:41,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:23:41,894 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:23:41,929 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:23:41,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:23:41,932 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:23:41,932 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:23:41,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:23:41,933 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:23:41,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:23:41,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:23:41,934 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:23:41,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:23:41,935 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:23:41,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:23:41,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:23:41,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:23:41,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:23:41,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:23:41,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:23:41,937 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:23:41,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:23:41,937 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:23:41,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:23:41,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:23:41,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:23:41,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:23:41,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:23:41,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:23:41,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:23:41,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:23:41,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:23:41,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:23:41,940 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:23:41,940 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:23:41,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:23:41,940 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 -> ef935aaf7590747bfbe771bbb249e6b84337edbf0e97024d9de82d0d23d44f30 [2022-07-19 14:23:42,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:23:42,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:23:42,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:23:42,211 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:23:42,212 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:23:42,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-1.i [2022-07-19 14:23:42,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efdf731ad/021bd52955ea479e9efe85720dc5745b/FLAG32365c93d [2022-07-19 14:23:42,691 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:23:42,695 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i [2022-07-19 14:23:42,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efdf731ad/021bd52955ea479e9efe85720dc5745b/FLAG32365c93d [2022-07-19 14:23:42,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efdf731ad/021bd52955ea479e9efe85720dc5745b [2022-07-19 14:23:42,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:23:42,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:23:42,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:23:42,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:23:42,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:23:42,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:23:42" (1/1) ... [2022-07-19 14:23:42,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641da2d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:23:42, skipping insertion in model container [2022-07-19 14:23:42,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:23:42" (1/1) ... [2022-07-19 14:23:42,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:23:42,764 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:23:42,906 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_search-1.i[813,826] [2022-07-19 14:23:43,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:23:43,039 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:23:43,049 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_search-1.i[813,826] [2022-07-19 14:23:43,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:23:43,096 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:23:43,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:23:43 WrapperNode [2022-07-19 14:23:43,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:23:43,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:23:43,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:23:43,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:23:43,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:23:43" (1/1) ... [2022-07-19 14:23:43,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:23:43" (1/1) ... [2022-07-19 14:23:43,133 INFO L137 Inliner]: procedures = 125, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2022-07-19 14:23:43,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:23:43,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:23:43,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:23:43,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:23:43,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:23:43" (1/1) ... [2022-07-19 14:23:43,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:23:43" (1/1) ... [2022-07-19 14:23:43,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:23:43" (1/1) ... [2022-07-19 14:23:43,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:23:43" (1/1) ... [2022-07-19 14:23:43,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:23:43" (1/1) ... [2022-07-19 14:23:43,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:23:43" (1/1) ... [2022-07-19 14:23:43,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:23:43" (1/1) ... [2022-07-19 14:23:43,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:23:43,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:23:43,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:23:43,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:23:43,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:23:43" (1/1) ... [2022-07-19 14:23:43,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:23:43,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:23:43,189 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-19 14:23:43,203 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-19 14:23:43,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:23:43,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:23:43,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:23:43,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:23:43,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:23:43,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:23:43,237 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2022-07-19 14:23:43,237 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2022-07-19 14:23:43,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:23:43,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:23:43,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:23:43,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:23:43,316 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:23:43,318 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:23:43,509 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:23:43,514 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:23:43,514 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 14:23:43,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:23:43 BoogieIcfgContainer [2022-07-19 14:23:43,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:23:43,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:23:43,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:23:43,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:23:43,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:23:42" (1/3) ... [2022-07-19 14:23:43,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1f37dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:23:43, skipping insertion in model container [2022-07-19 14:23:43,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:23:43" (2/3) ... [2022-07-19 14:23:43,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1f37dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:23:43, skipping insertion in model container [2022-07-19 14:23:43,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:23:43" (3/3) ... [2022-07-19 14:23:43,535 INFO L111 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2022-07-19 14:23:43,547 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:23:43,563 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:23:43,613 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:23:43,626 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@73caee0b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@25ea6ed2 [2022-07-19 14:23:43,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:23:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 14:23:43,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 14:23:43,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:23:43,649 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:23:43,650 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:23:43,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:23:43,655 INFO L85 PathProgramCache]: Analyzing trace with hash -547062782, now seen corresponding path program 1 times [2022-07-19 14:23:43,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:23:43,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319956409] [2022-07-19 14:23:43,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:43,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:23:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:43,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:23:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:43,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:23:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:44,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 14:23:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:44,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 14:23:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 14:23:44,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:23:44,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319956409] [2022-07-19 14:23:44,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319956409] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:23:44,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994476315] [2022-07-19 14:23:44,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:44,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:23:44,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:23:44,078 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-19 14:23:44,095 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-19 14:23:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:44,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 14:23:44,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:23:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 14:23:44,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:23:44,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994476315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:23:44,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 14:23:44,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2022-07-19 14:23:44,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153439294] [2022-07-19 14:23:44,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:23:44,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:23:44,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:23:44,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:23:44,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:23:44,276 INFO L87 Difference]: Start difference. First operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 14:23:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:23:44,290 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2022-07-19 14:23:44,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:23:44,292 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-07-19 14:23:44,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:23:44,298 INFO L225 Difference]: With dead ends: 38 [2022-07-19 14:23:44,298 INFO L226 Difference]: Without dead ends: 23 [2022-07-19 14:23:44,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:23:44,307 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:23:44,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:23:44,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-19 14:23:44,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-19 14:23:44,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 14:23:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-07-19 14:23:44,346 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 35 [2022-07-19 14:23:44,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:23:44,349 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-07-19 14:23:44,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 14:23:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-07-19 14:23:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:23:44,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:23:44,351 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:23:44,379 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-19 14:23:44,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-19 14:23:44,575 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:23:44,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:23:44,576 INFO L85 PathProgramCache]: Analyzing trace with hash -745059685, now seen corresponding path program 1 times [2022-07-19 14:23:44,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:23:44,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303689925] [2022-07-19 14:23:44,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:44,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:23:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:44,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:23:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:44,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:23:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:44,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 14:23:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:44,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 14:23:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 14:23:44,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:23:44,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303689925] [2022-07-19 14:23:44,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303689925] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:23:44,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038087934] [2022-07-19 14:23:44,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:44,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:23:44,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:23:44,793 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-19 14:23:44,795 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-19 14:23:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:44,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 14:23:44,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:23:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:23:45,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:23:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:23:45,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038087934] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:23:45,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:23:45,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2022-07-19 14:23:45,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514478643] [2022-07-19 14:23:45,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:23:45,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 14:23:45,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:23:45,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 14:23:45,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:23:45,155 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 14:23:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:23:45,276 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-07-19 14:23:45,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:23:45,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-07-19 14:23:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:23:45,281 INFO L225 Difference]: With dead ends: 47 [2022-07-19 14:23:45,282 INFO L226 Difference]: Without dead ends: 29 [2022-07-19 14:23:45,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-07-19 14:23:45,283 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:23:45,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 79 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:23:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-19 14:23:45,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-07-19 14:23:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-19 14:23:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-07-19 14:23:45,297 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 37 [2022-07-19 14:23:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:23:45,297 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-19 14:23:45,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 14:23:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-07-19 14:23:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:23:45,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:23:45,299 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:23:45,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:23:45,526 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,SelfDestructingSolverStorable1 [2022-07-19 14:23:45,527 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:23:45,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:23:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2113798375, now seen corresponding path program 1 times [2022-07-19 14:23:45,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:23:45,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795042191] [2022-07-19 14:23:45,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:45,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:23:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:45,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:23:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:45,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:23:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:45,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 14:23:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:45,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 14:23:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 14:23:45,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:23:45,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795042191] [2022-07-19 14:23:45,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795042191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:23:45,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:23:45,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 14:23:45,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34000832] [2022-07-19 14:23:45,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:23:45,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 14:23:45,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:23:45,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 14:23:45,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 14:23:45,719 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 14:23:45,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:23:45,872 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-07-19 14:23:45,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 14:23:45,872 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-07-19 14:23:45,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:23:45,874 INFO L225 Difference]: With dead ends: 43 [2022-07-19 14:23:45,874 INFO L226 Difference]: Without dead ends: 38 [2022-07-19 14:23:45,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-19 14:23:45,877 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:23:45,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 76 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:23:45,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-19 14:23:45,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2022-07-19 14:23:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-19 14:23:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-07-19 14:23:45,890 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 37 [2022-07-19 14:23:45,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:23:45,891 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-07-19 14:23:45,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 14:23:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-07-19 14:23:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:23:45,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:23:45,895 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:23:45,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 14:23:45,895 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:23:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:23:45,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2056540073, now seen corresponding path program 1 times [2022-07-19 14:23:45,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:23:45,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143731242] [2022-07-19 14:23:45,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:45,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:23:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:45,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:23:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:46,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:23:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:46,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 14:23:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:46,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 14:23:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:46,062 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 14:23:46,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:23:46,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143731242] [2022-07-19 14:23:46,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143731242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:23:46,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:23:46,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 14:23:46,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898030838] [2022-07-19 14:23:46,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:23:46,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:23:46,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:23:46,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:23:46,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:23:46,070 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 14:23:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:23:46,176 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-07-19 14:23:46,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 14:23:46,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-07-19 14:23:46,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:23:46,185 INFO L225 Difference]: With dead ends: 40 [2022-07-19 14:23:46,185 INFO L226 Difference]: Without dead ends: 32 [2022-07-19 14:23:46,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-19 14:23:46,190 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:23:46,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 88 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:23:46,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-19 14:23:46,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-07-19 14:23:46,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-19 14:23:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-19 14:23:46,203 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 37 [2022-07-19 14:23:46,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:23:46,203 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-19 14:23:46,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 14:23:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-19 14:23:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 14:23:46,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:23:46,205 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:23:46,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 14:23:46,205 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:23:46,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:23:46,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1005030197, now seen corresponding path program 1 times [2022-07-19 14:23:46,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:23:46,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190614185] [2022-07-19 14:23:46,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:46,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:23:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:46,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:23:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:46,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:23:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:46,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 14:23:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:46,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 14:23:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 14:23:46,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:23:46,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190614185] [2022-07-19 14:23:46,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190614185] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:23:46,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628296842] [2022-07-19 14:23:46,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:46,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:23:46,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:23:46,625 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-19 14:23:46,649 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-19 14:23:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:46,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-19 14:23:46,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:23:46,825 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-19 14:23:46,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:23:46,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 16 treesize of output 17 [2022-07-19 14:23:46,969 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-19 14:23:46,974 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-19 14:23:47,077 INFO L356 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-07-19 14:23:47,078 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 27 [2022-07-19 14:23:47,095 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-19 14:23:47,096 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 17 treesize of output 17 [2022-07-19 14:23:47,224 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 27 treesize of output 15 [2022-07-19 14:23:47,228 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 15 treesize of output 7 [2022-07-19 14:23:47,267 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:23:47,267 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 29 treesize of output 20 [2022-07-19 14:23:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:23:47,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:23:47,476 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_41 Int) (v_ArrVal_851 (Array Int Int))) (or (not (= (select |c_#valid| v_~head~0.base_41) 0)) (not (= 2 (select (select (store |c_#memory_int| v_~head~0.base_41 v_ArrVal_851) c_~head~0.base) c_~head~0.offset))))) is different from false [2022-07-19 14:23:47,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628296842] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:23:47,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:23:47,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 21 [2022-07-19 14:23:47,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745269220] [2022-07-19 14:23:47,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:23:47,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-19 14:23:47,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:23:47,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-19 14:23:47,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=544, Unknown=1, NotChecked=46, Total=650 [2022-07-19 14:23:47,480 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 14:23:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:23:48,107 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-07-19 14:23:48,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 14:23:48,107 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-07-19 14:23:48,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:23:48,108 INFO L225 Difference]: With dead ends: 48 [2022-07-19 14:23:48,108 INFO L226 Difference]: Without dead ends: 40 [2022-07-19 14:23:48,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=1174, Unknown=1, NotChecked=70, Total=1406 [2022-07-19 14:23:48,109 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 50 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:23:48,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 180 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 14:23:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-19 14:23:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-07-19 14:23:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-19 14:23:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-07-19 14:23:48,128 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 40 [2022-07-19 14:23:48,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:23:48,128 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-07-19 14:23:48,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 14:23:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-07-19 14:23:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 14:23:48,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:23:48,129 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:23:48,162 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-19 14:23:48,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:23:48,330 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:23:48,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:23:48,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2009254361, now seen corresponding path program 2 times [2022-07-19 14:23:48,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:23:48,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816592215] [2022-07-19 14:23:48,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:48,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:23:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:48,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:23:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:48,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:23:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:48,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 14:23:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:48,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 14:23:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:49,005 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:23:49,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:23:49,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816592215] [2022-07-19 14:23:49,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816592215] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:23:49,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744438298] [2022-07-19 14:23:49,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:23:49,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:23:49,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:23:49,009 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-19 14:23:49,015 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-19 14:23:49,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:23:49,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:23:49,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 106 conjunts are in the unsatisfiable core [2022-07-19 14:23:49,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:23:49,191 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-19 14:23:49,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:23:49,226 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 16 treesize of output 17 [2022-07-19 14:23:49,476 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-19 14:23:49,481 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-19 14:23:49,631 INFO L356 Elim1Store]: treesize reduction 36, result has 37.9 percent of original size [2022-07-19 14:23:49,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2022-07-19 14:23:49,646 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 20 treesize of output 22 [2022-07-19 14:23:49,828 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 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-19 14:23:49,848 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 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-19 14:23:49,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:23:49,995 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 61 treesize of output 40 [2022-07-19 14:23:50,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:23:50,006 INFO L356 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2022-07-19 14:23:50,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2022-07-19 14:23:50,012 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 26 treesize of output 21 [2022-07-19 14:23:50,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:23:50,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-07-19 14:23:50,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:23:50,281 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-19 14:23:50,282 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 89 treesize of output 49 [2022-07-19 14:23:50,293 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-19 14:23:50,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-19 14:23:50,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:23:50,349 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 15 treesize of output 10 [2022-07-19 14:23:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:23:50,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:23:50,679 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:23:50,679 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 34 treesize of output 38 [2022-07-19 14:23:50,685 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:23:50,685 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 31 treesize of output 35 [2022-07-19 14:23:50,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744438298] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:23:50,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:23:50,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2022-07-19 14:23:50,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513151023] [2022-07-19 14:23:50,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:23:50,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-19 14:23:50,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:23:50,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-19 14:23:50,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1536, Unknown=0, NotChecked=0, Total=1640 [2022-07-19 14:23:50,754 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 36 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 31 states have internal predecessors, (59), 5 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-19 14:23:51,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:23:51,670 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-07-19 14:23:51,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 14:23:51,676 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 31 states have internal predecessors, (59), 5 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 43 [2022-07-19 14:23:51,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:23:51,676 INFO L225 Difference]: With dead ends: 55 [2022-07-19 14:23:51,677 INFO L226 Difference]: Without dead ends: 50 [2022-07-19 14:23:51,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=240, Invalid=2622, Unknown=0, NotChecked=0, Total=2862 [2022-07-19 14:23:51,678 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:23:51,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 341 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 381 Invalid, 0 Unknown, 84 Unchecked, 0.3s Time] [2022-07-19 14:23:51,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-19 14:23:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-07-19 14:23:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-19 14:23:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-07-19 14:23:51,685 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 43 [2022-07-19 14:23:51,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:23:51,685 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-07-19 14:23:51,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 31 states have internal predecessors, (59), 5 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-19 14:23:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-07-19 14:23:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 14:23:51,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:23:51,686 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:23:51,706 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-19 14:23:51,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:23:51,896 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:23:51,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:23:51,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2066512663, now seen corresponding path program 1 times [2022-07-19 14:23:51,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:23:51,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154739934] [2022-07-19 14:23:51,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:51,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:23:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:52,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:23:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:52,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:23:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:52,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 14:23:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:52,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 14:23:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:23:52,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:23:52,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154739934] [2022-07-19 14:23:52,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154739934] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:23:52,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987938876] [2022-07-19 14:23:52,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:52,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:23:52,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:23:52,248 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-19 14:23:52,249 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-19 14:23:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:52,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-19 14:23:52,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:23:52,465 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-19 14:23:52,492 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-19 14:23:52,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 14:23:52,628 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 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-19 14:23:52,728 INFO L356 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-07-19 14:23:52,728 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 23 treesize of output 28 [2022-07-19 14:23:52,740 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-19 14:23:52,741 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 17 treesize of output 17 [2022-07-19 14:23:52,834 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-19 14:23:52,890 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:23:52,890 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2022-07-19 14:23:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:23:52,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:23:53,050 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:23:53,051 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 16 treesize of output 20 [2022-07-19 14:23:53,058 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_~head~0.base_53 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_53 v_arrayElimArr_6) c_~head~0.base) (+ c_~head~0.offset 4)) 0)) (not (= (select |c_#valid| v_~head~0.base_53) 0)) (not (= (select v_arrayElimArr_6 4) c_~head~0.base)))) is different from false [2022-07-19 14:23:53,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987938876] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:23:53,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:23:53,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 28 [2022-07-19 14:23:53,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821712012] [2022-07-19 14:23:53,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:23:53,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-19 14:23:53,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:23:53,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-19 14:23:53,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=843, Unknown=1, NotChecked=58, Total=992 [2022-07-19 14:23:53,061 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 23 states have internal predecessors, (55), 4 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-19 14:23:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:23:54,058 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2022-07-19 14:23:54,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-19 14:23:54,060 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 23 states have internal predecessors, (55), 4 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 43 [2022-07-19 14:23:54,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:23:54,061 INFO L225 Difference]: With dead ends: 66 [2022-07-19 14:23:54,061 INFO L226 Difference]: Without dead ends: 54 [2022-07-19 14:23:54,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=404, Invalid=2355, Unknown=1, NotChecked=102, Total=2862 [2022-07-19 14:23:54,063 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:23:54,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 291 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 433 Invalid, 0 Unknown, 6 Unchecked, 0.3s Time] [2022-07-19 14:23:54,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-19 14:23:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2022-07-19 14:23:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-19 14:23:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-07-19 14:23:54,070 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 43 [2022-07-19 14:23:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:23:54,070 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-07-19 14:23:54,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 23 states have internal predecessors, (55), 4 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-19 14:23:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-07-19 14:23:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 14:23:54,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:23:54,071 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:23:54,105 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-19 14:23:54,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:23:54,288 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:23:54,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:23:54,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1384296971, now seen corresponding path program 3 times [2022-07-19 14:23:54,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:23:54,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259294531] [2022-07-19 14:23:54,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:54,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:23:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:23:54,328 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 14:23:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:23:54,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 14:23:54,381 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 14:23:54,382 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 14:23:54,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 14:23:54,386 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-07-19 14:23:54,389 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 14:23:54,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 02:23:54 BoogieIcfgContainer [2022-07-19 14:23:54,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 14:23:54,437 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 14:23:54,438 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 14:23:54,438 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 14:23:54,438 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:23:43" (3/4) ... [2022-07-19 14:23:54,440 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 14:23:54,507 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 14:23:54,507 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 14:23:54,508 INFO L158 Benchmark]: Toolchain (without parser) took 11789.09ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 69.2MB in the beginning and 98.4MB in the end (delta: -29.2MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2022-07-19 14:23:54,508 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:23:54,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.71ms. Allocated memory is still 100.7MB. Free memory was 69.2MB in the beginning and 67.8MB in the end (delta: 1.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-19 14:23:54,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.02ms. Allocated memory is still 100.7MB. Free memory was 67.8MB in the beginning and 65.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:23:54,509 INFO L158 Benchmark]: Boogie Preprocessor took 24.60ms. Allocated memory is still 100.7MB. Free memory was 65.9MB in the beginning and 64.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:23:54,509 INFO L158 Benchmark]: RCFGBuilder took 356.76ms. Allocated memory is still 100.7MB. Free memory was 64.6MB in the beginning and 52.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 14:23:54,510 INFO L158 Benchmark]: TraceAbstraction took 10919.18ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 52.2MB in the beginning and 101.5MB in the end (delta: -49.3MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2022-07-19 14:23:54,511 INFO L158 Benchmark]: Witness Printer took 70.17ms. Allocated memory is still 176.2MB. Free memory was 101.5MB in the beginning and 98.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:23:54,512 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.71ms. Allocated memory is still 100.7MB. Free memory was 69.2MB in the beginning and 67.8MB in the end (delta: 1.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.02ms. Allocated memory is still 100.7MB. Free memory was 67.8MB in the beginning and 65.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.60ms. Allocated memory is still 100.7MB. Free memory was 65.9MB in the beginning and 64.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 356.76ms. Allocated memory is still 100.7MB. Free memory was 64.6MB in the beginning and 52.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10919.18ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 52.2MB in the beginning and 101.5MB in the end (delta: -49.3MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * Witness Printer took 70.17ms. Allocated memory is still 176.2MB. Free memory was 101.5MB in the beginning and 98.4MB in the end (delta: 3.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: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L533] mlist *head; VAL [head={0:0}] [L554] int i; [L555] mlist *mylist, *temp; VAL [head={0:0}] [L556] CALL insert_list(mylist,2) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, l={55:64}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, k=2, l={55:64}, l={-1:0}] [L544] COND TRUE head==((void *)0) [L545] l->next = ((void *)0) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, k=2, l={-1:0}, l={55:64}] [L550] head = l [L551] return 0; VAL [\old(head)=0, \old(head)=0, \old(k)=2, \result=0, head={-1:0}, k=2, l={-1:0}, l={55:64}] [L556] RET insert_list(mylist,2) VAL [head={-1:0}, insert_list(mylist,2)=0, mylist={55:64}] [L557] CALL insert_list(mylist,5) VAL [\old(head)=-1, \old(head)=0, \old(k)=5, head={-1:0}, l={55:64}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)=0, \old(head)=-1, \old(k)=5, head={-1:0}, k=5, l={-5:0}, l={55:64}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(head)=0, \old(head)=-1, \old(k)=5, head={-1:0}, k=5, l={-5:0}, l={55:64}] [L550] head = l [L551] return 0; VAL [\old(head)=0, \old(head)=-1, \old(k)=5, \result=0, head={-5:0}, k=5, l={-5:0}, l={55:64}] [L557] RET insert_list(mylist,5) VAL [head={-5:0}, insert_list(mylist,5)=0, mylist={55:64}] [L558] CALL insert_list(mylist,1) VAL [\old(head)=0, \old(head)=-5, \old(k)=1, head={-5:0}, l={55:64}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)=-5, \old(head)=0, \old(k)=1, head={-5:0}, k=1, l={-3:0}, l={55:64}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(head)=-5, \old(head)=0, \old(k)=1, head={-5:0}, k=1, l={55:64}, l={-3:0}] [L550] head = l [L551] return 0; VAL [\old(head)=0, \old(head)=-5, \old(k)=1, \result=0, head={-3:0}, k=1, l={-3:0}, l={55:64}] [L558] RET insert_list(mylist,1) VAL [head={-3:0}, insert_list(mylist,1)=0, mylist={55:64}] [L559] CALL insert_list(mylist,3) VAL [\old(head)=0, \old(head)=-3, \old(k)=3, head={-3:0}, l={55:64}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)=0, \old(head)=-3, \old(k)=3, head={-3:0}, k=3, l={-4:0}, l={55:64}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(head)=-3, \old(head)=0, \old(k)=3, head={-3:0}, k=3, l={55:64}, l={-4:0}] [L550] head = l [L551] return 0; VAL [\old(head)=-3, \old(head)=0, \old(k)=3, \result=0, head={-4:0}, k=3, l={-4:0}, l={55:64}] [L559] RET insert_list(mylist,3) VAL [head={-4:0}, insert_list(mylist,3)=0, mylist={55:64}] [L560] CALL, EXPR search_list(head,2) [L535] l = head VAL [\old(k)=2, head={-4:0}, k=2, l={-4:0}, l={-4:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-4:0}, k=2, l={-4:0}, l={-4:0}, l!=((void *)0) && l->key!=k=1, l->key=3] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-4:0}, k=2, l={-4:0}, l={-3:0}, l!=((void *)0) && l->key!=k=1, l->key=1] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-4:0}, k=2, l={-4:0}, l={-5:0}, l!=((void *)0) && l->key!=k=1, l->key=5] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-4:0}, k=2, l={-1:0}, l={-4:0}, l!=((void *)0) && l->key!=k=0, l->key=2] [L536] COND FALSE !(l!=((void *)0) && l->key!=k) [L539] return l; VAL [\old(k)=2, \result={-1:0}, head={-4:0}, k=2, l={-1:0}, l={-4:0}] [L560] RET, EXPR search_list(head,2) [L560] temp = search_list(head,2) [L561] EXPR temp->key [L561] CALL __VERIFIER_assert(temp->key==1) [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, head={-4:0}] [L15] reach_error() VAL [\old(cond)=0, cond=0, head={-4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 1089 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 90 IncrementalHoareTripleChecker+Unchecked, 945 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1371 IncrementalHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 144 mSDtfsCounter, 1371 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 272 SyntacticMatches, 15 SemanticMatches, 178 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=7, InterpolantAutomatonStates: 94, 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, 7 MinimizatonAttempts, 23 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 494 ConstructedInterpolants, 10 QuantifiedInterpolants, 4975 SizeOfPredicates, 50 NumberOfNonLiveVariables, 1950 ConjunctsInSsa, 249 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 280/432 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-19 14:23:54,544 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