./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_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 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:42:56,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:42:56,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:42:56,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:42:56,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:42:56,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:42:56,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:42:56,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:42:56,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:42:56,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:42:56,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:42:56,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:42:56,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:42:56,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:42:56,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:42:56,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:42:56,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:42:56,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:42:56,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:42:56,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:42:56,936 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:42:56,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:42:56,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:42:56,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:42:56,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:42:56,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:42:56,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:42:56,945 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:42:56,946 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:42:56,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:42:56,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:42:56,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:42:56,949 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:42:56,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:42:56,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:42:56,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:42:56,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:42:56,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:42:56,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:42:56,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:42:56,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:42:56,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:42:56,955 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:42:56,985 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:42:56,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:42:56,986 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:42:56,986 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:42:56,987 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:42:56,987 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:42:56,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:42:56,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:42:56,989 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:42:56,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:42:56,990 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:42:56,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:42:56,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:42:56,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:42:56,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:42:56,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:42:56,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:42:56,991 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:42:56,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:42:56,992 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:42:56,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:42:56,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:42:56,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:42:56,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:42:56,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:42:56,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:42:56,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:42:56,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:42:56,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:42:56,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:42:56,994 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:42:56,994 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:42:56,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:42:56,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2022-07-19 14:42:57,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:42:57,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:42:57,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:42:57,299 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:42:57,299 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:42:57,300 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2022-07-19 14:42:57,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7097363a/3cb20a67a9864846b4c63334ff10db41/FLAG77d4cb37b [2022-07-19 14:42:57,796 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:42:57,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2022-07-19 14:42:57,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7097363a/3cb20a67a9864846b4c63334ff10db41/FLAG77d4cb37b [2022-07-19 14:42:58,144 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7097363a/3cb20a67a9864846b4c63334ff10db41 [2022-07-19 14:42:58,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:42:58,147 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:42:58,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:42:58,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:42:58,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:42:58,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702584ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58, skipping insertion in model container [2022-07-19 14:42:58,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:42:58,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:42:58,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2022-07-19 14:42:58,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:42:58,462 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:42:58,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2022-07-19 14:42:58,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:42:58,529 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:42:58,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58 WrapperNode [2022-07-19 14:42:58,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:42:58,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:42:58,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:42:58,531 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:42:58,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,592 INFO L137 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2022-07-19 14:42:58,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:42:58,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:42:58,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:42:58,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:42:58,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:42:58,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:42:58,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:42:58,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:42:58,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:42:58,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:58,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 14:42:58,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 14:42:58,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:42:58,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:42:58,689 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-19 14:42:58,689 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-19 14:42:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:42:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:42:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:42:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:42:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:42:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:42:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 14:42:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:42:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:42:58,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:42:58,815 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:42:58,817 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:42:59,024 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:42:59,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:42:59,029 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-19 14:42:59,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:42:59 BoogieIcfgContainer [2022-07-19 14:42:59,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:42:59,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:42:59,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:42:59,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:42:59,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:42:58" (1/3) ... [2022-07-19 14:42:59,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c9cba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:42:59, skipping insertion in model container [2022-07-19 14:42:59,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (2/3) ... [2022-07-19 14:42:59,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c9cba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:42:59, skipping insertion in model container [2022-07-19 14:42:59,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:42:59" (3/3) ... [2022-07-19 14:42:59,046 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2022-07-19 14:42:59,058 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:42:59,058 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:42:59,113 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:42:59,124 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@13825a7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12d4d572 [2022-07-19 14:42:59,124 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:42:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:42:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 14:42:59,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:59,152 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] [2022-07-19 14:42:59,152 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:59,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:59,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1369192097, now seen corresponding path program 1 times [2022-07-19 14:42:59,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:59,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782517344] [2022-07-19 14:42:59,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:59,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:59,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:42:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:59,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 14:42:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:42:59,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:59,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782517344] [2022-07-19 14:42:59,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782517344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:42:59,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:42:59,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:42:59,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055433073] [2022-07-19 14:42:59,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:42:59,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:42:59,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:59,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:42:59,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:42:59,502 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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) [2022-07-19 14:42:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:59,578 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2022-07-19 14:42:59,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:42:59,580 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), 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 25 [2022-07-19 14:42:59,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:59,586 INFO L225 Difference]: With dead ends: 65 [2022-07-19 14:42:59,586 INFO L226 Difference]: Without dead ends: 28 [2022-07-19 14:42:59,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:42:59,593 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:59,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:42:59,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-19 14:42:59,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-19 14:42:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 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) [2022-07-19 14:42:59,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-07-19 14:42:59,632 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 25 [2022-07-19 14:42:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:59,633 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-19 14:42:59,634 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), 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) [2022-07-19 14:42:59,634 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-07-19 14:42:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 14:42:59,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:59,636 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] [2022-07-19 14:42:59,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:42:59,637 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:59,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:59,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1579482442, now seen corresponding path program 1 times [2022-07-19 14:42:59,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:59,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268344511] [2022-07-19 14:42:59,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:59,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:59,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:42:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:59,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 14:42:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:42:59,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:59,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268344511] [2022-07-19 14:42:59,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268344511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:42:59,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:42:59,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:42:59,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208755606] [2022-07-19 14:42:59,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:42:59,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:42:59,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:59,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:42:59,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:42:59,828 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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) [2022-07-19 14:42:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:59,887 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2022-07-19 14:42:59,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:42:59,889 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), 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 25 [2022-07-19 14:42:59,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:59,892 INFO L225 Difference]: With dead ends: 52 [2022-07-19 14:42:59,892 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 14:42:59,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:42:59,898 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:59,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:42:59,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 14:42:59,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-07-19 14:42:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 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) [2022-07-19 14:42:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-07-19 14:42:59,915 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 25 [2022-07-19 14:42:59,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:59,915 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-07-19 14:42:59,916 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), 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) [2022-07-19 14:42:59,916 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-07-19 14:42:59,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-19 14:42:59,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:59,918 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:42:59,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:42:59,918 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:59,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:59,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1638915570, now seen corresponding path program 1 times [2022-07-19 14:42:59,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:59,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985469853] [2022-07-19 14:42:59,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:59,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:00,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:43:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:00,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:43:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:00,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:43:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 14:43:00,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:43:00,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985469853] [2022-07-19 14:43:00,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985469853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:43:00,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:43:00,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:43:00,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960726063] [2022-07-19 14:43:00,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:43:00,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:43:00,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:43:00,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:43:00,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:43:00,093 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 14:43:00,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:43:00,135 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-07-19 14:43:00,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:43:00,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-07-19 14:43:00,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:43:00,137 INFO L225 Difference]: With dead ends: 47 [2022-07-19 14:43:00,137 INFO L226 Difference]: Without dead ends: 39 [2022-07-19 14:43:00,137 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 [2022-07-19 14:43:00,138 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:43:00,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 87 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:43:00,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-19 14:43:00,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2022-07-19 14:43:00,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:43:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-19 14:43:00,150 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 33 [2022-07-19 14:43:00,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:43:00,150 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-19 14:43:00,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 14:43:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-07-19 14:43:00,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 14:43:00,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:43:00,152 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:43:00,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 14:43:00,152 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:43:00,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:43:00,153 INFO L85 PathProgramCache]: Analyzing trace with hash 802467380, now seen corresponding path program 1 times [2022-07-19 14:43:00,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:43:00,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492673662] [2022-07-19 14:43:00,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:00,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:43:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:00,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:43:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:00,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:43:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:00,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:43:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:43:01,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:43:01,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492673662] [2022-07-19 14:43:01,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492673662] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:01,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113148790] [2022-07-19 14:43:01,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:01,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:43:01,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:43:01,107 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:43:01,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 14:43:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:01,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 148 conjunts are in the unsatisfiable core [2022-07-19 14:43:01,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:01,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 14:43:01,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:43:01,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 14:43:01,694 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:43:01,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:01,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 14:43:01,865 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:43:01,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 14:43:01,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-19 14:43:02,085 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:43:02,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:43:02,097 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 14:43:02,127 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-19 14:43:02,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-07-19 14:43:02,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 28 [2022-07-19 14:43:02,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:02,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 28 [2022-07-19 14:43:02,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-07-19 14:43:02,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 14:43:02,653 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:43:02,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-07-19 14:43:02,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:02,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-07-19 14:43:02,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:02,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:02,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-19 14:43:02,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:02,926 INFO L356 Elim1Store]: treesize reduction 16, result has 44.8 percent of original size [2022-07-19 14:43:02,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 25 [2022-07-19 14:43:02,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:02,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:43:03,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:03,325 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-19 14:43:03,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 84 [2022-07-19 14:43:03,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:03,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2022-07-19 14:43:03,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2022-07-19 14:43:03,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-19 14:43:03,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:03,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-19 14:43:03,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2022-07-19 14:43:03,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-19 14:43:03,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2022-07-19 14:43:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:43:03,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:43:03,654 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array Int Int)) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_437 Int) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_437)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_440) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_432) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_434) |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_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-07-19 14:43:03,670 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| Int) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_437 Int) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| v_ArrVal_437)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_440) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_432) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_434) |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_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2022-07-19 14:43:03,694 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| Int) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_437 Int) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6|) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| v_ArrVal_437)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_440) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_432) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2022-07-19 14:43:03,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| Int) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| Int) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_437 Int) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_448))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_450))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_449))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| v_ArrVal_437))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_440) (select (select (store (store .cse2 .cse1 v_ArrVal_432) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_434) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (< (select (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8|) 0)) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| |c_#StackHeapBarrier|))))) is different from false [2022-07-19 14:43:03,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113148790] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:03,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:43:03,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2022-07-19 14:43:03,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074424194] [2022-07-19 14:43:03,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:43:03,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-19 14:43:03,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:43:03,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-19 14:43:03,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1928, Unknown=6, NotChecked=364, Total=2450 [2022-07-19 14:43:03,815 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 44 states, 40 states have (on average 1.35) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:43:04,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:43:04,383 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-07-19 14:43:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 14:43:04,384 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.35) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2022-07-19 14:43:04,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:43:04,386 INFO L225 Difference]: With dead ends: 48 [2022-07-19 14:43:04,386 INFO L226 Difference]: Without dead ends: 46 [2022-07-19 14:43:04,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=188, Invalid=2272, Unknown=6, NotChecked=396, Total=2862 [2022-07-19 14:43:04,388 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:43:04,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 326 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 382 Invalid, 0 Unknown, 91 Unchecked, 0.3s Time] [2022-07-19 14:43:04,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-19 14:43:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-07-19 14:43:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:43:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-07-19 14:43:04,396 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 34 [2022-07-19 14:43:04,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:43:04,396 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2022-07-19 14:43:04,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.35) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:43:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-07-19 14:43:04,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 14:43:04,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:43:04,398 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:43:04,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 14:43:04,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:43:04,624 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:43:04,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:43:04,624 INFO L85 PathProgramCache]: Analyzing trace with hash 642377266, now seen corresponding path program 2 times [2022-07-19 14:43:04,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:43:04,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046848595] [2022-07-19 14:43:04,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:04,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:43:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:04,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:43:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:04,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:43:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:04,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:43:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 14:43:04,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:43:04,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046848595] [2022-07-19 14:43:04,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046848595] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:04,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878969759] [2022-07-19 14:43:04,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:43:04,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:43:04,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:43:04,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:43:04,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 14:43:04,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:43:04,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:43:04,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 14:43:04,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 14:43:04,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:43:04,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878969759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:43:04,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 14:43:04,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-19 14:43:04,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003404247] [2022-07-19 14:43:04,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:43:04,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:43:04,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:43:04,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:43:04,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:43:04,982 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 14:43:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:43:05,007 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-07-19 14:43:05,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:43:05,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-07-19 14:43:05,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:43:05,008 INFO L225 Difference]: With dead ends: 56 [2022-07-19 14:43:05,009 INFO L226 Difference]: Without dead ends: 44 [2022-07-19 14:43:05,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-19 14:43:05,010 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:43:05,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 56 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:43:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-19 14:43:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-07-19 14:43:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:43:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-07-19 14:43:05,017 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 35 [2022-07-19 14:43:05,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:43:05,017 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-07-19 14:43:05,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 14:43:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-07-19 14:43:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 14:43:05,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:43:05,019 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:43:05,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:43:05,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:43:05,243 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:43:05,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:43:05,244 INFO L85 PathProgramCache]: Analyzing trace with hash 342309400, now seen corresponding path program 1 times [2022-07-19 14:43:05,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:43:05,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841911876] [2022-07-19 14:43:05,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:05,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:43:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:05,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:43:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:05,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:43:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:05,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:43:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 14:43:05,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:43:05,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841911876] [2022-07-19 14:43:05,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841911876] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:05,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503665326] [2022-07-19 14:43:05,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:05,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:43:05,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:43:05,340 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:43:05,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 14:43:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:05,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 14:43:05,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 14:43:05,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:43:05,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503665326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:43:05,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 14:43:05,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-19 14:43:05,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230120014] [2022-07-19 14:43:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:43:05,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:43:05,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:43:05,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:43:05,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:43:05,518 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 14:43:05,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:43:05,540 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-07-19 14:43:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:43:05,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-07-19 14:43:05,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:43:05,544 INFO L225 Difference]: With dead ends: 54 [2022-07-19 14:43:05,544 INFO L226 Difference]: Without dead ends: 43 [2022-07-19 14:43:05,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:43:05,546 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:43:05,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 69 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:43:05,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-19 14:43:05,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-19 14:43:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:43:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-07-19 14:43:05,561 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 35 [2022-07-19 14:43:05,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:43:05,562 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-07-19 14:43:05,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 14:43:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-07-19 14:43:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 14:43:05,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:43:05,565 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:43:05,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 14:43:05,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:43:05,766 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:43:05,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:43:05,766 INFO L85 PathProgramCache]: Analyzing trace with hash -325516838, now seen corresponding path program 1 times [2022-07-19 14:43:05,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:43:05,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715418992] [2022-07-19 14:43:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:05,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:43:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:05,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:43:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:05,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:43:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:05,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:43:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 14:43:05,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:43:05,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715418992] [2022-07-19 14:43:05,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715418992] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:05,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767509970] [2022-07-19 14:43:05,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:05,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:43:05,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:43:05,862 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:43:05,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 14:43:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:06,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-19 14:43:06,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:06,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:43:06,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:43:06,063 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 14:43:06,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:43:06,126 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 14:43:06,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767509970] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:43:06,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:43:06,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-07-19 14:43:06,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901049027] [2022-07-19 14:43:06,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:43:06,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 14:43:06,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:43:06,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 14:43:06,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:43:06,129 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 14:43:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:43:06,205 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-07-19 14:43:06,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:43:06,206 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-07-19 14:43:06,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:43:06,206 INFO L225 Difference]: With dead ends: 60 [2022-07-19 14:43:06,207 INFO L226 Difference]: Without dead ends: 51 [2022-07-19 14:43:06,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-19 14:43:06,208 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:43:06,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 155 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:43:06,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-19 14:43:06,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2022-07-19 14:43:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:43:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2022-07-19 14:43:06,215 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 36 [2022-07-19 14:43:06,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:43:06,215 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2022-07-19 14:43:06,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 14:43:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-07-19 14:43:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 14:43:06,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:43:06,216 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:43:06,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 14:43:06,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:43:06,431 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:43:06,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:43:06,432 INFO L85 PathProgramCache]: Analyzing trace with hash -268258536, now seen corresponding path program 1 times [2022-07-19 14:43:06,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:43:06,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206247841] [2022-07-19 14:43:06,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:06,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:43:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:06,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:43:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:06,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:43:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:06,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:43:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:43:06,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:43:06,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206247841] [2022-07-19 14:43:06,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206247841] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:06,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692017140] [2022-07-19 14:43:06,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:06,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:43:06,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:43:06,659 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:43:06,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 14:43:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:06,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-19 14:43:06,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:07,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-07-19 14:43:07,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:07,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-19 14:43:07,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 14:43:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:43:07,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:43:07,288 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1224 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12| v_ArrVal_1224) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0)) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12| |c_#StackHeapBarrier|)))) is different from false [2022-07-19 14:43:07,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692017140] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:07,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:43:07,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-07-19 14:43:07,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273492232] [2022-07-19 14:43:07,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:43:07,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-19 14:43:07,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:43:07,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-19 14:43:07,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=668, Unknown=1, NotChecked=52, Total=812 [2022-07-19 14:43:07,291 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 14:43:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:43:07,539 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-07-19 14:43:07,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 14:43:07,539 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2022-07-19 14:43:07,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:43:07,540 INFO L225 Difference]: With dead ends: 51 [2022-07-19 14:43:07,540 INFO L226 Difference]: Without dead ends: 41 [2022-07-19 14:43:07,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=987, Unknown=1, NotChecked=64, Total=1190 [2022-07-19 14:43:07,541 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:43:07,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 233 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 205 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2022-07-19 14:43:07,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-19 14:43:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-07-19 14:43:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:43:07,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-07-19 14:43:07,549 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 36 [2022-07-19 14:43:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:43:07,549 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-07-19 14:43:07,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 14:43:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-07-19 14:43:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:43:07,550 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:43:07,550 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:43:07,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:43:07,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:43:07,772 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:43:07,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:43:07,772 INFO L85 PathProgramCache]: Analyzing trace with hash 518615240, now seen corresponding path program 1 times [2022-07-19 14:43:07,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:43:07,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64245493] [2022-07-19 14:43:07,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:07,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:43:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:08,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:43:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:08,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:43:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:08,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:43:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:43:08,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:43:08,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64245493] [2022-07-19 14:43:08,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64245493] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:08,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308293291] [2022-07-19 14:43:08,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:08,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:43:08,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:43:08,136 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:43:08,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 14:43:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:08,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 111 conjunts are in the unsatisfiable core [2022-07-19 14:43:08,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:08,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 14:43:08,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:43:08,434 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:43:08,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:08,516 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:43:08,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 14:43:08,614 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-19 14:43:08,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-07-19 14:43:08,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-19 14:43:08,776 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:43:08,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-19 14:43:08,899 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:43:08,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2022-07-19 14:43:08,907 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:43:08,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-07-19 14:43:08,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 14:43:09,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:09,085 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 14:43:09,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 43 [2022-07-19 14:43:09,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:09,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:09,105 INFO L356 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-07-19 14:43:09,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2022-07-19 14:43:09,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:09,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:09,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:09,359 INFO L356 Elim1Store]: treesize reduction 55, result has 48.6 percent of original size [2022-07-19 14:43:09,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 case distinctions, treesize of input 91 treesize of output 117 [2022-07-19 14:43:09,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-07-19 14:43:09,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:09,403 INFO L356 Elim1Store]: treesize reduction 62, result has 22.5 percent of original size [2022-07-19 14:43:09,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 110 [2022-07-19 14:43:09,424 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-19 14:43:09,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2022-07-19 14:43:09,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:09,448 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-19 14:43:09,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 21 treesize of output 30 [2022-07-19 14:43:09,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-19 14:43:09,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:43:09,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 14:43:09,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 14:43:09,794 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-07-19 14:43:09,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 225 treesize of output 244 [2022-07-19 14:43:09,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:43:09,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 14:43:10,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 101 [2022-07-19 14:43:10,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 14:43:10,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 14:43:10,462 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 14:43:10,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 284 treesize of output 266 [2022-07-19 14:43:10,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:43:10,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-19 14:43:10,701 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:43:10,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2022-07-19 14:43:10,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-19 14:43:10,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-19 14:43:10,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-19 14:43:11,038 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 14:43:11,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:43:11,173 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:43:11,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2022-07-19 14:43:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:43:11,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:43:11,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| Int) (|ULTIMATE.start_sll_circular_insert_~last~1#1.base| Int) (v_ArrVal_1408 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (not (let ((.cse0 (let ((.cse2 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1407) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-07-19 14:43:11,303 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| Int) (|ULTIMATE.start_sll_circular_insert_~last~1#1.base| Int) (v_ArrVal_1408 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (not (let ((.cse1 (let ((.cse2 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1407) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-19 14:43:11,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| Int) (|ULTIMATE.start_sll_circular_insert_~last~1#1.base| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| Int) (v_ArrVal_1408 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| |c_#StackHeapBarrier|)) (not (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| v_ArrVal_1414))) (let ((.cse4 (select .cse3 |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (store (store .cse3 |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse4 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| (store (select (store .cse3 |ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1407) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15|) 0 (select .cse4 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| v_ArrVal_1415))) (store .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| v_ArrVal_1408) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15|) 0)))) is different from false [2022-07-19 14:43:11,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308293291] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:11,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:43:11,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 40 [2022-07-19 14:43:11,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523294276] [2022-07-19 14:43:11,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:43:11,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-19 14:43:11,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:43:11,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-19 14:43:11,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1508, Unknown=17, NotChecked=240, Total=1892 [2022-07-19 14:43:11,376 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 40 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 32 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-19 14:43:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:43:12,234 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2022-07-19 14:43:12,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-19 14:43:12,235 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 32 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2022-07-19 14:43:12,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:43:12,235 INFO L225 Difference]: With dead ends: 68 [2022-07-19 14:43:12,235 INFO L226 Difference]: Without dead ends: 65 [2022-07-19 14:43:12,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=274, Invalid=3027, Unknown=17, NotChecked=342, Total=3660 [2022-07-19 14:43:12,245 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 86 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:43:12,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 338 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 602 Invalid, 0 Unknown, 6 Unchecked, 0.3s Time] [2022-07-19 14:43:12,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-19 14:43:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 45. [2022-07-19 14:43:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:43:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-07-19 14:43:12,267 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 37 [2022-07-19 14:43:12,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:43:12,267 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-07-19 14:43:12,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 32 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-19 14:43:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-07-19 14:43:12,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 14:43:12,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:43:12,271 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:43:12,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 14:43:12,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:43:12,496 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:43:12,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:43:12,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1102755574, now seen corresponding path program 1 times [2022-07-19 14:43:12,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:43:12,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084109920] [2022-07-19 14:43:12,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:12,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:43:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:12,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:43:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:12,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:43:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:12,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:43:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:12,930 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:43:12,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:43:12,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084109920] [2022-07-19 14:43:12,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084109920] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:12,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579430943] [2022-07-19 14:43:12,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:12,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:43:12,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:43:12,936 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:43:12,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 14:43:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:13,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-19 14:43:13,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:13,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 14:43:13,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-19 14:43:13,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 14:43:13,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 14:43:13,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:13,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-19 14:43:13,599 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-19 14:43:13,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-19 14:43:13,775 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-19 14:43:13,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 72 [2022-07-19 14:43:13,796 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-19 14:43:13,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 136 [2022-07-19 14:43:13,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:13,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 37 [2022-07-19 14:43:13,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:13,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 81 [2022-07-19 14:43:13,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:13,827 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-19 14:43:13,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 99 [2022-07-19 14:43:13,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:13,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 52 treesize of output 68 [2022-07-19 14:43:13,979 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 14:43:13,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 49 [2022-07-19 14:43:13,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:13,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 16 [2022-07-19 14:43:14,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 14:43:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:43:14,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:43:14,127 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1591 Int) (v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1592 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1596)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1592))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1588))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1591))) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))) is different from false [2022-07-19 14:43:14,140 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1591 Int) (v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1592 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1596)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1592))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1588))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1591))) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))) is different from false [2022-07-19 14:43:14,167 INFO L356 Elim1Store]: treesize reduction 19, result has 64.8 percent of original size [2022-07-19 14:43:14,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 193 treesize of output 160 [2022-07-19 14:43:14,235 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:43:14,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 546 treesize of output 735 [2022-07-19 14:43:14,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:43:14,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 562 treesize of output 572