./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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-simple/sll2n_insert_equal.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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:49:05,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:49:05,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:49:05,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:49:05,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:49:05,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:49:05,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:49:05,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:49:05,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:49:05,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:49:05,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:49:05,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:49:05,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:49:05,680 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:49:05,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:49:05,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:49:05,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:49:05,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:49:05,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:49:05,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:49:05,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:49:05,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:49:05,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:49:05,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:49:05,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:49:05,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:49:05,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:49:05,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:49:05,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:49:05,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:49:05,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:49:05,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:49:05,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:49:05,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:49:05,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:49:05,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:49:05,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:49:05,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:49:05,712 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:49:05,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:49:05,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:49:05,715 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:49:05,757 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:49:05,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:49:05,758 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:49:05,758 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:49:05,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:49:05,759 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:49:05,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:49:05,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:49:05,760 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:49:05,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:49:05,761 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:49:05,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:49:05,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:49:05,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:49:05,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:49:05,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:49:05,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:49:05,762 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:49:05,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:49:05,762 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:49:05,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:49:05,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:49:05,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:49:05,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:49:05,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:49:05,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:49:05,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:49:05,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:49:05,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:49:05,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:49:05,764 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:49:05,765 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:49:05,765 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:49:05,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:49:05,765 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:49:05,765 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2023-02-15 10:49:05,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:49:05,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:49:05,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:49:05,986 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:49:05,986 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:49:05,988 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2023-02-15 10:49:07,211 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:49:07,433 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:49:07,434 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2023-02-15 10:49:07,445 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e7c62661/7df4d9058ddb4f6897dedeb9cabd1a5e/FLAGac7ac77fe [2023-02-15 10:49:07,458 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e7c62661/7df4d9058ddb4f6897dedeb9cabd1a5e [2023-02-15 10:49:07,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:49:07,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:49:07,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:49:07,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:49:07,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:49:07,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:49:07" (1/1) ... [2023-02-15 10:49:07,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54936f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:07, skipping insertion in model container [2023-02-15 10:49:07,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:49:07" (1/1) ... [2023-02-15 10:49:07,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:49:07,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:49:07,799 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2023-02-15 10:49:07,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:49:07,820 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:49:07,879 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2023-02-15 10:49:07,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:49:07,909 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:49:07,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:07 WrapperNode [2023-02-15 10:49:07,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:49:07,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:49:07,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:49:07,912 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:49:07,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:07" (1/1) ... [2023-02-15 10:49:07,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:07" (1/1) ... [2023-02-15 10:49:07,962 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2023-02-15 10:49:07,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:49:07,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:49:07,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:49:07,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:49:07,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:07" (1/1) ... [2023-02-15 10:49:07,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:07" (1/1) ... [2023-02-15 10:49:07,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:07" (1/1) ... [2023-02-15 10:49:07,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:07" (1/1) ... [2023-02-15 10:49:07,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:07" (1/1) ... [2023-02-15 10:49:08,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:07" (1/1) ... [2023-02-15 10:49:08,002 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:07" (1/1) ... [2023-02-15 10:49:08,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:07" (1/1) ... [2023-02-15 10:49:08,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:49:08,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:49:08,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:49:08,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:49:08,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:07" (1/1) ... [2023-02-15 10:49:08,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:49:08,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:49:08,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:49:08,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:49:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:49:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:49:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 10:49:08,086 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 10:49:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:49:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:49:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 10:49:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 10:49:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 10:49:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 10:49:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 10:49:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:49:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:49:08,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:49:08,229 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:49:08,231 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:49:08,442 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:49:08,448 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:49:08,449 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 10:49:08,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:49:08 BoogieIcfgContainer [2023-02-15 10:49:08,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:49:08,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:49:08,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:49:08,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:49:08,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:49:07" (1/3) ... [2023-02-15 10:49:08,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190ba498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:49:08, skipping insertion in model container [2023-02-15 10:49:08,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:07" (2/3) ... [2023-02-15 10:49:08,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190ba498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:49:08, skipping insertion in model container [2023-02-15 10:49:08,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:49:08" (3/3) ... [2023-02-15 10:49:08,459 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2023-02-15 10:49:08,476 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:49:08,476 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:49:08,526 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:49:08,534 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@199cf263, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:49:08,534 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:49:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 10:49:08,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 10:49:08,544 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:49:08,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:49:08,545 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:49:08,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:49:08,549 INFO L85 PathProgramCache]: Analyzing trace with hash -497301104, now seen corresponding path program 1 times [2023-02-15 10:49:08,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:49:08,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700066877] [2023-02-15 10:49:08,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:49:08,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:49:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:08,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:49:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:49:08,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:49:08,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700066877] [2023-02-15 10:49:08,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700066877] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:49:08,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:49:08,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:49:08,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821527169] [2023-02-15 10:49:08,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:49:08,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:49:08,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:49:08,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:49:08,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:49:08,977 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:49:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:49:09,031 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2023-02-15 10:49:09,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:49:09,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-02-15 10:49:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:49:09,039 INFO L225 Difference]: With dead ends: 54 [2023-02-15 10:49:09,039 INFO L226 Difference]: Without dead ends: 24 [2023-02-15 10:49:09,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:49:09,045 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:49:09,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:49:09,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-02-15 10:49:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-02-15 10:49:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 10:49:09,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-02-15 10:49:09,076 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 19 [2023-02-15 10:49:09,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:49:09,077 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-02-15 10:49:09,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:49:09,077 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-02-15 10:49:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 10:49:09,079 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:49:09,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:49:09,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:49:09,079 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:49:09,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:49:09,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1988891516, now seen corresponding path program 1 times [2023-02-15 10:49:09,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:49:09,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311466276] [2023-02-15 10:49:09,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:49:09,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:49:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:09,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:49:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:49:09,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:49:09,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311466276] [2023-02-15 10:49:09,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311466276] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:49:09,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:49:09,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:49:09,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419674113] [2023-02-15 10:49:09,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:49:09,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:49:09,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:49:09,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:49:09,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:49:09,304 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:49:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:49:09,348 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2023-02-15 10:49:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:49:09,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-02-15 10:49:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:49:09,351 INFO L225 Difference]: With dead ends: 46 [2023-02-15 10:49:09,354 INFO L226 Difference]: Without dead ends: 28 [2023-02-15 10:49:09,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:49:09,361 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:49:09,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:49:09,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-15 10:49:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2023-02-15 10:49:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 10:49:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-02-15 10:49:09,370 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 19 [2023-02-15 10:49:09,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:49:09,371 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-02-15 10:49:09,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:49:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-02-15 10:49:09,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 10:49:09,372 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:49:09,372 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:49:09,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:49:09,372 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:49:09,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:49:09,373 INFO L85 PathProgramCache]: Analyzing trace with hash 208174980, now seen corresponding path program 1 times [2023-02-15 10:49:09,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:49:09,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622594496] [2023-02-15 10:49:09,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:49:09,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:49:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:09,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:49:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:09,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 10:49:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:09,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:49:09,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:49:09,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622594496] [2023-02-15 10:49:09,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622594496] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:49:09,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506965927] [2023-02-15 10:49:09,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:49:09,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:49:09,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:49:09,589 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:49:09,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:49:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:09,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 10:49:09,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:49:09,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:49:09,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:49:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:49:09,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506965927] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:49:09,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:49:09,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-15 10:49:09,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763703453] [2023-02-15 10:49:09,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:49:09,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:49:09,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:49:09,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:49:09,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:49:09,864 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 10:49:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:49:09,931 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2023-02-15 10:49:09,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:49:09,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2023-02-15 10:49:09,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:49:09,933 INFO L225 Difference]: With dead ends: 47 [2023-02-15 10:49:09,933 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 10:49:09,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:49:09,937 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:49:09,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 64 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:49:09,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 10:49:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-15 10:49:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 10:49:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-02-15 10:49:09,950 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 28 [2023-02-15 10:49:09,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:49:09,950 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-02-15 10:49:09,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 10:49:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-02-15 10:49:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 10:49:09,954 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:49:09,954 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:49:09,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:49:10,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:49:10,161 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:49:10,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:49:10,161 INFO L85 PathProgramCache]: Analyzing trace with hash -941011836, now seen corresponding path program 2 times [2023-02-15 10:49:10,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:49:10,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209069395] [2023-02-15 10:49:10,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:49:10,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:49:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:10,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:49:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:10,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 10:49:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:10,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 10:49:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 10:49:10,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:49:10,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209069395] [2023-02-15 10:49:10,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209069395] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:49:10,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:49:10,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:49:10,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978761306] [2023-02-15 10:49:10,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:49:10,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:49:10,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:49:10,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:49:10,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:49:10,263 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 10:49:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:49:10,288 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2023-02-15 10:49:10,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:49:10,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2023-02-15 10:49:10,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:49:10,290 INFO L225 Difference]: With dead ends: 45 [2023-02-15 10:49:10,290 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 10:49:10,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:49:10,291 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:49:10,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:49:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 10:49:10,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2023-02-15 10:49:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 10:49:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-02-15 10:49:10,296 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 37 [2023-02-15 10:49:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:49:10,297 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-02-15 10:49:10,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 10:49:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-02-15 10:49:10,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 10:49:10,298 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:49:10,298 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:49:10,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 10:49:10,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:49:10,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:49:10,299 INFO L85 PathProgramCache]: Analyzing trace with hash -883753534, now seen corresponding path program 1 times [2023-02-15 10:49:10,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:49:10,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280701013] [2023-02-15 10:49:10,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:49:10,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:49:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:10,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:49:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:10,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 10:49:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:10,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 10:49:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 10:49:10,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:49:10,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280701013] [2023-02-15 10:49:10,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280701013] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:49:10,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:49:10,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:49:10,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467809994] [2023-02-15 10:49:10,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:49:10,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:49:10,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:49:10,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:49:10,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:49:10,491 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 10:49:10,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:49:10,523 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2023-02-15 10:49:10,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:49:10,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2023-02-15 10:49:10,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:49:10,525 INFO L225 Difference]: With dead ends: 38 [2023-02-15 10:49:10,525 INFO L226 Difference]: Without dead ends: 30 [2023-02-15 10:49:10,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:49:10,526 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:49:10,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:49:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-15 10:49:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-15 10:49:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 10:49:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-15 10:49:10,531 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 37 [2023-02-15 10:49:10,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:49:10,531 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-15 10:49:10,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 10:49:10,532 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-15 10:49:10,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 10:49:10,533 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:49:10,533 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:49:10,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 10:49:10,533 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:49:10,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:49:10,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1457377551, now seen corresponding path program 1 times [2023-02-15 10:49:10,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:49:10,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89737127] [2023-02-15 10:49:10,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:49:10,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:49:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:11,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:49:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:11,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 10:49:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:11,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 10:49:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:49:11,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:49:11,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89737127] [2023-02-15 10:49:11,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89737127] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:49:11,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886404101] [2023-02-15 10:49:11,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:49:11,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:49:11,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:49:11,357 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:49:11,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:49:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:11,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 10:49:11,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:49:11,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-15 10:49:11,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:49:11,869 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 17 [2023-02-15 10:49:12,071 INFO L321 Elim1Store]: treesize reduction 36, result has 56.6 percent of original size [2023-02-15 10:49:12,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 63 [2023-02-15 10:49:18,440 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 63 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:49:18,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:49:18,575 INFO L321 Elim1Store]: treesize reduction 72, result has 54.1 percent of original size [2023-02-15 10:49:18,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 79 treesize of output 155 [2023-02-15 10:49:20,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 10:49:24,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-15 10:49:24,421 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:25,400 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:27,014 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:27,399 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:33,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 10:49:33,867 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:36,471 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:36,474 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:36,478 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:36,504 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:36,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 10:49:36,519 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:36,522 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:37,467 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:37,476 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:37,478 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:37,555 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:37,556 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:37,764 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:37,874 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:37,943 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:38,026 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:38,102 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:38,122 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:38,130 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:38,218 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:38,231 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:38,401 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:38,450 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:38,475 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:38,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2023-02-15 10:49:38,687 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:38,726 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:38,728 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:38,757 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:38,759 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:38,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 96 [2023-02-15 10:49:38,952 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:38,975 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,028 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,089 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,101 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,140 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,142 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,144 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,149 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,152 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,159 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,161 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,255 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,411 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,440 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,509 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,516 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,611 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,612 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,614 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,879 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,886 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,889 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,896 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,897 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,902 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:39,911 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:40,004 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:40,006 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:40,010 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:49:40,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 10:49:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 10:49:40,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:49:40,894 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int)) (|ULTIMATE.start_sll_insert_~head#1.base| Int) (v_ArrVal_551 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| Int) (|ULTIMATE.start_sll_insert_~head#1.offset| Int) (|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| |c_#StackHeapBarrier|)) (= 0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11|) (not (= 0 (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| v_ArrVal_551))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11|)))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| v_ArrVal_548) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 10:49:40,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886404101] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:49:40,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:49:40,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2023-02-15 10:49:40,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905994632] [2023-02-15 10:49:40,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:49:40,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 10:49:40,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:49:40,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 10:49:40,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1045, Unknown=20, NotChecked=66, Total=1260 [2023-02-15 10:49:40,901 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 31 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 25 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 10:49:46,950 WARN L233 SmtUtils]: Spent 5.54s on a formula simplification. DAG size of input: 72 DAG size of output: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:49:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:49:50,022 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2023-02-15 10:49:50,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 10:49:50,023 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 25 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2023-02-15 10:49:50,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:49:50,024 INFO L225 Difference]: With dead ends: 55 [2023-02-15 10:49:50,024 INFO L226 Difference]: Without dead ends: 48 [2023-02-15 10:49:50,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=353, Invalid=1983, Unknown=20, NotChecked=94, Total=2450 [2023-02-15 10:49:50,026 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 213 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:49:50,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 168 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 10:49:50,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-15 10:49:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2023-02-15 10:49:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 10:49:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2023-02-15 10:49:50,033 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 38 [2023-02-15 10:49:50,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:49:50,034 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2023-02-15 10:49:50,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 25 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 10:49:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2023-02-15 10:49:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 10:49:50,035 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:49:50,035 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:49:50,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 10:49:50,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-15 10:49:50,241 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:49:50,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:49:50,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1457379225, now seen corresponding path program 1 times [2023-02-15 10:49:50,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:49:50,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450885138] [2023-02-15 10:49:50,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:49:50,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:49:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:51,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:49:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:51,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 10:49:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:51,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 10:49:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:51,666 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:49:51,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:49:51,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450885138] [2023-02-15 10:49:51,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450885138] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:49:51,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971306807] [2023-02-15 10:49:51,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:49:51,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:49:51,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:49:51,669 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:49:51,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:49:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:52,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 126 conjunts are in the unsatisfiable core [2023-02-15 10:49:52,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:49:52,051 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:49:52,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 10:49:52,195 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:49:52,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-15 10:49:52,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 10:49:52,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:49:52,385 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:49:52,386 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-02-15 10:49:52,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:49:52,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 10:49:52,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2023-02-15 10:49:52,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:49:52,647 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 10:49:52,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:49:52,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-02-15 10:49:52,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:49:52,843 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 10:49:52,843 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 18 [2023-02-15 10:49:52,850 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2023-02-15 10:49:52,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:49:52,869 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-15 10:49:53,109 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:49:53,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 71 [2023-02-15 10:49:53,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:49:53,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-02-15 10:49:53,125 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 27 [2023-02-15 10:49:53,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:49:53,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2023-02-15 10:49:53,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:49:53,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2023-02-15 10:49:53,242 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2023-02-15 10:49:53,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2023-02-15 10:49:53,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2023-02-15 10:49:53,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:49:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 10:49:53,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:49:53,508 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_727 Int) (v_ArrVal_730 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 v_ArrVal_727)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_728) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 10:49:53,537 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10| Int) (v_ArrVal_727 Int) (v_ArrVal_730 (Array Int Int))) (or (not (<= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 v_ArrVal_727)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_728) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-02-15 10:49:54,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971306807] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:49:54,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:49:54,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2023-02-15 10:49:54,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926919931] [2023-02-15 10:49:54,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:49:54,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-02-15 10:49:54,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:49:54,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-02-15 10:49:54,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1620, Unknown=62, NotChecked=166, Total=1980 [2023-02-15 10:49:54,247 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 32 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 10:49:55,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:49:55,624 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2023-02-15 10:49:55,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 10:49:55,625 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 32 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2023-02-15 10:49:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:49:55,627 INFO L225 Difference]: With dead ends: 45 [2023-02-15 10:49:55,627 INFO L226 Difference]: Without dead ends: 43 [2023-02-15 10:49:55,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=349, Invalid=2782, Unknown=69, NotChecked=222, Total=3422 [2023-02-15 10:49:55,629 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 170 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:49:55,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 243 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 10:49:55,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-15 10:49:55,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2023-02-15 10:49:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 10:49:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2023-02-15 10:49:55,637 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 38 [2023-02-15 10:49:55,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:49:55,637 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2023-02-15 10:49:55,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 32 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 10:49:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2023-02-15 10:49:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 10:49:55,638 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:49:55,639 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:49:55,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 10:49:55,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:49:55,849 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:49:55,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:49:55,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1501961106, now seen corresponding path program 2 times [2023-02-15 10:49:55,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:49:55,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365566423] [2023-02-15 10:49:55,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:49:55,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:49:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:55,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:49:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:55,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 10:49:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:56,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 10:49:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 10:49:56,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:49:56,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365566423] [2023-02-15 10:49:56,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365566423] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:49:56,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:49:56,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 10:49:56,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127568925] [2023-02-15 10:49:56,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:49:56,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:49:56,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:49:56,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:49:56,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:49:56,014 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 10:49:56,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:49:56,055 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-02-15 10:49:56,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 10:49:56,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2023-02-15 10:49:56,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:49:56,058 INFO L225 Difference]: With dead ends: 42 [2023-02-15 10:49:56,058 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 10:49:56,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-15 10:49:56,059 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:49:56,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 55 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:49:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 10:49:56,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-15 10:49:56,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 10:49:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-02-15 10:49:56,076 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 39 [2023-02-15 10:49:56,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:49:56,076 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-02-15 10:49:56,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 10:49:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-02-15 10:49:56,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 10:49:56,080 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:49:56,080 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:49:56,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 10:49:56,081 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:49:56,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:49:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash 382129514, now seen corresponding path program 1 times [2023-02-15 10:49:56,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:49:56,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923901835] [2023-02-15 10:49:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:49:56,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:49:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:56,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 10:49:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:56,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 10:49:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:57,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 10:49:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:49:57,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:49:57,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923901835] [2023-02-15 10:49:57,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923901835] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:49:57,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517957567] [2023-02-15 10:49:57,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:49:57,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:49:57,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:49:57,177 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:49:57,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:49:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:49:57,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 104 conjunts are in the unsatisfiable core [2023-02-15 10:49:57,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:49:57,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-15 10:49:57,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2023-02-15 10:49:57,774 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:49:57,774 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 20 [2023-02-15 10:49:57,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-15 10:49:57,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:49:57,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:49:57,955 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:49:57,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2023-02-15 10:49:57,969 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 10:49:57,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 10:49:57,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:49:57,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:49:58,303 INFO L321 Elim1Store]: treesize reduction 88, result has 50.6 percent of original size [2023-02-15 10:49:58,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 93 treesize of output 138 [2023-02-15 10:49:58,326 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 10:49:58,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 10:51:01,814 WARN L233 SmtUtils]: Spent 51.15s on a formula simplification. DAG size of input: 195 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:51:01,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:51:13,455 WARN L233 SmtUtils]: Spent 11.60s on a formula simplification. DAG size of input: 1026 DAG size of output: 816 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-02-15 10:51:13,458 INFO L321 Elim1Store]: treesize reduction 696, result has 71.7 percent of original size [2023-02-15 10:51:13,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 2 disjoint index pairs (out of 153 index pairs), introduced 25 new quantified variables, introduced 170 case distinctions, treesize of input 468 treesize of output 2035 [2023-02-15 10:51:13,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:51:13,819 INFO L217 Elim1Store]: Index analysis took 286 ms [2023-02-15 10:51:15,239 INFO L321 Elim1Store]: treesize reduction 138, result has 65.7 percent of original size [2023-02-15 10:51:15,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 310 treesize of output 557