./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_unequal.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/sll2n_insert_unequal.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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-15 23:58:08,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 23:58:08,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 23:58:08,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 23:58:08,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 23:58:08,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 23:58:08,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 23:58:08,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 23:58:08,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 23:58:08,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 23:58:08,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 23:58:08,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 23:58:08,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 23:58:08,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 23:58:08,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 23:58:08,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 23:58:08,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 23:58:08,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 23:58:08,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 23:58:08,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 23:58:08,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 23:58:08,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 23:58:08,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 23:58:08,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 23:58:08,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 23:58:08,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 23:58:08,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 23:58:08,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 23:58:08,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 23:58:08,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 23:58:08,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 23:58:08,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 23:58:08,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 23:58:08,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 23:58:08,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 23:58:08,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 23:58:08,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 23:58:08,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 23:58:08,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 23:58:08,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 23:58:08,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 23:58:08,490 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:58:08,520 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 23:58:08,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 23:58:08,521 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 23:58:08,521 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 23:58:08,522 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 23:58:08,522 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 23:58:08,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 23:58:08,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 23:58:08,522 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 23:58:08,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 23:58:08,523 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 23:58:08,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 23:58:08,524 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 23:58:08,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 23:58:08,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 23:58:08,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 23:58:08,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 23:58:08,524 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 23:58:08,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 23:58:08,524 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 23:58:08,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 23:58:08,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 23:58:08,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 23:58:08,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 23:58:08,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:58:08,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 23:58:08,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 23:58:08,526 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 23:58:08,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 23:58:08,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 23:58:08,526 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 23:58:08,526 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 23:58:08,526 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 23:58:08,526 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 23:58:08,527 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2021-12-15 23:58:08,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 23:58:08,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 23:58:08,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 23:58:08,739 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 23:58:08,739 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 23:58:08,740 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2021-12-15 23:58:08,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab00a564/493e172219c74d9ebc1fc6ab69eeb63b/FLAG953f6e580 [2021-12-15 23:58:09,209 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 23:58:09,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2021-12-15 23:58:09,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab00a564/493e172219c74d9ebc1fc6ab69eeb63b/FLAG953f6e580 [2021-12-15 23:58:09,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab00a564/493e172219c74d9ebc1fc6ab69eeb63b [2021-12-15 23:58:09,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 23:58:09,231 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 23:58:09,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 23:58:09,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 23:58:09,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 23:58:09,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:58:09" (1/1) ... [2021-12-15 23:58:09,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7127d2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:09, skipping insertion in model container [2021-12-15 23:58:09,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:58:09" (1/1) ... [2021-12-15 23:58:09,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 23:58:09,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 23:58:09,490 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/sll2n_insert_unequal.i[24620,24633] [2021-12-15 23:58:09,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:58:09,502 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 23:58:09,542 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/sll2n_insert_unequal.i[24620,24633] [2021-12-15 23:58:09,544 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:58:09,564 INFO L208 MainTranslator]: Completed translation [2021-12-15 23:58:09,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:09 WrapperNode [2021-12-15 23:58:09,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 23:58:09,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 23:58:09,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 23:58:09,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 23:58:09,571 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:58:09" (1/1) ... [2021-12-15 23:58:09,592 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:58:09" (1/1) ... [2021-12-15 23:58:09,615 INFO L137 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 148 [2021-12-15 23:58:09,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 23:58:09,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 23:58:09,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 23:58:09,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 23:58:09,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:09" (1/1) ... [2021-12-15 23:58:09,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:09" (1/1) ... [2021-12-15 23:58:09,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:09" (1/1) ... [2021-12-15 23:58:09,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:09" (1/1) ... [2021-12-15 23:58:09,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:09" (1/1) ... [2021-12-15 23:58:09,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:09" (1/1) ... [2021-12-15 23:58:09,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:09" (1/1) ... [2021-12-15 23:58:09,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 23:58:09,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 23:58:09,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 23:58:09,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 23:58:09,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:09" (1/1) ... [2021-12-15 23:58:09,660 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:58:09,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:58:09,688 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:58:09,703 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:58:09,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 23:58:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 23:58:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-15 23:58:09,726 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-15 23:58:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 23:58:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 23:58:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 23:58:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 23:58:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 23:58:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 23:58:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-15 23:58:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 23:58:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 23:58:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 23:58:09,840 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 23:58:09,841 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 23:58:10,028 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 23:58:10,032 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 23:58:10,033 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-15 23:58:10,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:58:10 BoogieIcfgContainer [2021-12-15 23:58:10,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 23:58:10,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 23:58:10,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 23:58:10,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 23:58:10,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:58:09" (1/3) ... [2021-12-15 23:58:10,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfaf3fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:58:10, skipping insertion in model container [2021-12-15 23:58:10,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:09" (2/3) ... [2021-12-15 23:58:10,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfaf3fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:58:10, skipping insertion in model container [2021-12-15 23:58:10,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:58:10" (3/3) ... [2021-12-15 23:58:10,041 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2021-12-15 23:58:10,046 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 23:58:10,047 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 23:58:10,087 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 23:58:10,094 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:58:10,094 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 23:58:10,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 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:58:10,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 23:58:10,121 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:10,121 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:58:10,122 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:10,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:10,126 INFO L85 PathProgramCache]: Analyzing trace with hash -246443823, now seen corresponding path program 1 times [2021-12-15 23:58:10,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:10,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653196654] [2021-12-15 23:58:10,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:10,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:10,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-15 23:58:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:10,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:58:10,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:10,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653196654] [2021-12-15 23:58:10,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653196654] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:58:10,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:58:10,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 23:58:10,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464836552] [2021-12-15 23:58:10,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:58:10,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 23:58:10,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:10,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 23:58:10,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:58:10,345 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-15 23:58:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:10,422 INFO L93 Difference]: Finished difference Result 62 states and 91 transitions. [2021-12-15 23:58:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 23:58:10,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-12-15 23:58:10,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:10,428 INFO L225 Difference]: With dead ends: 62 [2021-12-15 23:58:10,428 INFO L226 Difference]: Without dead ends: 28 [2021-12-15 23:58:10,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:58:10,432 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:10,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 23:58:10,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-15 23:58:10,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-15 23:58:10,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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:58:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2021-12-15 23:58:10,464 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 19 [2021-12-15 23:58:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:10,465 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-12-15 23:58:10,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-15 23:58:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2021-12-15 23:58:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 23:58:10,467 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:10,467 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:58:10,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 23:58:10,468 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:10,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:10,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1738034235, now seen corresponding path program 1 times [2021-12-15 23:58:10,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:10,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643467513] [2021-12-15 23:58:10,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:10,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:10,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-15 23:58:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:58:10,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:10,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643467513] [2021-12-15 23:58:10,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643467513] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:58:10,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:58:10,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 23:58:10,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823167613] [2021-12-15 23:58:10,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:58:10,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:58:10,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:10,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:58:10,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:58:10,587 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-15 23:58:10,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:10,634 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2021-12-15 23:58:10,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:58:10,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-12-15 23:58:10,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:10,635 INFO L225 Difference]: With dead ends: 54 [2021-12-15 23:58:10,635 INFO L226 Difference]: Without dead ends: 32 [2021-12-15 23:58:10,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:58:10,641 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:10,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:58:10,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-15 23:58:10,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2021-12-15 23:58:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:58:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2021-12-15 23:58:10,652 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 19 [2021-12-15 23:58:10,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:10,653 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-15 23:58:10,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-15 23:58:10,655 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2021-12-15 23:58:10,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 23:58:10,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:10,656 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:58:10,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 23:58:10,656 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:10,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:10,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1368908325, now seen corresponding path program 1 times [2021-12-15 23:58:10,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:10,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87718046] [2021-12-15 23:58:10,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:10,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:10,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:58:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:10,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-15 23:58:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:58:10,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:10,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87718046] [2021-12-15 23:58:10,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87718046] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:10,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970786172] [2021-12-15 23:58:10,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:10,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:10,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:58:10,766 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:58:10,766 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:58:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:10,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 23:58:10,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:58:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:58:10,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:58:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:58:11,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970786172] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:58:11,060 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:58:11,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2021-12-15 23:58:11,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621761378] [2021-12-15 23:58:11,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:58:11,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 23:58:11,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:11,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 23:58:11,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:58:11,062 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-15 23:58:11,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:11,098 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2021-12-15 23:58:11,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 23:58:11,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2021-12-15 23:58:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:11,099 INFO L225 Difference]: With dead ends: 55 [2021-12-15 23:58:11,099 INFO L226 Difference]: Without dead ends: 33 [2021-12-15 23:58:11,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:58:11,100 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:11,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 111 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:58:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-15 23:58:11,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-12-15 23:58:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:58:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2021-12-15 23:58:11,104 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 28 [2021-12-15 23:58:11,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:11,105 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2021-12-15 23:58:11,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-15 23:58:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2021-12-15 23:58:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-15 23:58:11,106 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:11,106 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:58:11,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 23:58:11,325 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:58:11,326 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:11,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:11,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1136271419, now seen corresponding path program 2 times [2021-12-15 23:58:11,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:11,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536830870] [2021-12-15 23:58:11,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:11,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:11,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:58:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:11,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-15 23:58:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:11,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-15 23:58:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-15 23:58:11,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:11,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536830870] [2021-12-15 23:58:11,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536830870] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:58:11,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:58:11,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 23:58:11,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385046696] [2021-12-15 23:58:11,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:58:11,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:58:11,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:11,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:58:11,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:58:11,410 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-15 23:58:11,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:11,433 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2021-12-15 23:58:11,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:58:11,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2021-12-15 23:58:11,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:11,434 INFO L225 Difference]: With dead ends: 57 [2021-12-15 23:58:11,434 INFO L226 Difference]: Without dead ends: 46 [2021-12-15 23:58:11,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:58:11,435 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:11,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 82 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:58:11,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-15 23:58:11,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2021-12-15 23:58:11,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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:58:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2021-12-15 23:58:11,439 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 37 [2021-12-15 23:58:11,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:11,440 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2021-12-15 23:58:11,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-15 23:58:11,440 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2021-12-15 23:58:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-15 23:58:11,441 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:11,441 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:58:11,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 23:58:11,441 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:11,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:11,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1079013117, now seen corresponding path program 1 times [2021-12-15 23:58:11,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:11,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726671867] [2021-12-15 23:58:11,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:11,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:11,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:58:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:11,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-15 23:58:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:11,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-15 23:58:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-15 23:58:11,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:11,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726671867] [2021-12-15 23:58:11,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726671867] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:58:11,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:58:11,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 23:58:11,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305711955] [2021-12-15 23:58:11,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:58:11,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 23:58:11,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:11,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 23:58:11,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 23:58:11,520 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:58:11,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:11,548 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2021-12-15 23:58:11,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 23:58:11,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2021-12-15 23:58:11,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:11,550 INFO L225 Difference]: With dead ends: 46 [2021-12-15 23:58:11,550 INFO L226 Difference]: Without dead ends: 34 [2021-12-15 23:58:11,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:58:11,551 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:11,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 84 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:58:11,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-15 23:58:11,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-12-15 23:58:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 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:58:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2021-12-15 23:58:11,555 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 37 [2021-12-15 23:58:11,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:11,555 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-12-15 23:58:11,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:58:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2021-12-15 23:58:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 23:58:11,556 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:11,556 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:58:11,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 23:58:11,557 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:11,557 INFO L85 PathProgramCache]: Analyzing trace with hash -300753136, now seen corresponding path program 1 times [2021-12-15 23:58:11,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:11,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813573283] [2021-12-15 23:58:11,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:11,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:11,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:58:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:11,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-15 23:58:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:12,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-15 23:58:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:58:12,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:12,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813573283] [2021-12-15 23:58:12,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813573283] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:12,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784241443] [2021-12-15 23:58:12,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:12,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:12,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:58:12,241 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:58:12,243 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:58:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:12,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 111 conjunts are in the unsatisfiable core [2021-12-15 23:58:12,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:58:12,528 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:58:12,581 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:58:12,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:12,672 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 21 treesize of output 20 [2021-12-15 23:58:12,879 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:58:12,884 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 11 treesize of output 3 [2021-12-15 23:58:12,888 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:58:12,892 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:58:13,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:13,094 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 40 treesize of output 38 [2021-12-15 23:58:13,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:13,101 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 22 treesize of output 24 [2021-12-15 23:58:13,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:13,107 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 36 treesize of output 34 [2021-12-15 23:58:13,122 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-15 23:58:13,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-15 23:58:13,386 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 23:58:13,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 84 [2021-12-15 23:58:13,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:13,394 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 41 treesize of output 36 [2021-12-15 23:58:13,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:13,399 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2021-12-15 23:58:13,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:13,489 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 56 treesize of output 52 [2021-12-15 23:58:13,496 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 22 treesize of output 24 [2021-12-15 23:58:13,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:13,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:13,504 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2021-12-15 23:58:13,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 49 treesize of output 33 [2021-12-15 23:58:13,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:13,571 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 0 case distinctions, treesize of input 46 treesize of output 25 [2021-12-15 23:58:13,612 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:58:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:58:13,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:58:13,680 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_561) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-15 23:58:13,689 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int)) (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 v_ArrVal_558)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_561) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-15 23:58:13,702 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int)) (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 v_ArrVal_558)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_561) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-15 23:58:13,712 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int)) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_558)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_561) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_556) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-15 23:58:13,807 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_561 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_13| Int) (v_ArrVal_558 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_13|))) (= (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_13| v_ArrVal_570)) (.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_13| v_ArrVal_571))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2 (+ (select (select .cse4 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_13| v_ArrVal_569))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_558))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_13| v_ArrVal_561) (select (select (store (store .cse3 .cse1 v_ArrVal_556) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_13| v_ArrVal_559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_13| v_ArrVal_560) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_13|))) is different from false [2021-12-15 23:58:13,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784241443] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:13,809 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:58:13,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2021-12-15 23:58:13,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117093525] [2021-12-15 23:58:13,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:58:13,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-15 23:58:13,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:13,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-15 23:58:13,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1032, Unknown=5, NotChecked=340, Total=1482 [2021-12-15 23:58:13,811 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 34 states, 32 states have (on average 1.6875) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-15 23:58:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:14,512 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2021-12-15 23:58:14,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 23:58:14,515 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.6875) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2021-12-15 23:58:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:14,516 INFO L225 Difference]: With dead ends: 55 [2021-12-15 23:58:14,516 INFO L226 Difference]: Without dead ends: 53 [2021-12-15 23:58:14,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=183, Invalid=1638, Unknown=5, NotChecked=430, Total=2256 [2021-12-15 23:58:14,517 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 96 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:14,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 281 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 606 Invalid, 0 Unknown, 29 Unchecked, 0.3s Time] [2021-12-15 23:58:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-15 23:58:14,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2021-12-15 23:58:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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:58:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2021-12-15 23:58:14,522 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 38 [2021-12-15 23:58:14,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:14,522 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2021-12-15 23:58:14,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.6875) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-15 23:58:14,523 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2021-12-15 23:58:14,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 23:58:14,523 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:14,524 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:58:14,541 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:58:14,741 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,SelfDestructingSolverStorable5 [2021-12-15 23:58:14,741 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:14,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:14,742 INFO L85 PathProgramCache]: Analyzing trace with hash -243494834, now seen corresponding path program 1 times [2021-12-15 23:58:14,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:14,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598737777] [2021-12-15 23:58:14,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:14,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:14,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:58:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:14,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-15 23:58:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:14,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-15 23:58:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:14,917 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:58:14,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:14,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598737777] [2021-12-15 23:58:14,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598737777] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:14,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485643080] [2021-12-15 23:58:14,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:14,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:14,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:58:14,919 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:58:14,920 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:58:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:15,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-15 23:58:15,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:58:15,227 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:58:15,268 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_732 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_732))) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2021-12-15 23:58:15,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:15,292 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:58:15,317 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:58:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-12-15 23:58:15,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:58:15,437 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_735 (Array Int Int)) (|v_node_create_~temp~0#1.base_16| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_16| v_ArrVal_735) |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (<= |c_#StackHeapBarrier| |v_node_create_~temp~0#1.base_16|) (<= (+ .cse0 1) 0) (<= 1 .cse0)))) is different from false [2021-12-15 23:58:15,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485643080] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:15,438 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:58:15,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2021-12-15 23:58:15,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954173232] [2021-12-15 23:58:15,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:58:15,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-15 23:58:15,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:15,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-15 23:58:15,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=528, Unknown=2, NotChecked=94, Total=702 [2021-12-15 23:58:15,440 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 25 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-15 23:58:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:15,673 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2021-12-15 23:58:15,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 23:58:15,673 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2021-12-15 23:58:15,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:15,674 INFO L225 Difference]: With dead ends: 60 [2021-12-15 23:58:15,674 INFO L226 Difference]: Without dead ends: 49 [2021-12-15 23:58:15,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=865, Unknown=2, NotChecked=122, Total=1122 [2021-12-15 23:58:15,675 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 48 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:15,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 277 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 175 Invalid, 0 Unknown, 54 Unchecked, 0.1s Time] [2021-12-15 23:58:15,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-15 23:58:15,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2021-12-15 23:58:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:58:15,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2021-12-15 23:58:15,679 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 38 [2021-12-15 23:58:15,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:15,680 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2021-12-15 23:58:15,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-15 23:58:15,680 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2021-12-15 23:58:15,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 23:58:15,680 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:15,681 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:58:15,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-15 23:58:15,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:15,897 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:15,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:15,898 INFO L85 PathProgramCache]: Analyzing trace with hash -733467546, now seen corresponding path program 1 times [2021-12-15 23:58:15,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:15,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526476091] [2021-12-15 23:58:15,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:15,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:16,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:58:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:16,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-15 23:58:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:16,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-15 23:58:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:58:16,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:16,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526476091] [2021-12-15 23:58:16,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526476091] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:16,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304885658] [2021-12-15 23:58:16,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:16,368 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:16,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:58:16,369 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:58:16,370 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:58:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:16,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-15 23:58:16,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:58:16,678 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:58:16,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:16,777 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 15 treesize of output 17 [2021-12-15 23:58:16,896 INFO L354 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-15 23:58:16,896 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 1 case distinctions, treesize of input 22 treesize of output 31 [2021-12-15 23:58:16,972 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-15 23:58:16,973 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 50 [2021-12-15 23:58:16,979 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 10 [2021-12-15 23:58:17,007 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:58:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:58:17,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:58:17,090 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_899 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_899) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (< 0 |c_ULTIMATE.start_main_~mid_index~0#1|)) is different from false [2021-12-15 23:58:17,096 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| Int) (v_ArrVal_899 (Array Int Int)) (|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (not (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_899) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (< 0 |c_ULTIMATE.start_main_~mid_index~0#1|)) is different from false [2021-12-15 23:58:17,109 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((|ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| Int) (v_ArrVal_899 (Array Int Int)) (|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (not (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_899) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (< 0 |c_ULTIMATE.start_main_~mid_index~0#1|)) (<= |c_ULTIMATE.start_sll_insert_~index#1| 0)) is different from false [2021-12-15 23:58:17,118 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((|ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| Int) (v_ArrVal_899 (Array Int Int)) (|ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| Int)) (not (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_899) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (< 0 |c_ULTIMATE.start_main_~mid_index~0#1|)) (<= |c_ULTIMATE.start_sll_insert_~index#1| 0)) is different from false [2021-12-15 23:58:17,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304885658] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:17,208 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:58:17,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2021-12-15 23:58:17,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866222906] [2021-12-15 23:58:17,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:58:17,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-15 23:58:17,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:17,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-15 23:58:17,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1069, Unknown=19, NotChecked=276, Total=1482 [2021-12-15 23:58:17,210 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 34 states, 32 states have (on average 1.78125) internal successors, (57), 28 states have internal predecessors, (57), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-15 23:58:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:17,703 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2021-12-15 23:58:17,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-15 23:58:17,704 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.78125) internal successors, (57), 28 states have internal predecessors, (57), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2021-12-15 23:58:17,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:17,704 INFO L225 Difference]: With dead ends: 66 [2021-12-15 23:58:17,704 INFO L226 Difference]: Without dead ends: 59 [2021-12-15 23:58:17,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=206, Invalid=1861, Unknown=19, NotChecked=364, Total=2450 [2021-12-15 23:58:17,705 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 76 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:17,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 303 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 412 Invalid, 0 Unknown, 10 Unchecked, 0.2s Time] [2021-12-15 23:58:17,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-15 23:58:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2021-12-15 23:58:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:58:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2021-12-15 23:58:17,710 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 39 [2021-12-15 23:58:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:17,710 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2021-12-15 23:58:17,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.78125) internal successors, (57), 28 states have internal predecessors, (57), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-15 23:58:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2021-12-15 23:58:17,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 23:58:17,711 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:17,711 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:58:17,745 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:58:17,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:17,921 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:17,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:17,921 INFO L85 PathProgramCache]: Analyzing trace with hash -169490139, now seen corresponding path program 2 times [2021-12-15 23:58:17,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:17,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045232972] [2021-12-15 23:58:17,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:17,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:17,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:58:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:17,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-15 23:58:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:17,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-15 23:58:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-15 23:58:17,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:17,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045232972] [2021-12-15 23:58:17,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045232972] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:58:17,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:58:17,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 23:58:17,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151165773] [2021-12-15 23:58:17,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:58:17,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 23:58:17,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:17,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 23:58:17,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:58:17,977 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:58:18,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:18,003 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2021-12-15 23:58:18,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 23:58:18,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2021-12-15 23:58:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:18,004 INFO L225 Difference]: With dead ends: 50 [2021-12-15 23:58:18,004 INFO L226 Difference]: Without dead ends: 36 [2021-12-15 23:58:18,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-15 23:58:18,005 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 36 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:18,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 79 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:58:18,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-12-15 23:58:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-12-15 23:58:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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:58:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2021-12-15 23:58:18,009 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 39 [2021-12-15 23:58:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:18,009 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2021-12-15 23:58:18,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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:58:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2021-12-15 23:58:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 23:58:18,010 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:18,010 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:58:18,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 23:58:18,010 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:18,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:18,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1260942485, now seen corresponding path program 1 times [2021-12-15 23:58:18,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:18,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781853859] [2021-12-15 23:58:18,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:18,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:18,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:58:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:18,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-15 23:58:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:18,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-15 23:58:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-15 23:58:18,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:18,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781853859] [2021-12-15 23:58:18,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781853859] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:18,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107682059] [2021-12-15 23:58:18,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:18,138 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:18,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:58:18,139 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:58:18,141 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:58:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:18,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 23:58:18,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:58:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-15 23:58:18,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:58:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-15 23:58:18,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107682059] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:58:18,445 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:58:18,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-15 23:58:18,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344355426] [2021-12-15 23:58:18,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:58:18,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-15 23:58:18,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:18,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-15 23:58:18,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-12-15 23:58:18,447 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 5 states have call successors, (5), 2 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:58:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:18,548 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2021-12-15 23:58:18,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 23:58:18,548 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 40 [2021-12-15 23:58:18,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:18,548 INFO L225 Difference]: With dead ends: 46 [2021-12-15 23:58:18,549 INFO L226 Difference]: Without dead ends: 37 [2021-12-15 23:58:18,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2021-12-15 23:58:18,549 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 56 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:18,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 139 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:58:18,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-15 23:58:18,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2021-12-15 23:58:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:58:18,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2021-12-15 23:58:18,553 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 40 [2021-12-15 23:58:18,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:18,554 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2021-12-15 23:58:18,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 5 states have call successors, (5), 2 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:58:18,554 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2021-12-15 23:58:18,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-15 23:58:18,554 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:18,555 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:58:18,573 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:58:18,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-15 23:58:18,772 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:18,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:18,773 INFO L85 PathProgramCache]: Analyzing trace with hash -434566293, now seen corresponding path program 1 times [2021-12-15 23:58:18,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:18,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742350524] [2021-12-15 23:58:18,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:18,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:19,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:58:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:19,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-15 23:58:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:19,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-15 23:58:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:19,446 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:58:19,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:19,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742350524] [2021-12-15 23:58:19,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742350524] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:19,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694863239] [2021-12-15 23:58:19,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:19,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:19,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:58:19,456 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:58:19,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 23:58:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:19,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 116 conjunts are in the unsatisfiable core [2021-12-15 23:58:19,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:58:19,821 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:58:20,090 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 11 [2021-12-15 23:58:20,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 15 treesize of output 7 [2021-12-15 23:58:20,103 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:58:20,189 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:58:20,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:20,272 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 21 treesize of output 21 [2021-12-15 23:58:20,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:20,280 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 25 treesize of output 25 [2021-12-15 23:58:20,288 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-15 23:58:20,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-15 23:58:20,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:20,555 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 56 [2021-12-15 23:58:20,559 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 18 treesize of output 20 [2021-12-15 23:58:20,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:20,563 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2021-12-15 23:58:20,656 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-15 23:58:20,656 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 3 case distinctions, treesize of input 168 treesize of output 137 [2021-12-15 23:58:20,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:20,673 INFO L354 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2021-12-15 23:58:20,673 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 153 treesize of output 145 [2021-12-15 23:58:20,678 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 61 treesize of output 46 [2021-12-15 23:58:20,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:20,808 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:58:20,808 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 123 treesize of output 54 [2021-12-15 23:58:20,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:20,813 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 18 [2021-12-15 23:58:20,881 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:58:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:58:20,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:58:20,968 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1333 Int)) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1332)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1334))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_1333)) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2021-12-15 23:58:20,980 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1333 Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1332)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1334))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1328))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_1333))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2021-12-15 23:58:21,012 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1333 Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1332)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1334))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1328))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_1333))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2021-12-15 23:58:21,023 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1333 Int)) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1332)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1334))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_1328))) (store .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) (+ |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| 4) v_ArrVal_1333))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2021-12-15 23:58:21,126 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:58:21,127 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 319 treesize of output 312 [2021-12-15 23:58:21,138 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:58:21,139 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 3128 treesize of output 2992 [2021-12-15 23:58:21,150 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 3400 treesize of output 2856 [2021-12-15 23:58:21,597 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 705 treesize of output 569 [2021-12-15 23:58:21,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 139 treesize of output 3 [2021-12-15 23:58:22,431 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:58:22,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1561 treesize of output 1711 [2021-12-15 23:59:04,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694863239] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:59:04,124 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:59:04,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 37 [2021-12-15 23:59:04,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403463320] [2021-12-15 23:59:04,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:59:04,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-15 23:59:04,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:04,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-15 23:59:04,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1450, Unknown=6, NotChecked=316, Total=1892 [2021-12-15 23:59:04,129 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 31 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-15 23:59:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:11,530 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2021-12-15 23:59:11,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 23:59:11,530 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 31 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2021-12-15 23:59:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:11,531 INFO L225 Difference]: With dead ends: 37 [2021-12-15 23:59:11,531 INFO L226 Difference]: Without dead ends: 35 [2021-12-15 23:59:11,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 42.7s TimeCoverageRelationStatistics Valid=188, Invalid=2077, Unknown=7, NotChecked=380, Total=2652 [2021-12-15 23:59:11,532 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:11,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 238 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 331 Invalid, 0 Unknown, 24 Unchecked, 0.2s Time] [2021-12-15 23:59:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-15 23:59:11,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-12-15 23:59:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:59:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2021-12-15 23:59:11,536 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 41 [2021-12-15 23:59:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:11,536 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-12-15 23:59:11,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 31 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-15 23:59:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2021-12-15 23:59:11,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-15 23:59:11,537 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:11,537 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:11,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-15 23:59:11,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:11,738 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:11,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:11,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1006346340, now seen corresponding path program 1 times [2021-12-15 23:59:11,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:11,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840715361] [2021-12-15 23:59:11,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:11,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:12,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:59:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:12,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-15 23:59:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:12,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-15 23:59:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:59:12,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:12,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840715361] [2021-12-15 23:59:12,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840715361] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:59:12,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134605304] [2021-12-15 23:59:12,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:12,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:12,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:59:12,632 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:59:12,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-15 23:59:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:12,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 165 conjunts are in the unsatisfiable core [2021-12-15 23:59:12,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:59:12,994 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:59:13,050 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:59:13,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 23:59:13,213 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 23:59:13,214 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 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-15 23:59:13,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:59:13,284 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 21 treesize of output 20 [2021-12-15 23:59:13,394 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 23:59:13,394 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 1 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 23:59:13,583 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 23:59:13,583 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 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-15 23:59:13,624 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-12-15 23:59:13,624 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 5 case distinctions, treesize of input 22 treesize of output 33 [2021-12-15 23:59:13,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, 1 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:59:13,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 23:59:13,777 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 20 treesize of output 22 [2021-12-15 23:59:14,158 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:59:14,158 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 85 treesize of output 40 [2021-12-15 23:59:14,164 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:59:14,169 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 15 treesize of output 7 [2021-12-15 23:59:14,178 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 23:59:14,178 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 1 case distinctions, treesize of input 16 treesize of output 10 [2021-12-15 23:59:14,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:59:14,438 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 23:59:14,440 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 91 treesize of output 73 [2021-12-15 23:59:14,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:59:14,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:59:14,448 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-15 23:59:14,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:59:14,468 INFO L354 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2021-12-15 23:59:14,469 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 3 case distinctions, treesize of input 33 treesize of output 33 [2021-12-15 23:59:14,474 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-15 23:59:14,878 INFO L354 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2021-12-15 23:59:14,879 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 148 treesize of output 95 [2021-12-15 23:59:14,895 INFO L354 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2021-12-15 23:59:14,895 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 38 [2021-12-15 23:59:14,902 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 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 23:59:15,255 INFO L354 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2021-12-15 23:59:15,255 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 5 case distinctions, treesize of input 233 treesize of output 122 [2021-12-15 23:59:15,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:59:15,262 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2021-12-15 23:59:15,289 INFO L354 Elim1Store]: treesize reduction 114, result has 42.1 percent of original size [2021-12-15 23:59:15,289 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 232 [2021-12-15 23:59:15,930 INFO L354 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2021-12-15 23:59:15,930 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 3 case distinctions, treesize of input 66 treesize of output 34 [2021-12-15 23:59:16,578 INFO L354 Elim1Store]: treesize reduction 31, result has 49.2 percent of original size [2021-12-15 23:59:16,578 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 168 treesize of output 164 [2021-12-15 23:59:16,968 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 23:59:16,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 35 [2021-12-15 23:59:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:59:16,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:59:17,401 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1528 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1528)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~last~0#1.base|)))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (select (select .cse3 .cse4) .cse5))) (or (not (= (select (select .cse0 .cse1) (+ .cse2 4)) 0)) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1527) .cse1) .cse2) |c_ULTIMATE.start_main_~uneq~0#1|)))))) is different from false [2021-12-15 23:59:17,628 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1524 (Array Int Int)) (|ULTIMATE.start_sll_insert_~last~0#1.offset| Int) (v_ArrVal_1528 (Array Int Int))) (let ((.cse8 (+ |ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1528)) (.cse2 (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store .cse7 .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)))) (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) (select .cse7 .cse8))))))) (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select .cse2 .cse4) .cse5)) (.cse1 (select (select .cse3 .cse4) .cse5))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1524) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1527) .cse0) .cse1) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (select (select .cse2 .cse0) (+ .cse1 4)) 0)))))))) is different from false [2021-12-15 23:59:17,651 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1524 (Array Int Int)) (|ULTIMATE.start_sll_insert_~last~0#1.offset| Int) (v_ArrVal_1528 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse9 (+ |ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse9 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1528)) (.cse0 (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse3 (store .cse8 .cse9 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)))) (store .cse7 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) (+ |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| 4) (select .cse8 .cse9))))))) (let ((.cse5 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse0 .cse5) .cse6)) (.cse2 (select (select .cse4 .cse5) .cse6))) (or (not (= (select (select .cse0 .cse1) (+ .cse2 4)) 0)) (< (select (select (store (store |c_#memory_int| .cse3 v_ArrVal_1524) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1527) .cse1) .cse2) |c_ULTIMATE.start_main_~uneq~0#1|))))))) is different from false [2021-12-15 23:59:17,797 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_32| Int) (v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1540 (Array Int Int)) (|ULTIMATE.start_sll_insert_~last~0#1.offset| Int) (v_ArrVal_1539 (Array Int Int)) (v_ArrVal_1528 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_32| v_ArrVal_1538))) (let ((.cse3 (select (select .cse10 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse9 (+ |ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (let ((.cse4 (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_32| v_ArrVal_1539))) (store .cse11 .cse3 (store (select .cse11 .cse3) .cse9 0))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_32| v_ArrVal_1528)) (.cse0 (let ((.cse8 (select .cse10 .cse3))) (let ((.cse7 (store .cse10 .cse3 (store .cse8 .cse9 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_32|)))) (store .cse7 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_32| (store (select .cse7 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_32|) 4 (select .cse8 .cse9))))))) (let ((.cse5 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse0 .cse5) .cse6)) (.cse2 (select (select .cse4 .cse5) .cse6))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_32|))) (not (= (select (select .cse0 .cse1) (+ .cse2 4)) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_32|) (< (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_32| v_ArrVal_1540) .cse3 v_ArrVal_1524) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_32| v_ArrVal_1527) .cse1) .cse2) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) is different from false [2021-12-15 23:59:17,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134605304] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:59:17,800 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:59:17,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 51 [2021-12-15 23:59:17,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310323773] [2021-12-15 23:59:17,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 23:59:17,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-15 23:59:17,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:17,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-15 23:59:17,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3036, Unknown=7, NotChecked=452, Total=3660 [2021-12-15 23:59:17,803 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 51 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 41 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 23:59:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:21,079 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2021-12-15 23:59:21,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-15 23:59:21,080 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 41 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 43 [2021-12-15 23:59:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:21,081 INFO L225 Difference]: With dead ends: 61 [2021-12-15 23:59:21,081 INFO L226 Difference]: Without dead ends: 58 [2021-12-15 23:59:21,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=306, Invalid=5403, Unknown=7, NotChecked=604, Total=6320 [2021-12-15 23:59:21,083 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:21,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 556 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 492 Invalid, 0 Unknown, 174 Unchecked, 0.4s Time] [2021-12-15 23:59:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-15 23:59:21,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 36. [2021-12-15 23:59:21,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:59:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2021-12-15 23:59:21,095 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 43 [2021-12-15 23:59:21,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:21,096 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-12-15 23:59:21,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 41 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 23:59:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2021-12-15 23:59:21,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-15 23:59:21,099 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:21,100 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:21,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-15 23:59:21,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:21,319 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:21,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:21,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1006344666, now seen corresponding path program 1 times [2021-12-15 23:59:21,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:21,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812026866] [2021-12-15 23:59:21,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:21,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:22,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-15 23:59:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:22,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-15 23:59:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:22,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-15 23:59:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:59:22,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:22,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812026866] [2021-12-15 23:59:22,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812026866] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:59:22,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347844201] [2021-12-15 23:59:22,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:22,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:22,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:59:22,740 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 23:59:22,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process