./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 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_append_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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 12:11:20,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 12:11:20,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 12:11:20,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 12:11:20,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 12:11:20,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 12:11:20,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 12:11:20,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 12:11:20,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 12:11:20,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 12:11:20,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 12:11:20,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 12:11:20,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 12:11:20,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 12:11:20,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 12:11:20,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 12:11:20,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 12:11:20,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 12:11:20,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 12:11:20,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 12:11:20,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 12:11:20,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 12:11:20,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 12:11:20,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 12:11:20,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 12:11:20,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 12:11:20,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 12:11:20,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 12:11:20,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 12:11:20,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 12:11:20,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 12:11:20,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 12:11:20,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 12:11:20,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 12:11:20,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 12:11:20,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 12:11:20,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 12:11:20,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 12:11:20,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 12:11:20,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 12:11:20,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 12:11:20,891 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 12:11:20,919 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 12:11:20,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 12:11:20,920 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 12:11:20,920 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 12:11:20,921 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 12:11:20,921 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 12:11:20,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 12:11:20,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 12:11:20,922 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 12:11:20,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 12:11:20,923 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 12:11:20,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 12:11:20,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 12:11:20,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 12:11:20,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 12:11:20,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 12:11:20,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 12:11:20,924 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 12:11:20,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 12:11:20,925 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 12:11:20,925 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 12:11:20,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 12:11:20,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 12:11:20,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 12:11:20,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:11:20,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 12:11:20,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 12:11:20,926 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 12:11:20,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 12:11:20,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 12:11:20,928 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 12:11:20,928 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 12:11:20,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 12:11:20,928 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 12:11:20,928 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2021-12-21 12:11:21,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 12:11:21,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 12:11:21,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 12:11:21,168 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 12:11:21,168 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 12:11:21,169 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2021-12-21 12:11:21,245 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5a3d1a7/4046909a02ee48cd90aa3d92a7f485c4/FLAG66028ee36 [2021-12-21 12:11:21,641 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 12:11:21,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2021-12-21 12:11:21,651 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5a3d1a7/4046909a02ee48cd90aa3d92a7f485c4/FLAG66028ee36 [2021-12-21 12:11:22,015 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5a3d1a7/4046909a02ee48cd90aa3d92a7f485c4 [2021-12-21 12:11:22,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 12:11:22,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 12:11:22,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 12:11:22,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 12:11:22,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 12:11:22,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:11:22" (1/1) ... [2021-12-21 12:11:22,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8e6b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:22, skipping insertion in model container [2021-12-21 12:11:22,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:11:22" (1/1) ... [2021-12-21 12:11:22,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 12:11:22,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 12:11:22,329 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_append_equal.i[24433,24446] [2021-12-21 12:11:22,335 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:11:22,344 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 12:11:22,387 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_append_equal.i[24433,24446] [2021-12-21 12:11:22,388 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:11:22,414 INFO L208 MainTranslator]: Completed translation [2021-12-21 12:11:22,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:22 WrapperNode [2021-12-21 12:11:22,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 12:11:22,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 12:11:22,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 12:11:22,417 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 12:11:22,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:22" (1/1) ... [2021-12-21 12:11:22,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:22" (1/1) ... [2021-12-21 12:11:22,477 INFO L137 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2021-12-21 12:11:22,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 12:11:22,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 12:11:22,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 12:11:22,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 12:11:22,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:22" (1/1) ... [2021-12-21 12:11:22,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:22" (1/1) ... [2021-12-21 12:11:22,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:22" (1/1) ... [2021-12-21 12:11:22,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:22" (1/1) ... [2021-12-21 12:11:22,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:22" (1/1) ... [2021-12-21 12:11:22,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:22" (1/1) ... [2021-12-21 12:11:22,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:22" (1/1) ... [2021-12-21 12:11:22,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 12:11:22,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 12:11:22,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 12:11:22,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 12:11:22,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:22" (1/1) ... [2021-12-21 12:11:22,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:11:22,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:22,540 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) [2021-12-21 12:11:22,542 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 [2021-12-21 12:11:22,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 12:11:22,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 12:11:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-21 12:11:22,571 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-21 12:11:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 12:11:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 12:11:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 12:11:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 12:11:22,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 12:11:22,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 12:11:22,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 12:11:22,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 12:11:22,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 12:11:22,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 12:11:22,681 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 12:11:22,691 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 12:11:22,912 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 12:11:22,918 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 12:11:22,918 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-21 12:11:22,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:11:22 BoogieIcfgContainer [2021-12-21 12:11:22,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 12:11:22,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 12:11:22,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 12:11:22,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 12:11:22,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 12:11:22" (1/3) ... [2021-12-21 12:11:22,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1087702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:11:22, skipping insertion in model container [2021-12-21 12:11:22,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:11:22" (2/3) ... [2021-12-21 12:11:22,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1087702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:11:22, skipping insertion in model container [2021-12-21 12:11:22,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:11:22" (3/3) ... [2021-12-21 12:11:22,927 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2021-12-21 12:11:22,931 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 12:11:22,932 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 12:11:22,980 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 12:11:22,985 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 12:11:22,985 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 12:11:22,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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) [2021-12-21 12:11:23,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 12:11:23,003 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:23,003 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:23,004 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:23,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:23,008 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2021-12-21 12:11:23,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:23,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840598241] [2021-12-21 12:11:23,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:23,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:23,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:11:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:23,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 12:11:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 12:11:23,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:23,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840598241] [2021-12-21 12:11:23,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840598241] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:11:23,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:11:23,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 12:11:23,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420280195] [2021-12-21 12:11:23,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:11:23,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 12:11:23,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:23,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 12:11:23,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 12:11:23,364 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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) [2021-12-21 12:11:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:23,436 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2021-12-21 12:11:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 12:11:23,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 24 [2021-12-21 12:11:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:23,448 INFO L225 Difference]: With dead ends: 65 [2021-12-21 12:11:23,448 INFO L226 Difference]: Without dead ends: 28 [2021-12-21 12:11:23,451 INFO L932 BasicCegarLoop]: 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 [2021-12-21 12:11:23,453 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:23,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:11:23,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-21 12:11:23,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-21 12:11:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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) [2021-12-21 12:11:23,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-12-21 12:11:23,482 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2021-12-21 12:11:23,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:23,483 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-21 12:11:23,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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) [2021-12-21 12:11:23,484 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-12-21 12:11:23,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 12:11:23,485 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:23,485 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:23,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 12:11:23,486 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:23,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:23,487 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2021-12-21 12:11:23,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:23,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419007592] [2021-12-21 12:11:23,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:23,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:23,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:11:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:23,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 12:11:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 12:11:23,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:23,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419007592] [2021-12-21 12:11:23,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419007592] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:11:23,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:11:23,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 12:11:23,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287743003] [2021-12-21 12:11:23,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:11:23,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 12:11:23,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:23,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 12:11:23,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 12:11:23,650 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2021-12-21 12:11:23,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:23,711 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2021-12-21 12:11:23,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 12:11:23,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 24 [2021-12-21 12:11:23,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:23,714 INFO L225 Difference]: With dead ends: 52 [2021-12-21 12:11:23,715 INFO L226 Difference]: Without dead ends: 31 [2021-12-21 12:11:23,716 INFO L932 BasicCegarLoop]: 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 [2021-12-21 12:11:23,718 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:23,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 12:11:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-21 12:11:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-12-21 12:11:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 12:11:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2021-12-21 12:11:23,727 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2021-12-21 12:11:23,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:23,727 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-12-21 12:11:23,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2021-12-21 12:11:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2021-12-21 12:11:23,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 12:11:23,728 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:23,729 INFO L514 BasicCegarLoop]: 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] [2021-12-21 12:11:23,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 12:11:23,729 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:23,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:23,730 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2021-12-21 12:11:23,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:23,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228246663] [2021-12-21 12:11:23,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:23,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:23,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:11:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:23,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:11:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:24,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 12:11:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:11:24,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:24,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228246663] [2021-12-21 12:11:24,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228246663] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:24,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519078359] [2021-12-21 12:11:24,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:24,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:24,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:24,183 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) [2021-12-21 12:11:24,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 12:11:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:24,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-21 12:11:24,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:24,752 INFO L387 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 17 treesize of output 9 [2021-12-21 12:11:24,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:24,913 INFO L387 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 [2021-12-21 12:11:24,967 INFO L387 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 25 treesize of output 13 [2021-12-21 12:11:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 12:11:25,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:25,127 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_316 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_9| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_9| v_ArrVal_316) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (<= 1 .cse0) (<= (+ .cse0 1) 0) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_9| |c_#StackHeapBarrier|))))) is different from false [2021-12-21 12:11:25,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519078359] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:25,131 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:11:25,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2021-12-21 12:11:25,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308455454] [2021-12-21 12:11:25,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:25,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-21 12:11:25,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:25,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-21 12:11:25,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2021-12-21 12:11:25,135 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 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) [2021-12-21 12:11:25,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:25,413 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2021-12-21 12:11:25,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 12:11:25,414 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 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 32 [2021-12-21 12:11:25,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:25,415 INFO L225 Difference]: With dead ends: 38 [2021-12-21 12:11:25,416 INFO L226 Difference]: Without dead ends: 30 [2021-12-21 12:11:25,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=756, Unknown=1, NotChecked=56, Total=930 [2021-12-21 12:11:25,417 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:25,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 187 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 151 Invalid, 0 Unknown, 10 Unchecked, 0.1s Time] [2021-12-21 12:11:25,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-21 12:11:25,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2021-12-21 12:11:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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) [2021-12-21 12:11:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2021-12-21 12:11:25,423 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2021-12-21 12:11:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:25,424 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2021-12-21 12:11:25,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 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) [2021-12-21 12:11:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2021-12-21 12:11:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-21 12:11:25,425 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:25,426 INFO L514 BasicCegarLoop]: 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] [2021-12-21 12:11:25,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-21 12:11:25,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:25,644 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:25,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:25,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2021-12-21 12:11:25,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:25,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640364936] [2021-12-21 12:11:25,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:25,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:25,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:11:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:25,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:11:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:26,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 12:11:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:11:26,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:26,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640364936] [2021-12-21 12:11:26,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640364936] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:26,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610531281] [2021-12-21 12:11:26,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:26,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:26,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:26,163 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) [2021-12-21 12:11:26,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 12:11:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:26,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 118 conjunts are in the unsatisfiable core [2021-12-21 12:11:26,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:26,409 INFO L387 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 [2021-12-21 12:11:26,448 INFO L387 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 [2021-12-21 12:11:26,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:26,571 INFO L387 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 12 treesize of output 14 [2021-12-21 12:11:26,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:26,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:26,790 INFO L387 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 [2021-12-21 12:11:26,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:26,893 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-21 12:11:26,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-21 12:11:27,023 INFO L387 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 19 treesize of output 18 [2021-12-21 12:11:27,157 INFO L387 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 [2021-12-21 12:11:27,385 INFO L387 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 [2021-12-21 12:11:27,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-12-21 12:11:27,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:27,399 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-12-21 12:11:27,404 INFO L387 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 [2021-12-21 12:11:27,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:27,608 INFO L387 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 [2021-12-21 12:11:27,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:27,616 INFO L387 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 18 treesize of output 20 [2021-12-21 12:11:27,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:27,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:27,646 INFO L353 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-21 12:11:27,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 25 [2021-12-21 12:11:27,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:27,660 INFO L387 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 [2021-12-21 12:11:27,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:27,942 INFO L353 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-12-21 12:11:27,943 INFO L387 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 2 case distinctions, treesize of input 76 treesize of output 71 [2021-12-21 12:11:27,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:27,953 INFO L387 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 34 treesize of output 32 [2021-12-21 12:11:27,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:27,962 INFO L387 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 21 treesize of output 25 [2021-12-21 12:11:27,967 INFO L387 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 18 treesize of output 20 [2021-12-21 12:11:28,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-12-21 12:11:28,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:11:28,067 INFO L387 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 [2021-12-21 12:11:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 12:11:28,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:28,212 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_508) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_511) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_505) |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_append_~last~1#1.base| v_ArrVal_510) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2021-12-21 12:11:28,253 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| Int) (v_ArrVal_506 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| v_ArrVal_506)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_508) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_511) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_505) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_510) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2021-12-21 12:11:28,285 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| Int) (v_ArrVal_506 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| v_ArrVal_506)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_508) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_511) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_505) |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 v_ArrVal_510) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2021-12-21 12:11:28,410 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| Int) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| Int) (v_ArrVal_506 Int) (v_ArrVal_520 (Array Int Int)) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_521 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_521))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_519))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_520))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| v_ArrVal_506))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_508) (select (select (store (store .cse2 .cse1 v_ArrVal_511) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_505) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse3 .cse1 v_ArrVal_510) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| |c_#StackHeapBarrier|))))) is different from false [2021-12-21 12:11:28,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610531281] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:28,412 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:11:28,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2021-12-21 12:11:28,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50758362] [2021-12-21 12:11:28,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:28,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-21 12:11:28,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:28,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-21 12:11:28,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1680, Unknown=5, NotChecked=340, Total=2162 [2021-12-21 12:11:28,418 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 40 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:29,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:29,397 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2021-12-21 12:11:29,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-21 12:11:29,398 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 3 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 35 [2021-12-21 12:11:29,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:29,399 INFO L225 Difference]: With dead ends: 70 [2021-12-21 12:11:29,400 INFO L226 Difference]: Without dead ends: 61 [2021-12-21 12:11:29,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=248, Invalid=3069, Unknown=5, NotChecked=460, Total=3782 [2021-12-21 12:11:29,402 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:29,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 377 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 479 Invalid, 0 Unknown, 100 Unchecked, 0.3s Time] [2021-12-21 12:11:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-21 12:11:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2021-12-21 12:11:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:29,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2021-12-21 12:11:29,412 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 35 [2021-12-21 12:11:29,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:29,412 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2021-12-21 12:11:29,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2021-12-21 12:11:29,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 12:11:29,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:29,414 INFO L514 BasicCegarLoop]: 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] [2021-12-21 12:11:29,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 12:11:29,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-21 12:11:29,644 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:29,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:29,644 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2021-12-21 12:11:29,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:29,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925241415] [2021-12-21 12:11:29,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:29,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:30,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:11:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:30,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:11:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:30,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 12:11:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:11:30,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:30,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925241415] [2021-12-21 12:11:30,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925241415] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:30,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973083295] [2021-12-21 12:11:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:30,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:30,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:30,580 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) [2021-12-21 12:11:30,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 12:11:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:30,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 138 conjunts are in the unsatisfiable core [2021-12-21 12:11:30,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:30,880 INFO L387 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 [2021-12-21 12:11:30,928 INFO L387 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 [2021-12-21 12:11:31,067 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 12:11:31,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 12:11:31,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:31,281 INFO L387 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 [2021-12-21 12:11:31,379 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-21 12:11:31,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-21 12:11:31,481 INFO L387 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 19 treesize of output 18 [2021-12-21 12:11:31,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2021-12-21 12:11:31,622 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:11:31,623 INFO L387 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 46 treesize of output 43 [2021-12-21 12:11:31,627 INFO L387 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 18 treesize of output 20 [2021-12-21 12:11:31,846 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 12:11:31,846 INFO L387 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 62 treesize of output 33 [2021-12-21 12:11:31,852 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-12-21 12:11:31,861 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-12-21 12:11:32,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:32,087 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:11:32,087 INFO L387 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 68 treesize of output 58 [2021-12-21 12:11:32,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:32,092 INFO L387 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 18 treesize of output 20 [2021-12-21 12:11:32,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:32,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:32,107 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-21 12:11:32,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2021-12-21 12:11:32,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:32,124 INFO L387 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 [2021-12-21 12:11:32,574 INFO L353 Elim1Store]: treesize reduction 107, result has 17.1 percent of original size [2021-12-21 12:11:32,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 82 [2021-12-21 12:11:32,607 INFO L353 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-21 12:11:32,608 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 221 treesize of output 132 [2021-12-21 12:11:32,631 INFO L353 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-12-21 12:11:32,632 INFO L387 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 195 treesize of output 185 [2021-12-21 12:11:32,639 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2021-12-21 12:11:32,759 INFO L353 Elim1Store]: treesize reduction 33, result has 10.8 percent of original size [2021-12-21 12:11:32,760 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 42 [2021-12-21 12:11:32,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:11:32,817 INFO L387 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 [2021-12-21 12:11:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 12:11:32,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:32,972 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_718 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_715) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_714) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_723) |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_append_~last~1#1.base| v_ArrVal_718) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2021-12-21 12:11:32,990 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_715) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_714) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_723) |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 v_ArrVal_718) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2021-12-21 12:11:33,005 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_715) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_714) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_723) |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 v_ArrVal_718) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2021-12-21 12:11:33,014 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_715) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_714) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_723) |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 v_ArrVal_718) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2021-12-21 12:11:33,116 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_722 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| Int) (v_ArrVal_731 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_731)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_733))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_732) .cse0 v_ArrVal_715) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_714) (select (select (store (store .cse1 .cse0 (store (select .cse1 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_723) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse0 v_ArrVal_718) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17|) 0)))) is different from false [2021-12-21 12:11:33,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973083295] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:33,118 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:11:33,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2021-12-21 12:11:33,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297871162] [2021-12-21 12:11:33,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:33,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-21 12:11:33,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:33,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-21 12:11:33,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2027, Unknown=6, NotChecked=470, Total=2652 [2021-12-21 12:11:33,123 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 45 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 36 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:34,044 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2021-12-21 12:11:34,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 12:11:34,045 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 36 states have internal predecessors, (60), 6 states have call successors, (6), 3 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 37 [2021-12-21 12:11:34,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:34,046 INFO L225 Difference]: With dead ends: 65 [2021-12-21 12:11:34,046 INFO L226 Difference]: Without dead ends: 63 [2021-12-21 12:11:34,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=220, Invalid=2764, Unknown=6, NotChecked=550, Total=3540 [2021-12-21 12:11:34,048 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:34,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 344 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 720 Invalid, 0 Unknown, 16 Unchecked, 0.4s Time] [2021-12-21 12:11:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-21 12:11:34,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2021-12-21 12:11:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-21 12:11:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2021-12-21 12:11:34,059 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 37 [2021-12-21 12:11:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:34,059 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2021-12-21 12:11:34,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 36 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:34,060 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2021-12-21 12:11:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-21 12:11:34,061 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:34,061 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-12-21 12:11:34,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-21 12:11:34,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:34,281 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:34,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:34,282 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2021-12-21 12:11:34,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:34,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142249701] [2021-12-21 12:11:34,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:34,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:34,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:11:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:34,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:11:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:34,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 12:11:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:11:34,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:34,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142249701] [2021-12-21 12:11:34,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142249701] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:34,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465901034] [2021-12-21 12:11:34,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 12:11:34,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:34,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:34,954 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) [2021-12-21 12:11:34,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 12:11:35,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 12:11:35,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:11:35,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 178 conjunts are in the unsatisfiable core [2021-12-21 12:11:35,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:35,261 INFO L387 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 [2021-12-21 12:11:35,499 INFO L387 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 [2021-12-21 12:11:35,573 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 12:11:35,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 12:11:35,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:35,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:35,677 INFO L387 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 19 treesize of output 18 [2021-12-21 12:11:35,785 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:11:35,796 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-21 12:11:35,797 INFO L387 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 74 treesize of output 52 [2021-12-21 12:11:35,801 INFO L387 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 18 treesize of output 20 [2021-12-21 12:11:35,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2021-12-21 12:11:36,018 INFO L353 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2021-12-21 12:11:36,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 67 [2021-12-21 12:11:36,029 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-21 12:11:36,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2021-12-21 12:11:36,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:36,242 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-21 12:11:36,242 INFO L387 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 128 treesize of output 108 [2021-12-21 12:11:36,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:36,257 INFO L387 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 18 treesize of output 20 [2021-12-21 12:11:36,276 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-21 12:11:36,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-21 12:11:36,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:36,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:36,290 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 12:11:36,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 76 [2021-12-21 12:11:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:36,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:37,022 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_930) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_936) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_939) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_938) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_929) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-12-21 12:11:37,691 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_930 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_949 (Array Int Int)) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_947)) (.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_948))) (let ((.cse4 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse6 (select (select .cse1 .cse4) .cse5)) (.cse7 (select (select .cse3 .cse4) .cse5))) (let ((.cse0 (select (select .cse1 .cse6) .cse7)) (.cse2 (select (select .cse3 .cse6) .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_949) .cse0 v_ArrVal_930) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_936) (select (select (store (store .cse1 .cse0 (store (select .cse1 .cse0) .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_939) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse3 .cse0 v_ArrVal_938) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_929) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| |c_#StackHeapBarrier|)) (and (= .cse4 .cse0) (= .cse2 .cse5)))))))) is different from false [2021-12-21 12:11:37,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465901034] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:37,693 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:11:37,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 39 [2021-12-21 12:11:37,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78948542] [2021-12-21 12:11:37,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:37,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-21 12:11:37,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:37,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-21 12:11:37,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1995, Unknown=5, NotChecked=182, Total=2352 [2021-12-21 12:11:37,696 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 39 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 31 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:38,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:38,327 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2021-12-21 12:11:38,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-21 12:11:38,328 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 31 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2021-12-21 12:11:38,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:38,329 INFO L225 Difference]: With dead ends: 71 [2021-12-21 12:11:38,329 INFO L226 Difference]: Without dead ends: 60 [2021-12-21 12:11:38,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=233, Invalid=2526, Unknown=5, NotChecked=206, Total=2970 [2021-12-21 12:11:38,331 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:38,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 187 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 269 Invalid, 0 Unknown, 14 Unchecked, 0.2s Time] [2021-12-21 12:11:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-21 12:11:38,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-12-21 12:11:38,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-21 12:11:38,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2021-12-21 12:11:38,341 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 39 [2021-12-21 12:11:38,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:38,341 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2021-12-21 12:11:38,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 31 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:38,341 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2021-12-21 12:11:38,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-21 12:11:38,342 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:38,343 INFO L514 BasicCegarLoop]: 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, 1, 1] [2021-12-21 12:11:38,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 12:11:38,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:38,556 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:38,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:38,557 INFO L85 PathProgramCache]: Analyzing trace with hash 12485255, now seen corresponding path program 1 times [2021-12-21 12:11:38,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:38,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204984223] [2021-12-21 12:11:38,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:38,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:38,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:11:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:39,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:11:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:39,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 12:11:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:39,208 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:11:39,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:39,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204984223] [2021-12-21 12:11:39,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204984223] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:39,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485056950] [2021-12-21 12:11:39,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:39,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:39,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:39,210 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) [2021-12-21 12:11:39,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 12:11:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:39,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 108 conjunts are in the unsatisfiable core [2021-12-21 12:11:39,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:39,369 INFO L387 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 [2021-12-21 12:11:39,400 INFO L387 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 [2021-12-21 12:11:39,498 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 12:11:39,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 12:11:39,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:39,647 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-21 12:11:39,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-21 12:11:39,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2021-12-21 12:11:39,798 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:11:39,798 INFO L387 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 36 treesize of output 35 [2021-12-21 12:11:39,935 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 12:11:39,936 INFO L387 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 71 treesize of output 26 [2021-12-21 12:11:39,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-12-21 12:11:40,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:40,103 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:11:40,103 INFO L387 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 77 treesize of output 67 [2021-12-21 12:11:40,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:40,109 INFO L387 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 60 treesize of output 58 [2021-12-21 12:11:40,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:40,134 INFO L353 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2021-12-21 12:11:40,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 37 [2021-12-21 12:11:40,506 INFO L353 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-12-21 12:11:40,506 INFO L387 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 67 [2021-12-21 12:11:40,532 INFO L353 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-21 12:11:40,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 112 [2021-12-21 12:11:40,549 INFO L353 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-12-21 12:11:40,550 INFO L387 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 151 treesize of output 147 [2021-12-21 12:11:40,633 INFO L387 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 121 treesize of output 93 [2021-12-21 12:11:40,803 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-12-21 12:11:40,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 38 [2021-12-21 12:11:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 12:11:40,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:40,835 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1135 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1139))) (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| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1135) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2021-12-21 12:11:40,865 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_19| Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1135 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_19| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1139))) (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| .cse2 v_ArrVal_1135) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2021-12-21 12:11:40,878 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_19| Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1135 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_19| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1139))) (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| .cse2 v_ArrVal_1135) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2021-12-21 12:11:40,887 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_19| Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1135 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_19| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1139))) (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| .cse2 v_ArrVal_1135) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2021-12-21 12:11:40,963 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_25| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_19| Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1135 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_25|) 0)) (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_25| v_ArrVal_1147)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_25| v_ArrVal_1146))) (let ((.cse3 (select (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_19| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_25|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_25| v_ArrVal_1139))) (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 .cse2 .cse3 v_ArrVal_1135) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_25| v_ArrVal_1138) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_25| |c_#StackHeapBarrier|)))) is different from false [2021-12-21 12:11:40,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485056950] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:40,965 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:11:40,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 43 [2021-12-21 12:11:40,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167188299] [2021-12-21 12:11:40,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:40,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-21 12:11:40,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:40,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-21 12:11:40,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1683, Unknown=8, NotChecked=430, Total=2256 [2021-12-21 12:11:40,969 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 43 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 34 states have internal predecessors, (59), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:41,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:41,540 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2021-12-21 12:11:41,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 12:11:41,540 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 34 states have internal predecessors, (59), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2021-12-21 12:11:41,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:41,541 INFO L225 Difference]: With dead ends: 65 [2021-12-21 12:11:41,542 INFO L226 Difference]: Without dead ends: 62 [2021-12-21 12:11:41,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=194, Invalid=2268, Unknown=8, NotChecked=500, Total=2970 [2021-12-21 12:11:41,543 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:41,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 242 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 443 Invalid, 0 Unknown, 71 Unchecked, 0.2s Time] [2021-12-21 12:11:41,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-21 12:11:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-12-21 12:11:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-21 12:11:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2021-12-21 12:11:41,553 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 40 [2021-12-21 12:11:41,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:41,553 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2021-12-21 12:11:41,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 34 states have internal predecessors, (59), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:41,554 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2021-12-21 12:11:41,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-21 12:11:41,555 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:41,555 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:41,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-21 12:11:41,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:41,760 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:41,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash 387084070, now seen corresponding path program 1 times [2021-12-21 12:11:41,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:41,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881126874] [2021-12-21 12:11:41,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:41,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:42,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:11:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:42,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:11:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:42,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 12:11:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:11:42,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:42,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881126874] [2021-12-21 12:11:42,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881126874] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:42,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664510265] [2021-12-21 12:11:42,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:42,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:42,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:42,997 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) [2021-12-21 12:11:42,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 12:11:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:43,292 WARN L261 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 201 conjunts are in the unsatisfiable core [2021-12-21 12:11:43,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:43,350 INFO L387 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 [2021-12-21 12:11:43,388 INFO L387 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 [2021-12-21 12:11:43,585 INFO L387 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 [2021-12-21 12:11:43,588 INFO L387 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 [2021-12-21 12:11:43,750 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 12:11:43,750 INFO L387 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 [2021-12-21 12:11:43,760 INFO L387 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 [2021-12-21 12:11:43,785 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 12:11:43,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 12:11:43,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 12:11:43,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:43,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:44,063 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:11:44,063 INFO L387 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 81 treesize of output 72 [2021-12-21 12:11:44,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:44,070 INFO L387 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 35 treesize of output 30 [2021-12-21 12:11:44,075 INFO L387 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 [2021-12-21 12:11:44,341 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 12:11:44,342 INFO L387 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 89 treesize of output 48 [2021-12-21 12:11:44,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:44,355 INFO L387 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 [2021-12-21 12:11:44,361 INFO L387 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 [2021-12-21 12:11:44,504 INFO L387 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 [2021-12-21 12:11:44,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:44,631 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:11:44,632 INFO L387 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 95 treesize of output 77 [2021-12-21 12:11:44,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:44,639 INFO L387 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 22 treesize of output 24 [2021-12-21 12:11:44,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:44,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:44,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:44,650 INFO L387 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 36 treesize of output 35 [2021-12-21 12:11:44,664 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-21 12:11:44,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-21 12:11:45,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:45,712 INFO L353 Elim1Store]: treesize reduction 366, result has 12.9 percent of original size [2021-12-21 12:11:45,713 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 539 treesize of output 231 [2021-12-21 12:11:45,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:45,762 INFO L353 Elim1Store]: treesize reduction 128, result has 22.9 percent of original size [2021-12-21 12:11:45,763 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 233 treesize of output 147 [2021-12-21 12:11:45,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:45,773 INFO L387 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 66 treesize of output 55 [2021-12-21 12:11:45,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:45,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:45,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:45,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:45,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:45,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2021-12-21 12:11:45,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:45,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:45,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:45,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:45,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:45,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 57 [2021-12-21 12:11:46,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:11:46,756 INFO L353 Elim1Store]: treesize reduction 65, result has 19.8 percent of original size [2021-12-21 12:11:46,756 INFO L387 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 8 new quantified variables, introduced 10 case distinctions, treesize of input 195 treesize of output 79 [2021-12-21 12:11:46,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:46,766 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-21 12:11:46,767 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 28 [2021-12-21 12:11:46,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:11:46,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 10 [2021-12-21 12:11:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:46,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:48,475 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:11:48,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1176 treesize of output 1171 [2021-12-21 12:11:49,868 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1354 Int) (v_ArrVal_1357 Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| Int) (v_ArrVal_1370 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_1369)) (.cse13 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_1370))) (let ((.cse7 (select (select .cse13 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse15 (select (select .cse14 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse2 (select (select .cse13 .cse7) .cse15))) (let ((.cse6 (select .cse13 .cse2)) (.cse3 (select (select .cse14 .cse7) .cse15))) (let ((.cse10 (store (store .cse14 .cse2 (store (select .cse14 .cse2) .cse3 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_1348)) (.cse11 (let ((.cse12 (store .cse13 .cse2 (store .cse6 .cse3 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29|)))) (store .cse12 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| (store (select .cse12 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29|) 0 (select (select .cse12 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select .cse11 .cse8) .cse9)) (.cse5 (select (select .cse10 .cse8) .cse9))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_arrayElimArr_8))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_1354))))) (store .cse0 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| (store (select .cse0 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29|) 0 v_ArrVal_1357))) .cse4) (+ .cse5 4))) (not (= (select v_arrayElimArr_8 4) |c_ULTIMATE.start_sll_circular_append_~data#1|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29|) 0)) (not (= (select .cse6 .cse3) .cse7)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| |c_#StackHeapBarrier|)) (and (= .cse8 .cse4) (= .cse5 .cse9))))))))))) is different from false [2021-12-21 12:11:49,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664510265] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:49,871 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:11:49,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 52 [2021-12-21 12:11:49,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492182961] [2021-12-21 12:11:49,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:49,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-21 12:11:49,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:49,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-21 12:11:49,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=3667, Unknown=6, NotChecked=122, Total=4032 [2021-12-21 12:11:49,873 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 52 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 43 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:55,140 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2021-12-21 12:11:55,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-21 12:11:55,141 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 43 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2021-12-21 12:11:55,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:55,142 INFO L225 Difference]: With dead ends: 66 [2021-12-21 12:11:55,142 INFO L226 Difference]: Without dead ends: 64 [2021-12-21 12:11:55,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=329, Invalid=4924, Unknown=7, NotChecked=142, Total=5402 [2021-12-21 12:11:55,143 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:55,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 302 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 645 Invalid, 0 Unknown, 92 Unchecked, 0.5s Time] [2021-12-21 12:11:55,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-21 12:11:55,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-12-21 12:11:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 54 states have internal predecessors, (60), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-21 12:11:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2021-12-21 12:11:55,156 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 41 [2021-12-21 12:11:55,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:55,156 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2021-12-21 12:11:55,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 43 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 12:11:55,156 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2021-12-21 12:11:55,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-21 12:11:55,157 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:55,157 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:55,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-21 12:11:55,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:55,363 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:55,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:55,364 INFO L85 PathProgramCache]: Analyzing trace with hash -364798159, now seen corresponding path program 1 times [2021-12-21 12:11:55,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:55,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089866157] [2021-12-21 12:11:55,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:55,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:55,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:11:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:55,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:11:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:55,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 12:11:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:11:56,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:56,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089866157] [2021-12-21 12:11:56,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089866157] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:56,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829081333] [2021-12-21 12:11:56,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:56,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:56,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:56,080 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) [2021-12-21 12:11:56,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 12:11:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:56,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 148 conjunts are in the unsatisfiable core [2021-12-21 12:11:56,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:56,379 INFO L387 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 [2021-12-21 12:11:56,566 INFO L387 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 [2021-12-21 12:11:56,695 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 12:11:56,695 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 12:11:56,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:56,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:56,880 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:11:56,880 INFO L387 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 45 treesize of output 42 [2021-12-21 12:11:56,884 INFO L387 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 18 treesize of output 20 [2021-12-21 12:11:57,048 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 12:11:57,048 INFO L387 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 61 treesize of output 32 [2021-12-21 12:11:57,053 INFO L387 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 15 treesize of output 7 [2021-12-21 12:11:57,056 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:11:57,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:57,241 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:11:57,241 INFO L387 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 69 treesize of output 59 [2021-12-21 12:11:57,256 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-21 12:11:57,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-21 12:11:57,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:57,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:57,263 INFO L387 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 [2021-12-21 12:11:57,713 INFO L353 Elim1Store]: treesize reduction 107, result has 17.1 percent of original size [2021-12-21 12:11:57,713 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 98 [2021-12-21 12:11:57,740 INFO L353 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-21 12:11:57,741 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 274 treesize of output 187 [2021-12-21 12:11:57,769 INFO L353 Elim1Store]: treesize reduction 140, result has 13.6 percent of original size [2021-12-21 12:11:57,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 247 treesize of output 160 [2021-12-21 12:11:57,795 INFO L353 Elim1Store]: treesize reduction 86, result has 18.9 percent of original size [2021-12-21 12:11:57,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 238 treesize of output 194 [2021-12-21 12:11:58,079 INFO L353 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-12-21 12:11:58,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 115 [2021-12-21 12:11:58,272 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-21 12:11:58,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 39 [2021-12-21 12:11:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:58,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:58,320 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1569 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1559))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1569))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1))))) is different from false [2021-12-21 12:11:58,339 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1569 (Array Int Int))) (not (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1559))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1569))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2)))))))))) is different from false [2021-12-21 12:11:58,579 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1569 (Array Int Int))) (not (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse5 (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1559))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1569))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))))) is different from false [2021-12-21 12:11:58,666 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1569 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| Int) (v_ArrVal_1575 (Array Int Int)) (v_ArrVal_1574 (Array Int Int))) (or (not (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_1574)) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_1575))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse9 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse5 (select (select .cse7 .cse8) .cse9)) (.cse6 (select (select .cse4 .cse8) .cse9))) (let ((.cse1 (store (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_1559))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_1569))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33|) 0)))) is different from false [2021-12-21 12:11:58,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829081333] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:58,668 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:11:58,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 49 [2021-12-21 12:11:58,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273194317] [2021-12-21 12:11:58,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:58,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-21 12:11:58,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:58,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-21 12:11:58,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2279, Unknown=37, NotChecked=396, Total=2862 [2021-12-21 12:11:58,671 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 49 states, 45 states have (on average 1.6) internal successors, (72), 40 states have internal predecessors, (72), 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) [2021-12-21 12:12:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:12:00,178 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2021-12-21 12:12:00,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-21 12:12:00,179 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.6) internal successors, (72), 40 states have internal predecessors, (72), 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 44 [2021-12-21 12:12:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:12:00,180 INFO L225 Difference]: With dead ends: 80 [2021-12-21 12:12:00,180 INFO L226 Difference]: Without dead ends: 77 [2021-12-21 12:12:00,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=289, Invalid=3593, Unknown=40, NotChecked=500, Total=4422 [2021-12-21 12:12:00,181 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 102 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 12:12:00,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 329 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 820 Invalid, 0 Unknown, 50 Unchecked, 0.5s Time] [2021-12-21 12:12:00,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-21 12:12:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 66. [2021-12-21 12:12:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-21 12:12:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2021-12-21 12:12:00,194 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 44 [2021-12-21 12:12:00,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:12:00,194 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2021-12-21 12:12:00,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.6) internal successors, (72), 40 states have internal predecessors, (72), 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) [2021-12-21 12:12:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2021-12-21 12:12:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-21 12:12:00,195 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:12:00,195 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:12:00,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-21 12:12:00,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:00,400 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:12:00,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:12:00,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2042609176, now seen corresponding path program 3 times [2021-12-21 12:12:00,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:12:00,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449860942] [2021-12-21 12:12:00,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:00,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:12:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:00,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:12:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:00,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:12:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:00,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 12:12:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:00,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-21 12:12:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-12-21 12:12:00,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:12:00,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449860942] [2021-12-21 12:12:00,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449860942] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:12:00,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951100505] [2021-12-21 12:12:00,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 12:12:00,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:00,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:12:00,478 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:12:00,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 12:12:00,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-21 12:12:00,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:12:00,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 12:12:00,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:12:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 12:12:00,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:12:00,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951100505] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:12:00,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 12:12:00,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-21 12:12:00,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849158816] [2021-12-21 12:12:00,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:12:00,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 12:12:00,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:12:00,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 12:12:00,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 12:12:00,836 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 12:12:00,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:12:00,853 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2021-12-21 12:12:00,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 12:12:00,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2021-12-21 12:12:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:12:00,854 INFO L225 Difference]: With dead ends: 78 [2021-12-21 12:12:00,854 INFO L226 Difference]: Without dead ends: 39 [2021-12-21 12:12:00,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 12:12:00,855 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:12:00,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:12:00,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-21 12:12:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-12-21 12:12:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 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) [2021-12-21 12:12:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2021-12-21 12:12:00,862 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 45 [2021-12-21 12:12:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:12:00,862 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-12-21 12:12:00,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 12:12:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-12-21 12:12:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-21 12:12:00,863 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:12:00,863 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:12:00,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-21 12:12:01,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-21 12:12:01,076 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:12:01,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:12:01,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1576200124, now seen corresponding path program 2 times [2021-12-21 12:12:01,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:12:01,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694761467] [2021-12-21 12:12:01,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:12:01,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:12:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:02,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 12:12:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:02,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 12:12:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:02,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 12:12:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:12:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:12:02,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:12:02,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694761467] [2021-12-21 12:12:02,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694761467] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:12:02,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115354174] [2021-12-21 12:12:02,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 12:12:02,486 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:12:02,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:12:02,487 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:12:02,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 12:12:02,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 12:12:02,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:12:02,692 WARN L261 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 231 conjunts are in the unsatisfiable core [2021-12-21 12:12:02,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:12:02,711 INFO L387 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 [2021-12-21 12:12:02,761 INFO L387 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 [2021-12-21 12:12:02,859 INFO L387 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 [2021-12-21 12:12:02,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:02,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-12-21 12:12:03,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:03,102 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:12:03,110 INFO L387 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 [2021-12-21 12:12:03,325 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 12:12:03,325 INFO L387 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 [2021-12-21 12:12:03,331 INFO L387 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 [2021-12-21 12:12:03,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:03,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:03,353 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 12:12:03,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-12-21 12:12:03,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:12:03,496 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 12:12:03,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:12:03,640 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-21 12:12:03,640 INFO L387 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 93 treesize of output 59 [2021-12-21 12:12:03,646 INFO L387 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 31 treesize of output 26 [2021-12-21 12:12:03,649 INFO L387 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 27 treesize of output 22 [2021-12-21 12:12:03,911 INFO L353 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-21 12:12:03,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 51 [2021-12-21 12:12:03,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:03,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:03,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-21 12:12:03,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:03,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:03,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-12-21 12:12:03,934 INFO L387 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 [2021-12-21 12:12:04,082 INFO L387 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 [2021-12-21 12:12:04,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:04,224 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-21 12:12:04,224 INFO L387 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 101 [2021-12-21 12:12:04,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:04,231 INFO L387 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 22 treesize of output 24 [2021-12-21 12:12:04,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:04,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:04,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:04,254 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-21 12:12:04,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2021-12-21 12:12:04,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:04,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:04,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:04,264 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2021-12-21 12:12:05,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:05,716 INFO L353 Elim1Store]: treesize reduction 250, result has 29.2 percent of original size [2021-12-21 12:12:05,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 26 case distinctions, treesize of input 706 treesize of output 504 [2021-12-21 12:12:05,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:05,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:05,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:06,293 INFO L353 Elim1Store]: treesize reduction 204, result has 37.2 percent of original size [2021-12-21 12:12:06,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 711 treesize of output 606 [2021-12-21 12:12:06,327 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 115 [2021-12-21 12:12:06,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:06,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:06,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:06,655 INFO L353 Elim1Store]: treesize reduction 360, result has 37.6 percent of original size [2021-12-21 12:12:06,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 27 case distinctions, treesize of input 233 treesize of output 507 [2021-12-21 12:12:06,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:06,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:06,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:06,950 INFO L353 Elim1Store]: treesize reduction 402, result has 38.1 percent of original size [2021-12-21 12:12:06,951 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 27 case distinctions, treesize of input 257 treesize of output 559 [2021-12-21 12:12:07,097 INFO L353 Elim1Store]: treesize reduction 86, result has 47.2 percent of original size [2021-12-21 12:12:07,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 143 [2021-12-21 12:12:07,159 INFO L387 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 18 treesize of output 26 [2021-12-21 12:12:07,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 27 treesize of output 25 [2021-12-21 12:12:07,463 INFO L387 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 [2021-12-21 12:12:08,170 INFO L353 Elim1Store]: treesize reduction 24, result has 57.1 percent of original size [2021-12-21 12:12:08,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 121 treesize of output 128 [2021-12-21 12:12:12,138 INFO L387 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 20 treesize of output 19 [2021-12-21 12:12:13,997 INFO L353 Elim1Store]: treesize reduction 39, result has 11.4 percent of original size [2021-12-21 12:12:13,998 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 329 treesize of output 255 [2021-12-21 12:12:17,592 INFO L353 Elim1Store]: treesize reduction 39, result has 11.4 percent of original size [2021-12-21 12:12:17,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 329 treesize of output 255 [2021-12-21 12:12:21,630 INFO L387 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 42 treesize of output 30 [2021-12-21 12:12:21,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:12:21,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42