./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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_remove_all.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 cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:42:59,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:42:59,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:42:59,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:42:59,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:42:59,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:42:59,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:42:59,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:42:59,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:42:59,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:42:59,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:42:59,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:42:59,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:42:59,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:42:59,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:42:59,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:42:59,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:42:59,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:42:59,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:42:59,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:42:59,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:42:59,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:42:59,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:42:59,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:42:59,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:42:59,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:42:59,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:42:59,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:42:59,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:42:59,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:42:59,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:42:59,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:42:59,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:42:59,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:42:59,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:42:59,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:42:59,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:42:59,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:42:59,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:42:59,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:42:59,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:42:59,207 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:42:59,239 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:42:59,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:42:59,240 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:42:59,240 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:42:59,241 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:42:59,241 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:42:59,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:42:59,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:42:59,242 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:42:59,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:42:59,243 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:42:59,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:42:59,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:42:59,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:42:59,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:42:59,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:42:59,244 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:42:59,244 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:42:59,244 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:42:59,245 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:42:59,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:42:59,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:42:59,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:42:59,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:42:59,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:42:59,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:42:59,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:42:59,246 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:42:59,246 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:42:59,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:42:59,247 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:42:59,247 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:42:59,247 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:42:59,248 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:42:59,248 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 -> cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 [2021-12-14 13:42:59,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:42:59,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:42:59,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:42:59,469 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:42:59,470 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:42:59,471 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_remove_all.i [2021-12-14 13:42:59,558 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b8a1699d/81d1f05f15d44e5f95546166bbe62e1b/FLAG75311892a [2021-12-14 13:42:59,964 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:42:59,965 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all.i [2021-12-14 13:42:59,977 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b8a1699d/81d1f05f15d44e5f95546166bbe62e1b/FLAG75311892a [2021-12-14 13:43:00,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b8a1699d/81d1f05f15d44e5f95546166bbe62e1b [2021-12-14 13:43:00,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:43:00,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:43:00,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:43:00,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:43:00,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:43:00,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:43:00" (1/1) ... [2021-12-14 13:43:00,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a0fa288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:00, skipping insertion in model container [2021-12-14 13:43:00,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:43:00" (1/1) ... [2021-12-14 13:43:00,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:43:00,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:43:00,651 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_remove_all.i[24082,24095] [2021-12-14 13:43:00,655 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:43:00,663 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:43:00,705 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_remove_all.i[24082,24095] [2021-12-14 13:43:00,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:43:00,728 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:43:00,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:00 WrapperNode [2021-12-14 13:43:00,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:43:00,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:43:00,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:43:00,729 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:43:00,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:00" (1/1) ... [2021-12-14 13:43:00,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:00" (1/1) ... [2021-12-14 13:43:00,765 INFO L137 Inliner]: procedures = 126, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 111 [2021-12-14 13:43:00,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:43:00,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:43:00,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:43:00,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:43:00,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:00" (1/1) ... [2021-12-14 13:43:00,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:00" (1/1) ... [2021-12-14 13:43:00,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:00" (1/1) ... [2021-12-14 13:43:00,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:00" (1/1) ... [2021-12-14 13:43:00,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:00" (1/1) ... [2021-12-14 13:43:00,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:00" (1/1) ... [2021-12-14 13:43:00,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:00" (1/1) ... [2021-12-14 13:43:00,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:43:00,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:43:00,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:43:00,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:43:00,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:00" (1/1) ... [2021-12-14 13:43:00,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:43:00,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:43:00,821 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-14 13:43:00,827 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-14 13:43:00,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 13:43:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-14 13:43:00,850 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-14 13:43:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 13:43:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:43:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 13:43:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 13:43:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 13:43:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 13:43:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 13:43:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:43:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:43:00,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:43:00,932 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:43:00,934 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:43:01,115 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:43:01,121 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:43:01,121 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-14 13:43:01,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:43:01 BoogieIcfgContainer [2021-12-14 13:43:01,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:43:01,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:43:01,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:43:01,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:43:01,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:43:00" (1/3) ... [2021-12-14 13:43:01,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfac96a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:43:01, skipping insertion in model container [2021-12-14 13:43:01,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:00" (2/3) ... [2021-12-14 13:43:01,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfac96a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:43:01, skipping insertion in model container [2021-12-14 13:43:01,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:43:01" (3/3) ... [2021-12-14 13:43:01,153 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2021-12-14 13:43:01,158 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:43:01,158 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 13:43:01,227 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:43:01,237 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-14 13:43:01,237 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 13:43:01,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 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-14 13:43:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 13:43:01,282 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:01,283 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:43:01,284 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:01,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:01,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1639005326, now seen corresponding path program 1 times [2021-12-14 13:43:01,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:01,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156265939] [2021-12-14 13:43:01,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:01,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:01,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:43:01,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:01,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156265939] [2021-12-14 13:43:01,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156265939] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:43:01,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:43:01,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:43:01,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797789541] [2021-12-14 13:43:01,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:43:01,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:43:01,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:01,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:43:01,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:43:01,626 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:43:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:01,689 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2021-12-14 13:43:01,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:43:01,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-12-14 13:43:01,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:01,698 INFO L225 Difference]: With dead ends: 43 [2021-12-14 13:43:01,698 INFO L226 Difference]: Without dead ends: 24 [2021-12-14 13:43:01,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:43:01,705 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:43:01,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:43:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-14 13:43:01,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-12-14 13:43:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-14 13:43:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-12-14 13:43:01,743 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2021-12-14 13:43:01,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:01,745 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-12-14 13:43:01,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:43:01,745 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-12-14 13:43:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 13:43:01,748 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:01,749 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:43:01,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 13:43:01,750 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:01,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:01,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1625162405, now seen corresponding path program 1 times [2021-12-14 13:43:01,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:01,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860921661] [2021-12-14 13:43:01,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:01,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:01,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:43:01,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:01,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860921661] [2021-12-14 13:43:01,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860921661] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:43:01,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:43:01,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:43:01,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961408925] [2021-12-14 13:43:01,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:43:01,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:43:01,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:01,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:43:01,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:43:01,917 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:43:01,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:01,963 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2021-12-14 13:43:01,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:43:01,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-12-14 13:43:01,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:01,965 INFO L225 Difference]: With dead ends: 39 [2021-12-14 13:43:01,965 INFO L226 Difference]: Without dead ends: 27 [2021-12-14 13:43:01,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:43:01,969 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:43:01,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:43:01,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-14 13:43:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2021-12-14 13:43:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:43:01,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2021-12-14 13:43:01,981 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2021-12-14 13:43:01,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:01,982 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-12-14 13:43:01,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:43:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2021-12-14 13:43:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 13:43:01,990 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:01,990 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-14 13:43:01,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 13:43:01,991 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:01,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash -989818723, now seen corresponding path program 1 times [2021-12-14 13:43:01,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:01,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783960586] [2021-12-14 13:43:01,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:01,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:02,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:02,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 13:43:02,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:02,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783960586] [2021-12-14 13:43:02,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783960586] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:43:02,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:43:02,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:43:02,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519842985] [2021-12-14 13:43:02,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:43:02,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:43:02,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:02,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:43:02,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:43:02,153 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 13:43:02,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:02,223 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2021-12-14 13:43:02,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:43:02,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-12-14 13:43:02,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:02,225 INFO L225 Difference]: With dead ends: 35 [2021-12-14 13:43:02,226 INFO L226 Difference]: Without dead ends: 31 [2021-12-14 13:43:02,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:43:02,228 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:43:02,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 54 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:43:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-14 13:43:02,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2021-12-14 13:43:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:43:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-12-14 13:43:02,237 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 24 [2021-12-14 13:43:02,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:02,238 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-12-14 13:43:02,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 13:43:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-12-14 13:43:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 13:43:02,239 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:02,239 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, 1, 1, 1] [2021-12-14 13:43:02,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 13:43:02,239 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:02,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:02,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1601346639, now seen corresponding path program 1 times [2021-12-14 13:43:02,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:02,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920382185] [2021-12-14 13:43:02,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:02,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:02,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:02,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 13:43:02,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:02,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920382185] [2021-12-14 13:43:02,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920382185] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:43:02,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:43:02,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:43:02,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750970041] [2021-12-14 13:43:02,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:43:02,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:43:02,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:02,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:43:02,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:43:02,341 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 13:43:02,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:02,424 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2021-12-14 13:43:02,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:43:02,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2021-12-14 13:43:02,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:02,425 INFO L225 Difference]: With dead ends: 36 [2021-12-14 13:43:02,426 INFO L226 Difference]: Without dead ends: 32 [2021-12-14 13:43:02,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:43:02,427 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:43:02,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 85 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:43:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-14 13:43:02,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2021-12-14 13:43:02,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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-14 13:43:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-14 13:43:02,433 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 27 [2021-12-14 13:43:02,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:02,434 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-14 13:43:02,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 13:43:02,434 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-14 13:43:02,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 13:43:02,435 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:02,435 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, 1, 1, 1, 1, 1, 1] [2021-12-14 13:43:02,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 13:43:02,436 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:02,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:02,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1716470983, now seen corresponding path program 1 times [2021-12-14 13:43:02,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:02,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90201452] [2021-12-14 13:43:02,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:02,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:02,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:02,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 13:43:02,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:02,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90201452] [2021-12-14 13:43:02,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90201452] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:43:02,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:43:02,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:43:02,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601531112] [2021-12-14 13:43:02,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:43:02,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:43:02,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:02,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:43:02,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:43:02,660 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 13:43:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:02,758 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2021-12-14 13:43:02,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:43:02,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-14 13:43:02,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:02,762 INFO L225 Difference]: With dead ends: 41 [2021-12-14 13:43:02,762 INFO L226 Difference]: Without dead ends: 29 [2021-12-14 13:43:02,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:43:02,764 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:43:02,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 82 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:43:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-14 13:43:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-14 13:43:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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-14 13:43:02,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-12-14 13:43:02,778 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 30 [2021-12-14 13:43:02,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:02,779 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-12-14 13:43:02,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 13:43:02,779 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-12-14 13:43:02,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 13:43:02,780 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:02,781 INFO L514 BasicCegarLoop]: trace histogram [2, 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-14 13:43:02,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 13:43:02,781 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:02,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:02,782 INFO L85 PathProgramCache]: Analyzing trace with hash 227364876, now seen corresponding path program 1 times [2021-12-14 13:43:02,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:02,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891066368] [2021-12-14 13:43:02,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:02,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:02,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:02,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 13:43:02,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:02,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891066368] [2021-12-14 13:43:02,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891066368] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:43:02,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349401738] [2021-12-14 13:43:02,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:02,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:02,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:43:02,919 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-14 13:43:02,929 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-14 13:43:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:03,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 13:43:03,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:43:03,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 13:43:03,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:43:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 13:43:03,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349401738] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:43:03,364 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:43:03,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2021-12-14 13:43:03,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68368946] [2021-12-14 13:43:03,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:43:03,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 13:43:03,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:03,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 13:43:03,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:43:03,366 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 13:43:03,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:03,413 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2021-12-14 13:43:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:43:03,414 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2021-12-14 13:43:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:03,416 INFO L225 Difference]: With dead ends: 44 [2021-12-14 13:43:03,416 INFO L226 Difference]: Without dead ends: 40 [2021-12-14 13:43:03,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:43:03,422 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 79 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:43:03,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 80 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:43:03,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-14 13:43:03,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2021-12-14 13:43:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:43:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2021-12-14 13:43:03,434 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 32 [2021-12-14 13:43:03,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:03,435 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2021-12-14 13:43:03,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 13:43:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2021-12-14 13:43:03,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 13:43:03,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:03,438 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2021-12-14 13:43:03,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-14 13:43:03,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-14 13:43:03,652 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:03,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:03,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1712337120, now seen corresponding path program 1 times [2021-12-14 13:43:03,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:03,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696998250] [2021-12-14 13:43:03,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:03,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:03,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:03,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 13:43:03,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:03,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696998250] [2021-12-14 13:43:03,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696998250] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:43:03,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570298379] [2021-12-14 13:43:03,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:03,905 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:03,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:43:03,908 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-14 13:43:03,938 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-14 13:43:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:04,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-14 13:43:04,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:43:04,090 INFO L388 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-14 13:43:04,215 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:43:04,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 13:43:04,253 INFO L388 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-14 13:43:04,309 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:43:04,310 INFO L388 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 19 treesize of output 22 [2021-12-14 13:43:04,382 INFO L354 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2021-12-14 13:43:04,383 INFO L388 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 43 treesize of output 27 [2021-12-14 13:43:04,386 INFO L388 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 13 treesize of output 9 [2021-12-14 13:43:04,432 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 13:43:04,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:43:04,477 INFO L388 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 29 treesize of output 21 [2021-12-14 13:43:04,586 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_570 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_570))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (not (= .cse0 (select (select .cse1 .cse0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) is different from false [2021-12-14 13:43:04,623 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:43:04,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 45 [2021-12-14 13:43:04,665 INFO L354 Elim1Store]: treesize reduction 21, result has 67.2 percent of original size [2021-12-14 13:43:04,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 129 [2021-12-14 13:43:04,681 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:43:04,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 92 [2021-12-14 13:43:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2021-12-14 13:43:05,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570298379] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:43:05,220 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:43:05,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 30 [2021-12-14 13:43:05,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731982777] [2021-12-14 13:43:05,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:43:05,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-14 13:43:05,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:05,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-14 13:43:05,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=734, Unknown=1, NotChecked=54, Total=870 [2021-12-14 13:43:05,222 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 22 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-14 13:43:05,345 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (forall ((v_ArrVal_570 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_570))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (not (= .cse0 (select (select .cse1 .cse0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) is different from false [2021-12-14 13:43:05,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:05,499 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2021-12-14 13:43:05,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 13:43:05,500 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 22 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 35 [2021-12-14 13:43:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:05,501 INFO L225 Difference]: With dead ends: 76 [2021-12-14 13:43:05,501 INFO L226 Difference]: Without dead ends: 62 [2021-12-14 13:43:05,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=946, Unknown=2, NotChecked=126, Total=1190 [2021-12-14 13:43:05,502 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:43:05,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 228 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 313 Invalid, 0 Unknown, 72 Unchecked, 0.2s Time] [2021-12-14 13:43:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-14 13:43:05,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2021-12-14 13:43:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 13:43:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2021-12-14 13:43:05,508 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 35 [2021-12-14 13:43:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:05,508 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2021-12-14 13:43:05,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 22 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-14 13:43:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2021-12-14 13:43:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 13:43:05,509 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:05,509 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:43:05,532 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-14 13:43:05,724 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,SelfDestructingSolverStorable6 [2021-12-14 13:43:05,724 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:05,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:05,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1654075515, now seen corresponding path program 2 times [2021-12-14 13:43:05,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:05,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040279104] [2021-12-14 13:43:05,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:05,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:06,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:06,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 13:43:06,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:06,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040279104] [2021-12-14 13:43:06,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040279104] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:43:06,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071826776] [2021-12-14 13:43:06,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:43:06,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:06,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:43:06,461 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-14 13:43:06,487 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-14 13:43:06,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:43:06,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:43:06,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 141 conjunts are in the unsatisfiable core [2021-12-14 13:43:06,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:43:06,661 INFO L388 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-14 13:43:06,940 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:43:06,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 13:43:07,005 INFO L388 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-14 13:43:07,012 INFO L388 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-14 13:43:07,095 INFO L388 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-14 13:43:07,100 INFO L388 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-14 13:43:07,787 INFO L354 Elim1Store]: treesize reduction 143, result has 15.4 percent of original size [2021-12-14 13:43:07,788 INFO L388 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 335 treesize of output 145 [2021-12-14 13:43:07,820 INFO L354 Elim1Store]: treesize reduction 80, result has 21.6 percent of original size [2021-12-14 13:43:07,821 INFO L388 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 6 new quantified variables, introduced 4 case distinctions, treesize of input 244 treesize of output 110 [2021-12-14 13:43:08,752 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:43:08,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:43:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 13:43:09,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071826776] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:43:09,065 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:43:09,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 7] total 36 [2021-12-14 13:43:09,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068983516] [2021-12-14 13:43:09,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:43:09,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-14 13:43:09,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:09,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-14 13:43:09,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1131, Unknown=0, NotChecked=0, Total=1260 [2021-12-14 13:43:09,067 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 31 states have internal predecessors, (75), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-14 13:43:10,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:10,949 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2021-12-14 13:43:10,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-14 13:43:10,950 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 31 states have internal predecessors, (75), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2021-12-14 13:43:10,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:10,951 INFO L225 Difference]: With dead ends: 109 [2021-12-14 13:43:10,951 INFO L226 Difference]: Without dead ends: 95 [2021-12-14 13:43:10,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=429, Invalid=3477, Unknown=0, NotChecked=0, Total=3906 [2021-12-14 13:43:10,953 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 136 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 13:43:10,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 316 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 475 Invalid, 0 Unknown, 28 Unchecked, 0.5s Time] [2021-12-14 13:43:10,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-14 13:43:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 54. [2021-12-14 13:43:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 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-14 13:43:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2021-12-14 13:43:10,962 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 40 [2021-12-14 13:43:10,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:10,962 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2021-12-14 13:43:10,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 31 states have internal predecessors, (75), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-14 13:43:10,962 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2021-12-14 13:43:10,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 13:43:10,963 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:10,963 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:43:10,991 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-14 13:43:11,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:11,184 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:11,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:11,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1985500800, now seen corresponding path program 3 times [2021-12-14 13:43:11,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:11,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513557454] [2021-12-14 13:43:11,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:11,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:11,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 13:43:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:11,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:43:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 13:43:11,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:11,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513557454] [2021-12-14 13:43:11,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513557454] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:43:11,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177378917] [2021-12-14 13:43:11,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 13:43:11,731 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:43:11,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:43:11,732 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-14 13:43:11,781 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-14 13:43:12,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-14 13:43:12,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:43:12,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 105 conjunts are in the unsatisfiable core [2021-12-14 13:43:12,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:43:12,472 INFO L388 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-14 13:43:12,694 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:43:12,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 13:43:12,740 INFO L388 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-14 13:43:12,749 INFO L388 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-14 13:43:12,827 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-14 13:43:12,827 INFO L388 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 47 treesize of output 33 [2021-12-14 13:43:12,833 INFO L388 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-14 13:43:13,242 INFO L354 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2021-12-14 13:43:13,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 41 [2021-12-14 13:43:13,252 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 13:43:13,261 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-12-14 13:43:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 13:43:13,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:43:14,337 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (let ((.cse5 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (let ((.cse2 (select (select .cse1 .cse0) .cse5)) (.cse3 (select (select .cse4 .cse0) .cse5))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) (not (= .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)))))) is different from false [2021-12-14 13:43:14,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:43:37,208 WARN L227 SmtUtils]: Spent 22.76s on a formula simplification. DAG size of input: 2031 DAG size of output: 957 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-14 13:43:37,220 INFO L354 Elim1Store]: treesize reduction 31822, result has 35.4 percent of original size [2021-12-14 13:43:37,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 35 select indices, 35 select index equivalence classes, 0 disjoint index pairs (out of 595 index pairs), introduced 51 new quantified variables, introduced 595 case distinctions, treesize of input 242216 treesize of output 193560