./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/dll2c_prepend_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-15 23:55:53,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 23:55:53,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 23:55:53,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 23:55:53,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 23:55:53,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 23:55:53,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 23:55:53,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 23:55:53,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 23:55:53,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 23:55:53,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 23:55:53,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 23:55:53,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 23:55:53,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 23:55:53,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 23:55:53,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 23:55:53,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 23:55:53,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 23:55:53,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 23:55:53,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 23:55:53,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 23:55:53,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 23:55:53,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 23:55:53,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 23:55:53,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 23:55:53,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 23:55:53,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 23:55:53,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 23:55:53,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 23:55:53,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 23:55:53,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 23:55:53,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 23:55:53,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 23:55:53,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 23:55:53,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 23:55:53,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 23:55:53,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 23:55:53,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 23:55:53,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 23:55:53,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 23:55:53,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 23:55:53,299 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 23:55:53,321 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 23:55:53,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 23:55:53,322 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 23:55:53,322 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 23:55:53,323 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 23:55:53,323 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 23:55:53,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 23:55:53,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 23:55:53,323 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 23:55:53,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 23:55:53,324 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 23:55:53,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 23:55:53,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 23:55:53,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 23:55:53,325 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 23:55:53,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 23:55:53,325 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 23:55:53,325 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 23:55:53,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 23:55:53,326 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 23:55:53,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 23:55:53,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 23:55:53,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 23:55:53,326 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 23:55:53,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:55:53,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 23:55:53,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 23:55:53,327 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 23:55:53,327 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 23:55:53,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 23:55:53,327 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 23:55:53,327 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 23:55:53,328 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 23:55:53,328 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 23:55:53,328 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 -> e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 [2021-12-15 23:55:53,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 23:55:53,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 23:55:53,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 23:55:53,527 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 23:55:53,528 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 23:55:53,529 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2021-12-15 23:55:53,584 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539f9d931/00dd4092c23c45818e044cee8663b645/FLAG99e2eb5ea [2021-12-15 23:55:53,953 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 23:55:53,954 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2021-12-15 23:55:53,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539f9d931/00dd4092c23c45818e044cee8663b645/FLAG99e2eb5ea [2021-12-15 23:55:53,969 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539f9d931/00dd4092c23c45818e044cee8663b645 [2021-12-15 23:55:53,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 23:55:53,972 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 23:55:53,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 23:55:53,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 23:55:53,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 23:55:53,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:55:53" (1/1) ... [2021-12-15 23:55:53,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f611c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:53, skipping insertion in model container [2021-12-15 23:55:53,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:55:53" (1/1) ... [2021-12-15 23:55:53,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 23:55:54,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 23:55:54,233 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/dll2c_prepend_equal.i[24640,24653] [2021-12-15 23:55:54,236 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:55:54,241 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 23:55:54,272 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/dll2c_prepend_equal.i[24640,24653] [2021-12-15 23:55:54,273 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:55:54,288 INFO L208 MainTranslator]: Completed translation [2021-12-15 23:55:54,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:54 WrapperNode [2021-12-15 23:55:54,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 23:55:54,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 23:55:54,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 23:55:54,290 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 23:55:54,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:54" (1/1) ... [2021-12-15 23:55:54,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:54" (1/1) ... [2021-12-15 23:55:54,319 INFO L137 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 134 [2021-12-15 23:55:54,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 23:55:54,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 23:55:54,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 23:55:54,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 23:55:54,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:54" (1/1) ... [2021-12-15 23:55:54,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:54" (1/1) ... [2021-12-15 23:55:54,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:54" (1/1) ... [2021-12-15 23:55:54,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:54" (1/1) ... [2021-12-15 23:55:54,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:54" (1/1) ... [2021-12-15 23:55:54,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:54" (1/1) ... [2021-12-15 23:55:54,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:54" (1/1) ... [2021-12-15 23:55:54,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 23:55:54,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 23:55:54,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 23:55:54,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 23:55:54,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:54" (1/1) ... [2021-12-15 23:55:54,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:55:54,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:55:54,388 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-15 23:55:54,390 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-15 23:55:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 23:55:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 23:55:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-15 23:55:54,414 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-15 23:55:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 23:55:54,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 23:55:54,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 23:55:54,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 23:55:54,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 23:55:54,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 23:55:54,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-15 23:55:54,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 23:55:54,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 23:55:54,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 23:55:54,509 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 23:55:54,510 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 23:55:54,712 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 23:55:54,716 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 23:55:54,717 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-15 23:55:54,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:55:54 BoogieIcfgContainer [2021-12-15 23:55:54,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 23:55:54,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 23:55:54,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 23:55:54,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 23:55:54,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:55:53" (1/3) ... [2021-12-15 23:55:54,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39560daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:55:54, skipping insertion in model container [2021-12-15 23:55:54,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:55:54" (2/3) ... [2021-12-15 23:55:54,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39560daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:55:54, skipping insertion in model container [2021-12-15 23:55:54,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:55:54" (3/3) ... [2021-12-15 23:55:54,731 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2021-12-15 23:55:54,735 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 23:55:54,735 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 23:55:54,765 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 23:55:54,770 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-15 23:55:54,770 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 23:55:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 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-15 23:55:54,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 23:55:54,785 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:55:54,786 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-15 23:55:54,787 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:55:54,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:55:54,794 INFO L85 PathProgramCache]: Analyzing trace with hash 976010426, now seen corresponding path program 1 times [2021-12-15 23:55:54,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:55:54,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837353029] [2021-12-15 23:55:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:55:54,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:55:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:55,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:55:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:55,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-15 23:55:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:55:55,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:55:55,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837353029] [2021-12-15 23:55:55,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837353029] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:55:55,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:55:55,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 23:55:55,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65087500] [2021-12-15 23:55:55,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:55:55,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 23:55:55,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:55:55,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 23:55:55,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:55:55,127 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:55:55,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:55:55,202 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2021-12-15 23:55:55,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 23:55:55,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2021-12-15 23:55:55,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:55:55,210 INFO L225 Difference]: With dead ends: 61 [2021-12-15 23:55:55,211 INFO L226 Difference]: Without dead ends: 27 [2021-12-15 23:55:55,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:55:55,217 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 23:55:55,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 23:55:55,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-15 23:55:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-15 23:55:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-15 23:55:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2021-12-15 23:55:55,257 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 24 [2021-12-15 23:55:55,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:55:55,258 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2021-12-15 23:55:55,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:55:55,259 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2021-12-15 23:55:55,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 23:55:55,261 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:55:55,261 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-15 23:55:55,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 23:55:55,262 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:55:55,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:55:55,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1442307826, now seen corresponding path program 1 times [2021-12-15 23:55:55,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:55:55,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863337462] [2021-12-15 23:55:55,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:55:55,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:55:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:55,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:55:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:55,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-15 23:55:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:55:55,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:55:55,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863337462] [2021-12-15 23:55:55,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863337462] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:55:55,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:55:55,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 23:55:55,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002266337] [2021-12-15 23:55:55,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:55:55,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:55:55,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:55:55,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:55:55,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:55:55,408 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:55:55,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:55:55,473 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2021-12-15 23:55:55,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:55:55,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2021-12-15 23:55:55,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:55:55,475 INFO L225 Difference]: With dead ends: 50 [2021-12-15 23:55:55,475 INFO L226 Difference]: Without dead ends: 32 [2021-12-15 23:55:55,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:55:55,476 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 23:55:55,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 71 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 23:55:55,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-15 23:55:55,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2021-12-15 23:55:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:55:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-12-15 23:55:55,482 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2021-12-15 23:55:55,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:55:55,482 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-15 23:55:55,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:55:55,482 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-12-15 23:55:55,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 23:55:55,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:55:55,483 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:55:55,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 23:55:55,484 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:55:55,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:55:55,484 INFO L85 PathProgramCache]: Analyzing trace with hash 915772386, now seen corresponding path program 1 times [2021-12-15 23:55:55,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:55:55,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291535190] [2021-12-15 23:55:55,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:55:55,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:55:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:55,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:55:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:55,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-15 23:55:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:55,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-15 23:55:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:55:55,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:55:55,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291535190] [2021-12-15 23:55:55,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291535190] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:55:55,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480013765] [2021-12-15 23:55:55,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:55:55,823 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:55:55,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:55:55,825 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-15 23:55:55,829 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-15 23:55:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:55,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-15 23:55:55,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:55:56,351 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 17 treesize of output 9 [2021-12-15 23:55:56,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:56,480 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 24 treesize of output 24 [2021-12-15 23:55:56,512 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 25 treesize of output 13 [2021-12-15 23:55:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 23:55:56,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:55:56,631 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_9| Int) (v_ArrVal_452 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_9| v_ArrVal_452) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_9|) (<= (+ .cse0 1) 0) (<= 1 .cse0)))) is different from false [2021-12-15 23:55:56,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480013765] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:55:56,633 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:55:56,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2021-12-15 23:55:56,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163983187] [2021-12-15 23:55:56,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:55:56,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-15 23:55:56,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:55:56,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-15 23:55:56,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=572, Unknown=1, NotChecked=48, Total=702 [2021-12-15 23:55:56,636 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-15 23:55:57,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:55:57,156 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2021-12-15 23:55:57,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 23:55:57,162 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2021-12-15 23:55:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:55:57,163 INFO L225 Difference]: With dead ends: 37 [2021-12-15 23:55:57,163 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 23:55:57,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=920, Unknown=1, NotChecked=62, Total=1122 [2021-12-15 23:55:57,165 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 23:55:57,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 219 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 186 Invalid, 0 Unknown, 22 Unchecked, 0.3s Time] [2021-12-15 23:55:57,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 23:55:57,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-12-15 23:55:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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-15 23:55:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-12-15 23:55:57,170 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 34 [2021-12-15 23:55:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:55:57,170 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-15 23:55:57,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-15 23:55:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2021-12-15 23:55:57,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 23:55:57,171 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:55:57,171 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:55:57,191 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-15 23:55:57,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:55:57,380 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:55:57,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:55:57,380 INFO L85 PathProgramCache]: Analyzing trace with hash 917619428, now seen corresponding path program 1 times [2021-12-15 23:55:57,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:55:57,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279498492] [2021-12-15 23:55:57,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:55:57,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:55:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:57,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:55:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:57,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-15 23:55:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:58,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-15 23:55:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:55:58,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:55:58,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279498492] [2021-12-15 23:55:58,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279498492] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:55:58,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296434462] [2021-12-15 23:55:58,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:55:58,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:55:58,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:55:58,155 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-15 23:55:58,203 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-15 23:55:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:55:58,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 131 conjunts are in the unsatisfiable core [2021-12-15 23:55:58,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:55:58,381 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-15 23:55:58,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 23:55:58,708 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 23:55:58,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 23:55:58,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:58,971 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 14 [2021-12-15 23:55:58,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-15 23:55:59,160 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:55:59,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2021-12-15 23:55:59,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 23:55:59,172 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 7 treesize of output 3 [2021-12-15 23:55:59,263 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 23:55:59,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:59,397 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 23:55:59,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 57 [2021-12-15 23:55:59,416 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-15 23:55:59,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-15 23:55:59,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:59,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 23:55:59,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:59,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:59,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:59,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:59,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:59,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:59,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:59,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:59,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2021-12-15 23:55:59,694 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 0 case distinctions, treesize of input 90 treesize of output 77 [2021-12-15 23:55:59,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:59,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:59,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:59,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2021-12-15 23:55:59,719 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:55:59,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 55 [2021-12-15 23:55:59,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:55:59,756 INFO L354 Elim1Store]: treesize reduction 74, result has 17.8 percent of original size [2021-12-15 23:55:59,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 88 [2021-12-15 23:55:59,777 INFO L354 Elim1Store]: treesize reduction 154, result has 17.6 percent of original size [2021-12-15 23:55:59,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 53 [2021-12-15 23:55:59,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-15 23:55:59,845 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 34 treesize of output 22 [2021-12-15 23:55:59,848 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 21 treesize of output 13 [2021-12-15 23:55:59,888 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 19 treesize of output 7 [2021-12-15 23:55:59,928 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:55:59,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:56:00,006 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_949 Int) (v_ArrVal_935 Int) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_940 (Array Int Int)) (v_ArrVal_953 (Array Int Int)) (v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_944 (Array Int Int)) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (v_ArrVal_945 (Array Int Int)) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (= (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) (+ (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_954))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_949))) .cse2 v_ArrVal_945) .cse3 v_ArrVal_941))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_935))) (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_951) .cse2 v_ArrVal_944) .cse3 v_ArrVal_948) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_953) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_940) .cse2 v_ArrVal_946) .cse3 v_ArrVal_942) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_938) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-15 23:56:00,028 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_949 Int) (v_ArrVal_935 Int) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_940 (Array Int Int)) (v_ArrVal_953 (Array Int Int)) (v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_944 (Array Int Int)) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (v_ArrVal_945 (Array Int Int)) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (= (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) (+ (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_954))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| v_ArrVal_949))) .cse2 v_ArrVal_945) .cse3 v_ArrVal_941))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 4) v_ArrVal_935))) (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_951) .cse2 v_ArrVal_944) .cse3 v_ArrVal_948) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_953) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_940) .cse2 v_ArrVal_946) .cse3 v_ArrVal_942) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_938) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-15 23:56:00,140 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:00,141 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 279 treesize of output 250 [2021-12-15 23:56:00,188 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:00,190 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 991716 treesize of output 982766 [2021-12-15 23:56:00,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1034914 treesize of output 974498 [2021-12-15 23:56:01,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1078946 treesize of output 958114 [2021-12-15 23:56:01,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1402562 treesize of output 1316802 [2021-12-15 23:56:18,062 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-15 23:56:18,062 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-15 23:56:18,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2021-12-15 23:56:18,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358704190] [2021-12-15 23:56:18,062 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-15 23:56:18,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-15 23:56:18,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:18,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-15 23:56:18,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1777, Unknown=3, NotChecked=170, Total=2070 [2021-12-15 23:56:18,064 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 22 states, 20 states have (on average 1.4) internal successors, (28), 18 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:56:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:19,119 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2021-12-15 23:56:19,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 23:56:19,120 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.4) internal successors, (28), 18 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2021-12-15 23:56:19,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:19,121 INFO L225 Difference]: With dead ends: 33 [2021-12-15 23:56:19,121 INFO L226 Difference]: Without dead ends: 31 [2021-12-15 23:56:19,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=186, Invalid=2680, Unknown=4, NotChecked=210, Total=3080 [2021-12-15 23:56:19,123 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:19,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 182 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-15 23:56:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-15 23:56:19,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-12-15 23:56:19,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:56:19,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-12-15 23:56:19,127 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 34 [2021-12-15 23:56:19,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:19,127 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-12-15 23:56:19,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.4) internal successors, (28), 18 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:56:19,128 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2021-12-15 23:56:19,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-15 23:56:19,128 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:19,129 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:19,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-15 23:56:19,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-15 23:56:19,336 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:19,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:19,336 INFO L85 PathProgramCache]: Analyzing trace with hash -665604212, now seen corresponding path program 1 times [2021-12-15 23:56:19,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:19,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458821669] [2021-12-15 23:56:19,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:19,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:19,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:56:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:19,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-15 23:56:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:19,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-15 23:56:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:56:19,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:19,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458821669] [2021-12-15 23:56:19,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458821669] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:19,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394367009] [2021-12-15 23:56:19,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:19,939 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:19,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:19,941 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-15 23:56:19,942 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-15 23:56:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:20,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 115 conjunts are in the unsatisfiable core [2021-12-15 23:56:20,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:20,135 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-15 23:56:20,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 23:56:20,252 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 23:56:20,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 23:56:20,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 23:56:20,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:20,428 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 23:56:20,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22 [2021-12-15 23:56:20,621 INFO L354 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2021-12-15 23:56:20,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 55 [2021-12-15 23:56:20,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-12-15 23:56:20,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2021-12-15 23:56:20,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2021-12-15 23:56:20,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 23:56:20,667 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 46 treesize of output 22 [2021-12-15 23:56:20,791 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-12-15 23:56:20,791 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 54 treesize of output 21 [2021-12-15 23:56:20,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:20,798 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 23:56:20,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2021-12-15 23:56:20,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:20,960 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 23:56:20,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 60 [2021-12-15 23:56:20,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:20,965 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 44 treesize of output 44 [2021-12-15 23:56:20,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:20,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:20,980 INFO L354 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2021-12-15 23:56:20,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 39 [2021-12-15 23:56:21,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:21,119 INFO L354 Elim1Store]: treesize reduction 61, result has 17.6 percent of original size [2021-12-15 23:56:21,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 446 treesize of output 179 [2021-12-15 23:56:21,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:21,195 INFO L354 Elim1Store]: treesize reduction 352, result has 14.1 percent of original size [2021-12-15 23:56:21,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 386 treesize of output 291 [2021-12-15 23:56:21,206 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 0 case distinctions, treesize of input 332 treesize of output 263 [2021-12-15 23:56:21,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:21,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:21,223 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-15 23:56:21,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 102 [2021-12-15 23:56:21,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 190 [2021-12-15 23:56:21,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:21,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2021-12-15 23:56:21,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2021-12-15 23:56:21,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2021-12-15 23:56:21,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:21,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2021-12-15 23:56:21,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-15 23:56:21,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:21,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:21,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:21,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 53 [2021-12-15 23:56:21,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-15 23:56:21,326 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-15 23:56:21,327 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 166 [2021-12-15 23:56:21,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-15 23:56:21,405 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 85 treesize of output 65 [2021-12-15 23:56:21,534 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-12-15 23:56:21,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 32 [2021-12-15 23:56:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 23:56:21,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:56:21,574 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1447 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1450 (Array Int Int))) (not (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (let ((.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (store (store (store (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_1461) .cse3 v_ArrVal_1447) .cse4 v_ArrVal_1452) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_1451) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse3 v_ArrVal_1458) .cse4 v_ArrVal_1463) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) .cse4))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_1459) .cse3 v_ArrVal_1445) .cse4 v_ArrVal_1450) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_1466) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2021-12-15 23:56:21,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1447 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1450 (Array Int Int))) (not (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (let ((.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)))) (store (store (store (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_1461) .cse3 v_ArrVal_1447) .cse4 v_ArrVal_1452) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_1451) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse3 v_ArrVal_1458) .cse4 v_ArrVal_1463) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) .cse4))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_1459) .cse3 v_ArrVal_1445) .cse4 v_ArrVal_1450) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_1466) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2021-12-15 23:56:22,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394367009] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:22,017 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:56:22,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 43 [2021-12-15 23:56:22,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070993434] [2021-12-15 23:56:22,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:56:22,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-15 23:56:22,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:22,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-15 23:56:22,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1759, Unknown=3, NotChecked=170, Total=2070 [2021-12-15 23:56:22,019 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 43 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 34 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 23:56:23,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:23,046 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2021-12-15 23:56:23,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-15 23:56:23,046 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 34 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2021-12-15 23:56:23,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:23,047 INFO L225 Difference]: With dead ends: 36 [2021-12-15 23:56:23,047 INFO L226 Difference]: Without dead ends: 33 [2021-12-15 23:56:23,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=236, Invalid=2739, Unknown=3, NotChecked=214, Total=3192 [2021-12-15 23:56:23,049 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:23,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 271 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 414 Invalid, 0 Unknown, 24 Unchecked, 0.5s Time] [2021-12-15 23:56:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-15 23:56:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-12-15 23:56:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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-15 23:56:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2021-12-15 23:56:23,054 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 37 [2021-12-15 23:56:23,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:23,055 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2021-12-15 23:56:23,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 34 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 23:56:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2021-12-15 23:56:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 23:56:23,056 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:23,056 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:23,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 23:56:23,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:23,260 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:23,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:23,260 INFO L85 PathProgramCache]: Analyzing trace with hash 841147066, now seen corresponding path program 1 times [2021-12-15 23:56:23,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:23,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768566853] [2021-12-15 23:56:23,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:23,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:23,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:56:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:23,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-15 23:56:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:24,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-15 23:56:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:56:24,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:24,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768566853] [2021-12-15 23:56:24,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768566853] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:24,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25578855] [2021-12-15 23:56:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:24,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:24,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:24,252 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-15 23:56:24,253 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-15 23:56:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:24,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 184 conjunts are in the unsatisfiable core [2021-12-15 23:56:24,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:24,500 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-15 23:56:24,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 23:56:24,658 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 23:56:24,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 23:56:24,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 23:56:24,821 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 23:56:24,895 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-15 23:56:24,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-15 23:56:24,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-15 23:56:25,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 23:56:25,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-15 23:56:25,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2021-12-15 23:56:25,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2021-12-15 23:56:25,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-15 23:56:25,386 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:25,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 33 [2021-12-15 23:56:25,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-15 23:56:25,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2021-12-15 23:56:25,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,599 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 23:56:25,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 64 [2021-12-15 23:56:25,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 23:56:25,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,624 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-15 23:56:25,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2021-12-15 23:56:25,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 23:56:25,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 280 [2021-12-15 23:56:25,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 130 [2021-12-15 23:56:25,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:56:25,868 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-15 23:56:25,868 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 526 treesize of output 226 [2021-12-15 23:56:25,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:25,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2021-12-15 23:56:25,959 INFO L354 Elim1Store]: treesize reduction 328, result has 12.3 percent of original size [2021-12-15 23:56:25,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 401 treesize of output 292 [2021-12-15 23:56:25,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 246 [2021-12-15 23:56:25,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 167 [2021-12-15 23:56:25,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2021-12-15 23:56:25,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-15 23:56:26,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 31 [2021-12-15 23:56:26,010 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 20 treesize of output 19 [2021-12-15 23:56:26,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2021-12-15 23:56:26,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2021-12-15 23:56:26,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:26,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 50 [2021-12-15 23:56:26,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-12-15 23:56:26,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:26,074 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-12-15 23:56:26,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 98 [2021-12-15 23:56:26,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 54 [2021-12-15 23:56:26,124 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-15 23:56:26,125 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 131 [2021-12-15 23:56:26,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2021-12-15 23:56:26,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:26,462 INFO L354 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2021-12-15 23:56:26,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 149 treesize of output 63 [2021-12-15 23:56:26,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:26,474 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 23:56:26,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 19 [2021-12-15 23:56:26,566 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 15 treesize of output 7 [2021-12-15 23:56:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 23:56:26,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:56:26,984 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1998 (Array Int Int)) (v_ArrVal_2009 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1997 (Array Int Int)) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1994 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2000 (Array Int Int)) (v_ArrVal_2006 Int) (v_ArrVal_1969 (Array Int Int)) (v_ArrVal_1989 Int) (v_ArrVal_1979 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse5 (select .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse6 (+ .cse14 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse11 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse8 (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse13 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_1995) .cse5 v_ArrVal_1977) .cse7 v_ArrVal_1993) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_1988) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_1980) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse14)) .cse5 v_ArrVal_2000) .cse7 v_ArrVal_1975) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse11 v_ArrVal_2006))) (.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (store (store (store (store .cse10 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_1997) .cse5 v_ArrVal_1979) .cse7 v_ArrVal_1973) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_1969) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse5)) .cse5 v_ArrVal_1991) .cse7 v_ArrVal_1998) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse11 .cse7))))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select .cse9 .cse1) .cse3)) (.cse2 (select (select .cse8 .cse1) .cse3))) (or (and (= .cse0 .cse1) (= .cse2 .cse3)) (= (select (select (store (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_1986) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_2009))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_1989))) .cse7 v_ArrVal_2002) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_1994) .cse0) (+ .cse2 8)) |c_ULTIMATE.start_main_~data~0#1|)))))))))) is different from false [2021-12-15 23:56:27,136 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1998 (Array Int Int)) (v_ArrVal_2009 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1997 (Array Int Int)) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1994 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2000 (Array Int Int)) (v_ArrVal_2006 Int) (v_ArrVal_1969 (Array Int Int)) (v_ArrVal_1989 Int) (v_ArrVal_1979 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse5 (select .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse6 (+ .cse14 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse11 (+ |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 4))) (let ((.cse8 (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse13 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_1995) .cse5 v_ArrVal_1977) .cse7 v_ArrVal_1993) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_1988) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_1980) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| .cse14)) .cse5 v_ArrVal_2000) .cse7 v_ArrVal_1975) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) .cse11 v_ArrVal_2006))) (.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)))) (store (store (store (store .cse10 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_1997) .cse5 v_ArrVal_1979) .cse7 v_ArrVal_1973) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_1969) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| .cse5)) .cse5 v_ArrVal_1991) .cse7 v_ArrVal_1998) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) .cse11 .cse7))))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse9 .cse3) .cse1)) (.cse0 (select (select .cse8 .cse3) .cse1))) (or (and (= .cse0 .cse1) (= .cse2 .cse3)) (= (select (select (store (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_1986) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_2009))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_1989))) .cse7 v_ArrVal_2002) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_1994) .cse2) (+ .cse0 8)) |c_ULTIMATE.start_main_~data~0#1|)))))))))) is different from false [2021-12-15 23:56:27,588 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1998 (Array Int Int)) (v_ArrVal_2009 (Array Int Int)) (v_ArrVal_2019 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1997 (Array Int Int)) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1994 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1991 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2000 (Array Int Int)) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2020 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21| Int) (v_ArrVal_2006 Int) (v_ArrVal_1969 (Array Int Int)) (v_ArrVal_1989 Int) (v_ArrVal_1979 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21| v_ArrVal_2021))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21| v_ArrVal_2019)) (.cse14 (select .cse13 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse12 (select .cse11 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse2 (+ .cse15 4))) (let ((.cse3 (select (select .cse11 .cse1) .cse2))) (let ((.cse9 (store (store (store (store (store .cse13 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0)) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21| v_ArrVal_1995) .cse1 v_ArrVal_1977) .cse3 v_ArrVal_1993) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21| (store (select (store (store (store (store .cse13 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_1988) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21| (store (select (store .cse13 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_1980) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21|) 0 .cse15)) .cse1 v_ArrVal_2000) .cse3 v_ArrVal_1975) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21|) 4 v_ArrVal_2006))) (.cse8 (let ((.cse10 (store .cse11 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21|)))) (store (store (store (store .cse10 |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21| v_ArrVal_1997) .cse1 v_ArrVal_1979) .cse3 v_ArrVal_1973) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21| (store (select (store (store (store (store .cse11 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_1969) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21| (store (select .cse10 |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21|) 0 .cse1)) .cse1 v_ArrVal_1991) .cse3 v_ArrVal_1998) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21|) 4 .cse3))))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select .cse9 .cse7) .cse6)) (.cse4 (select (select .cse8 .cse7) .cse6))) (or (= (select (select (store (store (let ((.cse0 (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21| v_ArrVal_2020) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_1986) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21| v_ArrVal_2009))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_1989))) .cse3 v_ArrVal_2002) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21| v_ArrVal_1994) .cse4) (+ .cse5 8)) |c_ULTIMATE.start_main_~data~0#1|) (and (= .cse5 .cse6) (= .cse4 .cse7)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21|))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_21|))))))))))) is different from false [2021-12-15 23:56:27,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25578855] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:27,591 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:56:27,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 49 [2021-12-15 23:56:27,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81485805] [2021-12-15 23:56:27,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:56:27,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-15 23:56:27,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:27,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-15 23:56:27,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2696, Unknown=5, NotChecked=318, Total=3192 [2021-12-15 23:56:27,593 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 49 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 23:56:29,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:29,480 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2021-12-15 23:56:29,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-15 23:56:29,480 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2021-12-15 23:56:29,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:29,481 INFO L225 Difference]: With dead ends: 59 [2021-12-15 23:56:29,481 INFO L226 Difference]: Without dead ends: 57 [2021-12-15 23:56:29,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=267, Invalid=3900, Unknown=5, NotChecked=384, Total=4556 [2021-12-15 23:56:29,483 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:29,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 242 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 795 Invalid, 0 Unknown, 6 Unchecked, 1.3s Time] [2021-12-15 23:56:29,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-15 23:56:29,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2021-12-15 23:56:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-15 23:56:29,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2021-12-15 23:56:29,489 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 38 [2021-12-15 23:56:29,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:29,489 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2021-12-15 23:56:29,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 23:56:29,490 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2021-12-15 23:56:29,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-15 23:56:29,490 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:29,491 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:29,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 23:56:29,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:29,691 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:29,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:29,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1773893622, now seen corresponding path program 1 times [2021-12-15 23:56:29,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:29,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407304666] [2021-12-15 23:56:29,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:29,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:30,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:56:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:30,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-15 23:56:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:30,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-15 23:56:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:56:30,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:30,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407304666] [2021-12-15 23:56:30,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407304666] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:30,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956400823] [2021-12-15 23:56:30,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:30,453 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:30,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:30,454 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:56:30,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-15 23:56:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:30,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 180 conjunts are in the unsatisfiable core [2021-12-15 23:56:30,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:30,685 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-15 23:56:30,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 23:56:30,806 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 23:56:30,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 23:56:30,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 23:56:31,002 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: line 333661 column 46: unknown constant v_old(#valid)_AFTER_CALL_14 [2021-12-15 23:56:31,003 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-15 23:56:31,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-12-15 23:56:31,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312911164] [2021-12-15 23:56:31,003 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-15 23:56:31,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-15 23:56:31,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:31,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-15 23:56:31,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=849, Unknown=0, NotChecked=0, Total=930 [2021-12-15 23:56:31,004 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 25 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 21 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:56:31,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 23:56:31,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=849, Unknown=0, NotChecked=0, Total=930 [2021-12-15 23:56:31,005 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:31,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:31,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-15 23:56:31,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:31,207 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@54931f72 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 23:56:31,218 INFO L158 Benchmark]: Toolchain (without parser) took 37245.55ms. Allocated memory was 94.4MB in the beginning and 725.6MB in the end (delta: 631.2MB). Free memory was 54.7MB in the beginning and 533.1MB in the end (delta: -478.4MB). Peak memory consumption was 152.0MB. Max. memory is 16.1GB. [2021-12-15 23:56:31,218 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 23:56:31,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.41ms. Allocated memory is still 94.4MB. Free memory was 54.5MB in the beginning and 62.5MB in the end (delta: -8.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-15 23:56:31,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.17ms. Allocated memory is still 94.4MB. Free memory was 62.5MB in the beginning and 60.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 23:56:31,218 INFO L158 Benchmark]: Boogie Preprocessor took 20.72ms. Allocated memory is still 94.4MB. Free memory was 60.4MB in the beginning and 58.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 23:56:31,218 INFO L158 Benchmark]: RCFGBuilder took 376.12ms. Allocated memory is still 94.4MB. Free memory was 58.7MB in the beginning and 42.7MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-15 23:56:31,218 INFO L158 Benchmark]: TraceAbstraction took 36497.60ms. Allocated memory was 94.4MB in the beginning and 725.6MB in the end (delta: 631.2MB). Free memory was 42.3MB in the beginning and 533.1MB in the end (delta: -490.9MB). Peak memory consumption was 143.3MB. Max. memory is 16.1GB. [2021-12-15 23:56:31,219 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.41ms. Allocated memory is still 94.4MB. Free memory was 54.5MB in the beginning and 62.5MB in the end (delta: -8.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.17ms. Allocated memory is still 94.4MB. Free memory was 62.5MB in the beginning and 60.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.72ms. Allocated memory is still 94.4MB. Free memory was 60.4MB in the beginning and 58.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 376.12ms. Allocated memory is still 94.4MB. Free memory was 58.7MB in the beginning and 42.7MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 36497.60ms. Allocated memory was 94.4MB in the beginning and 725.6MB in the end (delta: 631.2MB). Free memory was 42.3MB in the beginning and 533.1MB in the end (delta: -490.9MB). Peak memory consumption was 143.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@54931f72 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@54931f72: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 23:56:31,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/dll2c_prepend_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-15 23:56:32,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 23:56:32,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 23:56:32,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 23:56:32,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 23:56:32,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 23:56:32,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 23:56:32,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 23:56:32,942 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 23:56:32,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 23:56:32,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 23:56:32,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 23:56:32,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 23:56:32,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 23:56:32,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 23:56:32,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 23:56:32,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 23:56:32,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 23:56:32,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 23:56:32,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 23:56:32,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 23:56:32,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 23:56:32,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 23:56:32,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 23:56:32,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 23:56:32,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 23:56:32,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 23:56:32,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 23:56:32,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 23:56:32,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 23:56:32,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 23:56:32,977 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 23:56:32,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 23:56:32,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 23:56:32,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 23:56:32,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 23:56:32,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 23:56:32,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 23:56:32,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 23:56:32,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 23:56:32,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 23:56:32,983 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-15 23:56:33,009 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 23:56:33,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 23:56:33,010 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 23:56:33,011 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 23:56:33,011 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 23:56:33,011 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 23:56:33,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 23:56:33,012 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 23:56:33,013 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 23:56:33,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 23:56:33,013 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 23:56:33,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 23:56:33,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 23:56:33,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 23:56:33,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 23:56:33,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 23:56:33,014 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 23:56:33,014 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-15 23:56:33,014 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-15 23:56:33,015 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 23:56:33,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 23:56:33,015 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 23:56:33,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 23:56:33,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 23:56:33,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 23:56:33,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 23:56:33,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:56:33,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 23:56:33,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 23:56:33,016 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 23:56:33,016 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-15 23:56:33,016 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-15 23:56:33,016 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 23:56:33,017 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 23:56:33,017 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 23:56:33,017 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 23:56:33,017 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-15 23:56:33,017 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 [2021-12-15 23:56:33,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 23:56:33,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 23:56:33,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 23:56:33,350 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 23:56:33,351 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 23:56:33,352 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2021-12-15 23:56:33,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4566d0d40/e864139dd58f4a02a7ebd654976a2fb4/FLAGdfcc84dcf [2021-12-15 23:56:33,794 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 23:56:33,797 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2021-12-15 23:56:33,816 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4566d0d40/e864139dd58f4a02a7ebd654976a2fb4/FLAGdfcc84dcf [2021-12-15 23:56:34,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4566d0d40/e864139dd58f4a02a7ebd654976a2fb4 [2021-12-15 23:56:34,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 23:56:34,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 23:56:34,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 23:56:34,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 23:56:34,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 23:56:34,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:56:34" (1/1) ... [2021-12-15 23:56:34,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d4539c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:34, skipping insertion in model container [2021-12-15 23:56:34,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:56:34" (1/1) ... [2021-12-15 23:56:34,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 23:56:34,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 23:56:34,428 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/dll2c_prepend_equal.i[24640,24653] [2021-12-15 23:56:34,432 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:56:34,442 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 23:56:34,480 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/dll2c_prepend_equal.i[24640,24653] [2021-12-15 23:56:34,484 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:56:34,503 INFO L208 MainTranslator]: Completed translation [2021-12-15 23:56:34,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:34 WrapperNode [2021-12-15 23:56:34,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 23:56:34,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 23:56:34,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 23:56:34,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 23:56:34,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:34" (1/1) ... [2021-12-15 23:56:34,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:34" (1/1) ... [2021-12-15 23:56:34,549 INFO L137 Inliner]: procedures = 130, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 135 [2021-12-15 23:56:34,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 23:56:34,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 23:56:34,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 23:56:34,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 23:56:34,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:34" (1/1) ... [2021-12-15 23:56:34,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:34" (1/1) ... [2021-12-15 23:56:34,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:34" (1/1) ... [2021-12-15 23:56:34,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:34" (1/1) ... [2021-12-15 23:56:34,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:34" (1/1) ... [2021-12-15 23:56:34,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:34" (1/1) ... [2021-12-15 23:56:34,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:34" (1/1) ... [2021-12-15 23:56:34,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 23:56:34,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 23:56:34,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 23:56:34,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 23:56:34,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:34" (1/1) ... [2021-12-15 23:56:34,599 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:56:34,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:34,615 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-15 23:56:34,617 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-15 23:56:34,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-15 23:56:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-15 23:56:34,638 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-15 23:56:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 23:56:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 23:56:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 23:56:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 23:56:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 23:56:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 23:56:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-15 23:56:34,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-15 23:56:34,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-15 23:56:34,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 23:56:34,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 23:56:34,743 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 23:56:34,744 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 23:56:35,100 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 23:56:35,104 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 23:56:35,105 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-15 23:56:35,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:56:35 BoogieIcfgContainer [2021-12-15 23:56:35,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 23:56:35,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 23:56:35,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 23:56:35,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 23:56:35,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:56:34" (1/3) ... [2021-12-15 23:56:35,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cef1790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:56:35, skipping insertion in model container [2021-12-15 23:56:35,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:34" (2/3) ... [2021-12-15 23:56:35,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cef1790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:56:35, skipping insertion in model container [2021-12-15 23:56:35,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:56:35" (3/3) ... [2021-12-15 23:56:35,113 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2021-12-15 23:56:35,124 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 23:56:35,124 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 23:56:35,154 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 23:56:35,159 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-15 23:56:35,159 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 23:56:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 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-15 23:56:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 23:56:35,173 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:35,174 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-15 23:56:35,174 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:35,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:35,178 INFO L85 PathProgramCache]: Analyzing trace with hash 976010426, now seen corresponding path program 1 times [2021-12-15 23:56:35,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:56:35,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94481025] [2021-12-15 23:56:35,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:35,187 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:56:35,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:56:35,189 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 23:56:35,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-15 23:56:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:35,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-15 23:56:35,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:56:35,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:56:35,433 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:56:35,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94481025] [2021-12-15 23:56:35,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94481025] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:56:35,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:56:35,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 23:56:35,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877277850] [2021-12-15 23:56:35,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:56:35,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 23:56:35,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:56:35,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 23:56:35,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 23:56:35,463 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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-15 23:56:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:35,483 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2021-12-15 23:56:35,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 23:56:35,485 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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-15 23:56:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:35,490 INFO L225 Difference]: With dead ends: 61 [2021-12-15 23:56:35,490 INFO L226 Difference]: Without dead ends: 27 [2021-12-15 23:56:35,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 23:56:35,496 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:35,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:35,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-15 23:56:35,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-15 23:56:35,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-15 23:56:35,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2021-12-15 23:56:35,527 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 24 [2021-12-15 23:56:35,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:35,529 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2021-12-15 23:56:35,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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-15 23:56:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2021-12-15 23:56:35,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 23:56:35,530 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:35,531 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-15 23:56:35,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-15 23:56:35,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 23:56:35,740 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:35,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:35,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1442307826, now seen corresponding path program 1 times [2021-12-15 23:56:35,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:56:35,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73826109] [2021-12-15 23:56:35,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:35,741 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:56:35,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:56:35,742 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 23:56:35,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-15 23:56:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:35,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 23:56:35,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:56:35,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:56:35,935 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:56:35,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73826109] [2021-12-15 23:56:35,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73826109] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:56:35,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:56:35,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 23:56:35,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963752497] [2021-12-15 23:56:35,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:56:35,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 23:56:35,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:56:35,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 23:56:35,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:56:35,944 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:56:35,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:35,958 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2021-12-15 23:56:35,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 23:56:35,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2021-12-15 23:56:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:35,963 INFO L225 Difference]: With dead ends: 50 [2021-12-15 23:56:35,964 INFO L226 Difference]: Without dead ends: 32 [2021-12-15 23:56:35,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-15 23:56:35,965 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:35,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-15 23:56:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2021-12-15 23:56:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:56:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-12-15 23:56:35,975 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2021-12-15 23:56:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:35,976 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-15 23:56:35,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:56:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-12-15 23:56:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 23:56:35,978 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:35,978 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:35,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-15 23:56:36,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 23:56:36,187 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:36,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:36,188 INFO L85 PathProgramCache]: Analyzing trace with hash 915772386, now seen corresponding path program 1 times [2021-12-15 23:56:36,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:56:36,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798999458] [2021-12-15 23:56:36,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:36,189 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:56:36,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:56:36,190 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 23:56:36,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-15 23:56:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:36,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-15 23:56:36,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:36,630 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 23:56:36,631 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-15 23:56:36,703 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 8 treesize of output 4 [2021-12-15 23:56:36,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:36,892 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 15 treesize of output 17 [2021-12-15 23:56:36,957 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 16 treesize of output 8 [2021-12-15 23:56:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 23:56:36,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:56:37,186 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:56:37,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798999458] [2021-12-15 23:56:37,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798999458] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:37,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [380938780] [2021-12-15 23:56:37,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:37,187 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-15 23:56:37,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-15 23:56:37,197 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-15 23:56:37,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2021-12-15 23:56:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:37,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-15 23:56:37,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:37,941 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 8 treesize of output 4 [2021-12-15 23:56:38,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:38,041 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 15 treesize of output 17 [2021-12-15 23:56:38,099 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 16 treesize of output 8 [2021-12-15 23:56:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 23:56:38,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:56:38,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [380938780] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:38,191 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:56:38,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2021-12-15 23:56:38,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670396361] [2021-12-15 23:56:38,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:56:38,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-15 23:56:38,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:56:38,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-15 23:56:38,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=503, Unknown=7, NotChecked=0, Total=600 [2021-12-15 23:56:38,193 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 23 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 18 states have internal predecessors, (38), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-15 23:56:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:41,450 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2021-12-15 23:56:41,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 23:56:41,451 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 18 states have internal predecessors, (38), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2021-12-15 23:56:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:41,453 INFO L225 Difference]: With dead ends: 37 [2021-12-15 23:56:41,453 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 23:56:41,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=140, Invalid=721, Unknown=9, NotChecked=0, Total=870 [2021-12-15 23:56:41,454 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:41,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 148 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 43 Unchecked, 3.1s Time] [2021-12-15 23:56:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 23:56:41,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-12-15 23:56:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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-15 23:56:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-12-15 23:56:41,457 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 34 [2021-12-15 23:56:41,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:41,457 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-15 23:56:41,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 18 states have internal predecessors, (38), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-15 23:56:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2021-12-15 23:56:41,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 23:56:41,458 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:41,458 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:41,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2021-12-15 23:56:41,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-15 23:56:41,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 23:56:41,859 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:41,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:41,859 INFO L85 PathProgramCache]: Analyzing trace with hash 917619428, now seen corresponding path program 1 times [2021-12-15 23:56:41,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:56:41,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788940950] [2021-12-15 23:56:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:41,860 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:56:41,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:56:41,861 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 23:56:41,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-15 23:56:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:42,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 178 conjunts are in the unsatisfiable core [2021-12-15 23:56:42,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:42,382 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-15 23:56:42,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-15 23:56:42,537 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-15 23:56:42,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-15 23:56:42,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-15 23:56:42,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:42,851 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-15 23:56:42,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 39 [2021-12-15 23:56:43,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:43,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-15 23:56:43,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-15 23:56:43,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-15 23:56:43,532 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-15 23:56:43,532 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 65 treesize of output 32 [2021-12-15 23:56:43,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-15 23:56:43,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:43,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-12-15 23:56:43,761 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 23:56:43,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:43,935 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 23:56:43,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 61 [2021-12-15 23:56:43,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:43,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:43,993 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-15 23:56:43,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 44 [2021-12-15 23:56:44,089 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 23:56:44,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-15 23:56:44,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 23:56:44,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:44,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:44,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:44,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:44,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:44,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,043 INFO L244 Elim1Store]: Index analysis took 248 ms [2021-12-15 23:56:45,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2021-12-15 23:56:45,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,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, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 235 [2021-12-15 23:56:45,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,220 INFO L354 Elim1Store]: treesize reduction 114, result has 16.2 percent of original size [2021-12-15 23:56:45,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 76 [2021-12-15 23:56:45,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2021-12-15 23:56:45,325 INFO L354 Elim1Store]: treesize reduction 82, result has 16.3 percent of original size [2021-12-15 23:56:45,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 125 treesize of output 97 [2021-12-15 23:56:45,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 37 [2021-12-15 23:56:45,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2021-12-15 23:56:45,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 28 [2021-12-15 23:56:45,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-15 23:56:45,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 23:56:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 23:56:45,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:56:48,466 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_597 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_653 (_ BitVec 32)) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_591 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_650 (_ BitVec 32)) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset_3| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse6 (bvadd .cse11 (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse6))) (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_609))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_650))) .cse2 v_ArrVal_597) .cse3 v_ArrVal_613))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (bvadd |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| (_ bv4 32)) v_ArrVal_653))) (select (select (store (let ((.cse4 (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)))) (store .cse7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse2))))) (store .cse5 .cse2 (store (select .cse5 .cse2) .cse6 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset_3| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_617) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (store .cse10 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse11))))) (store .cse9 .cse2 (store (select .cse9 .cse2) .cse6 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))) .cse3 v_ArrVal_632) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_591) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv8 32))))))))) is different from false [2021-12-15 23:56:49,316 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_597 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_653 (_ BitVec 32)) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_591 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_650 (_ BitVec 32)) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset_3| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse6 (bvadd .cse11 (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse6))) (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_609))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| v_ArrVal_650))) .cse2 v_ArrVal_597) .cse3 v_ArrVal_613))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (bvadd |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| (_ bv4 32)) v_ArrVal_653))) (select (select (store (let ((.cse4 (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)))) (store .cse7 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| .cse2))))) (store .cse5 .cse2 (store (select .cse5 .cse2) .cse6 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|))))) (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_dll_circular_prepend_~last~1#1.offset_3| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|))) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_617) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)))) (store .cse10 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| .cse11))))) (store .cse9 .cse2 (store (select .cse9 .cse2) .cse6 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|))) .cse3 v_ArrVal_632) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_591) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv8 32))))))))) is different from false [2021-12-15 23:56:50,190 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:50,190 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 594 treesize of output 571 [2021-12-15 23:56:51,027 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:51,030 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 334324942 treesize of output 330013419