./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.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 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:35:06,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:35:06,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:35:06,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:35:06,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:35:06,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:35:06,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:35:06,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:35:06,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:35:06,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:35:06,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:35:06,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:35:06,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:35:06,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:35:06,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:35:06,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:35:06,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:35:06,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:35:06,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:35:06,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:35:06,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:35:06,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:35:06,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:35:06,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:35:06,475 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:35:06,476 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:35:06,476 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:35:06,477 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:35:06,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:35:06,479 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:35:06,479 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:35:06,480 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:35:06,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:35:06,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:35:06,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:35:06,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:35:06,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:35:06,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:35:06,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:35:06,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:35:06,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:35:06,487 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:35:06,511 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:35:06,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:35:06,512 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:35:06,513 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:35:06,513 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:35:06,514 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:35:06,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:35:06,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:35:06,515 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:35:06,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:35:06,516 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:35:06,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:35:06,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:35:06,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:35:06,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:35:06,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:35:06,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:35:06,517 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:35:06,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:35:06,517 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:35:06,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:35:06,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:35:06,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:35:06,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:35:06,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:35:06,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:35:06,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:35:06,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:35:06,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:35:06,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:35:06,520 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:35:06,520 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:35:06,520 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:35:06,520 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:35:06,521 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2021-12-14 13:35:06,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:35:06,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:35:06,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:35:06,732 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:35:06,732 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:35:06,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2021-12-14 13:35:06,801 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8fedb9ac/368896ad292c473d8b21478f80bf467a/FLAG42d6a79e2 [2021-12-14 13:35:07,319 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:35:07,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2021-12-14 13:35:07,345 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8fedb9ac/368896ad292c473d8b21478f80bf467a/FLAG42d6a79e2 [2021-12-14 13:35:07,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8fedb9ac/368896ad292c473d8b21478f80bf467a [2021-12-14 13:35:07,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:35:07,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:35:07,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:35:07,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:35:07,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:35:07,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:35:07" (1/1) ... [2021-12-14 13:35:07,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d07cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:07, skipping insertion in model container [2021-12-14 13:35:07,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:35:07" (1/1) ... [2021-12-14 13:35:07,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:35:07,870 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:35:08,238 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/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2021-12-14 13:35:08,292 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:35:08,305 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:35:08,354 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/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2021-12-14 13:35:08,379 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:35:08,420 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:35:08,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:08 WrapperNode [2021-12-14 13:35:08,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:35:08,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:35:08,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:35:08,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:35:08,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:08" (1/1) ... [2021-12-14 13:35:08,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:08" (1/1) ... [2021-12-14 13:35:08,481 INFO L137 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 116 [2021-12-14 13:35:08,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:35:08,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:35:08,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:35:08,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:35:08,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:08" (1/1) ... [2021-12-14 13:35:08,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:08" (1/1) ... [2021-12-14 13:35:08,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:08" (1/1) ... [2021-12-14 13:35:08,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:08" (1/1) ... [2021-12-14 13:35:08,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:08" (1/1) ... [2021-12-14 13:35:08,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:08" (1/1) ... [2021-12-14 13:35:08,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:08" (1/1) ... [2021-12-14 13:35:08,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:35:08,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:35:08,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:35:08,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:35:08,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:08" (1/1) ... [2021-12-14 13:35:08,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:35:08,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:35:08,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 13:35:08,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 13:35:08,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 13:35:08,602 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2021-12-14 13:35:08,602 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2021-12-14 13:35:08,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 13:35:08,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 13:35:08,602 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2021-12-14 13:35:08,602 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2021-12-14 13:35:08,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 13:35:08,602 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-12-14 13:35:08,602 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-12-14 13:35:08,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 13:35:08,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 13:35:08,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:35:08,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 13:35:08,603 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2021-12-14 13:35:08,603 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2021-12-14 13:35:08,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:35:08,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:35:08,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:35:08,716 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:35:08,717 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:35:09,032 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:35:09,043 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:35:09,043 INFO L301 CfgBuilder]: Removed 41 assume(true) statements. [2021-12-14 13:35:09,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:35:09 BoogieIcfgContainer [2021-12-14 13:35:09,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:35:09,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:35:09,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:35:09,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:35:09,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:35:07" (1/3) ... [2021-12-14 13:35:09,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ffc86b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:35:09, skipping insertion in model container [2021-12-14 13:35:09,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:08" (2/3) ... [2021-12-14 13:35:09,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ffc86b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:35:09, skipping insertion in model container [2021-12-14 13:35:09,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:35:09" (3/3) ... [2021-12-14 13:35:09,057 INFO L111 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2021-12-14 13:35:09,061 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:35:09,061 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 13:35:09,101 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:35:09,111 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 13:35:09,112 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 13:35:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2021-12-14 13:35:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 13:35:09,154 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:09,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:09,155 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:09,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:09,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1761516263, now seen corresponding path program 1 times [2021-12-14 13:35:09,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:09,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131651055] [2021-12-14 13:35:09,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:09,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:09,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:09,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131651055] [2021-12-14 13:35:09,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131651055] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:09,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:09,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 13:35:09,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901071173] [2021-12-14 13:35:09,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:09,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 13:35:09,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:09,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 13:35:09,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:35:09,340 INFO L87 Difference]: Start difference. First operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:09,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:09,386 INFO L93 Difference]: Finished difference Result 230 states and 397 transitions. [2021-12-14 13:35:09,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 13:35:09,389 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-14 13:35:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:09,399 INFO L225 Difference]: With dead ends: 230 [2021-12-14 13:35:09,399 INFO L226 Difference]: Without dead ends: 107 [2021-12-14 13:35:09,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:35:09,411 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:09,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:35:09,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-14 13:35:09,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-12-14 13:35:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 97 states have internal predecessors, (102), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 13:35:09,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2021-12-14 13:35:09,446 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 9 [2021-12-14 13:35:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:09,447 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2021-12-14 13:35:09,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:35:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2021-12-14 13:35:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-14 13:35:09,448 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:09,448 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:09,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 13:35:09,449 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:09,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:09,450 INFO L85 PathProgramCache]: Analyzing trace with hash 849043181, now seen corresponding path program 1 times [2021-12-14 13:35:09,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:09,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898274388] [2021-12-14 13:35:09,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:09,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:09,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-14 13:35:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:09,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:09,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898274388] [2021-12-14 13:35:09,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898274388] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:09,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:09,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:35:09,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864951919] [2021-12-14 13:35:09,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:09,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:35:09,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:09,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:35:09,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:35:09,711 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:35:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:09,995 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2021-12-14 13:35:09,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:35:09,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-12-14 13:35:09,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:09,997 INFO L225 Difference]: With dead ends: 109 [2021-12-14 13:35:09,997 INFO L226 Difference]: Without dead ends: 106 [2021-12-14 13:35:09,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-14 13:35:09,999 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 238 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:09,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 228 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 13:35:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-14 13:35:10,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-14 13:35:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 96 states have internal predecessors, (101), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 13:35:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2021-12-14 13:35:10,015 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 21 [2021-12-14 13:35:10,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:10,017 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2021-12-14 13:35:10,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:35:10,018 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2021-12-14 13:35:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 13:35:10,019 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:10,019 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:10,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 13:35:10,020 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:10,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:10,022 INFO L85 PathProgramCache]: Analyzing trace with hash 502050183, now seen corresponding path program 1 times [2021-12-14 13:35:10,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:10,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336338320] [2021-12-14 13:35:10,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:10,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:10,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-14 13:35:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:10,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:10,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336338320] [2021-12-14 13:35:10,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336338320] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:10,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:10,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 13:35:10,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409657586] [2021-12-14 13:35:10,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:10,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 13:35:10,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:10,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 13:35:10,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:35:10,213 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:35:11,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:11,008 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2021-12-14 13:35:11,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 13:35:11,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-12-14 13:35:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:11,011 INFO L225 Difference]: With dead ends: 198 [2021-12-14 13:35:11,011 INFO L226 Difference]: Without dead ends: 192 [2021-12-14 13:35:11,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2021-12-14 13:35:11,012 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 497 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:11,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 239 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 13:35:11,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-12-14 13:35:11,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 172. [2021-12-14 13:35:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 144 states have (on average 1.2430555555555556) internal successors, (179), 158 states have internal predecessors, (179), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-14 13:35:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2021-12-14 13:35:11,043 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 24 [2021-12-14 13:35:11,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:11,044 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2021-12-14 13:35:11,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:35:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2021-12-14 13:35:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 13:35:11,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:11,045 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:11,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 13:35:11,045 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:11,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1234303898, now seen corresponding path program 1 times [2021-12-14 13:35:11,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:11,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61693274] [2021-12-14 13:35:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:11,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:11,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-14 13:35:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:11,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:11,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61693274] [2021-12-14 13:35:11,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61693274] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:11,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:11,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 13:35:11,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216725517] [2021-12-14 13:35:11,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:11,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 13:35:11,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:11,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 13:35:11,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:35:11,358 INFO L87 Difference]: Start difference. First operand 172 states and 209 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:35:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:12,039 INFO L93 Difference]: Finished difference Result 274 states and 329 transitions. [2021-12-14 13:35:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 13:35:12,040 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-12-14 13:35:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:12,043 INFO L225 Difference]: With dead ends: 274 [2021-12-14 13:35:12,044 INFO L226 Difference]: Without dead ends: 271 [2021-12-14 13:35:12,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2021-12-14 13:35:12,053 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 301 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:12,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 308 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 13:35:12,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-12-14 13:35:12,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 253. [2021-12-14 13:35:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.238532110091743) internal successors, (270), 233 states have internal predecessors, (270), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-14 13:35:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2021-12-14 13:35:12,087 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 27 [2021-12-14 13:35:12,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:12,087 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2021-12-14 13:35:12,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:35:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2021-12-14 13:35:12,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 13:35:12,089 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:12,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:12,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 13:35:12,090 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:12,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:12,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1680148119, now seen corresponding path program 1 times [2021-12-14 13:35:12,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:12,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467027849] [2021-12-14 13:35:12,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:12,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:12,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-14 13:35:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:12,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:12,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467027849] [2021-12-14 13:35:12,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467027849] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:12,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:12,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-14 13:35:12,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632955165] [2021-12-14 13:35:12,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:12,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 13:35:12,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:12,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 13:35:12,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:35:12,451 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:35:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:13,409 INFO L93 Difference]: Finished difference Result 273 states and 327 transitions. [2021-12-14 13:35:13,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 13:35:13,409 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-12-14 13:35:13,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:13,411 INFO L225 Difference]: With dead ends: 273 [2021-12-14 13:35:13,411 INFO L226 Difference]: Without dead ends: 270 [2021-12-14 13:35:13,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2021-12-14 13:35:13,412 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 330 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:13,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 342 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-14 13:35:13,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-12-14 13:35:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 253. [2021-12-14 13:35:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2339449541284404) internal successors, (269), 233 states have internal predecessors, (269), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-14 13:35:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 308 transitions. [2021-12-14 13:35:13,442 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 308 transitions. Word has length 30 [2021-12-14 13:35:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:13,442 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 308 transitions. [2021-12-14 13:35:13,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:35:13,443 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 308 transitions. [2021-12-14 13:35:13,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 13:35:13,443 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:13,444 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:13,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 13:35:13,444 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:13,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:13,445 INFO L85 PathProgramCache]: Analyzing trace with hash -493122043, now seen corresponding path program 1 times [2021-12-14 13:35:13,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:13,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458825119] [2021-12-14 13:35:13,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:13,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:13,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-14 13:35:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:13,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:13,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458825119] [2021-12-14 13:35:13,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458825119] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:13,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:13,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 13:35:13,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607544559] [2021-12-14 13:35:13,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:13,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 13:35:13,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:13,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 13:35:13,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-14 13:35:13,823 INFO L87 Difference]: Start difference. First operand 253 states and 308 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:35:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:14,853 INFO L93 Difference]: Finished difference Result 272 states and 325 transitions. [2021-12-14 13:35:14,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 13:35:14,854 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-12-14 13:35:14,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:14,855 INFO L225 Difference]: With dead ends: 272 [2021-12-14 13:35:14,855 INFO L226 Difference]: Without dead ends: 269 [2021-12-14 13:35:14,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2021-12-14 13:35:14,856 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 320 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:14,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 367 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-14 13:35:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-12-14 13:35:14,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 253. [2021-12-14 13:35:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2293577981651376) internal successors, (268), 233 states have internal predecessors, (268), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-14 13:35:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 307 transitions. [2021-12-14 13:35:14,876 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 307 transitions. Word has length 33 [2021-12-14 13:35:14,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:14,877 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 307 transitions. [2021-12-14 13:35:14,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:35:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 307 transitions. [2021-12-14 13:35:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 13:35:14,883 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:14,883 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:14,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 13:35:14,884 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:14,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:14,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2033122620, now seen corresponding path program 1 times [2021-12-14 13:35:14,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:14,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546125804] [2021-12-14 13:35:14,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:14,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:15,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-14 13:35:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:15,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:15,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546125804] [2021-12-14 13:35:15,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546125804] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:15,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:15,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 13:35:15,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133157807] [2021-12-14 13:35:15,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:15,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 13:35:15,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:15,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 13:35:15,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-14 13:35:15,294 INFO L87 Difference]: Start difference. First operand 253 states and 307 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:35:16,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:16,234 INFO L93 Difference]: Finished difference Result 271 states and 323 transitions. [2021-12-14 13:35:16,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 13:35:16,235 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-12-14 13:35:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:16,236 INFO L225 Difference]: With dead ends: 271 [2021-12-14 13:35:16,236 INFO L226 Difference]: Without dead ends: 268 [2021-12-14 13:35:16,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-12-14 13:35:16,237 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 324 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:16,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 322 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-14 13:35:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-12-14 13:35:16,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 253. [2021-12-14 13:35:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.224770642201835) internal successors, (267), 233 states have internal predecessors, (267), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-14 13:35:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 306 transitions. [2021-12-14 13:35:16,254 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 306 transitions. Word has length 36 [2021-12-14 13:35:16,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:16,254 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 306 transitions. [2021-12-14 13:35:16,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:35:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 306 transitions. [2021-12-14 13:35:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 13:35:16,258 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:16,258 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:16,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 13:35:16,259 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:16,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:16,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1335339115, now seen corresponding path program 1 times [2021-12-14 13:35:16,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:16,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131760493] [2021-12-14 13:35:16,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:16,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:16,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-14 13:35:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:16,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:16,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131760493] [2021-12-14 13:35:16,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131760493] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:16,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:16,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 13:35:16,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150136580] [2021-12-14 13:35:16,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:16,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 13:35:16,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:16,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 13:35:16,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-14 13:35:16,517 INFO L87 Difference]: Start difference. First operand 253 states and 306 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:35:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:17,415 INFO L93 Difference]: Finished difference Result 270 states and 321 transitions. [2021-12-14 13:35:17,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-14 13:35:17,417 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-12-14 13:35:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:17,418 INFO L225 Difference]: With dead ends: 270 [2021-12-14 13:35:17,418 INFO L226 Difference]: Without dead ends: 267 [2021-12-14 13:35:17,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2021-12-14 13:35:17,419 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 396 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:17,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 348 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-14 13:35:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-12-14 13:35:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 253. [2021-12-14 13:35:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2201834862385321) internal successors, (266), 233 states have internal predecessors, (266), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-14 13:35:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 305 transitions. [2021-12-14 13:35:17,437 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 305 transitions. Word has length 39 [2021-12-14 13:35:17,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:17,439 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 305 transitions. [2021-12-14 13:35:17,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:35:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 305 transitions. [2021-12-14 13:35:17,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 13:35:17,443 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:17,443 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:17,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 13:35:17,444 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:17,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:17,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1154705564, now seen corresponding path program 1 times [2021-12-14 13:35:17,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:17,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577473301] [2021-12-14 13:35:17,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:17,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:17,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-14 13:35:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:17,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 13:35:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:35:17,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:17,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577473301] [2021-12-14 13:35:17,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577473301] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:35:17,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247273423] [2021-12-14 13:35:17,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:17,944 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:17,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:35:17,947 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:35:17,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 13:35:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:18,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 117 conjunts are in the unsatisfiable core [2021-12-14 13:35:18,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:35:18,306 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 13:35:18,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 13:35:18,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 13:35:18,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 13:35:18,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:35:18,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:35:18,608 INFO L354 Elim1Store]: treesize reduction 77, result has 3.8 percent of original size [2021-12-14 13:35:18,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 46 [2021-12-14 13:35:18,620 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 24 treesize of output 16 [2021-12-14 13:35:18,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:18,628 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2021-12-14 13:35:18,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:18,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2021-12-14 13:35:18,692 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:35:18,692 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 36 treesize of output 35 [2021-12-14 13:35:18,815 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:35:18,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 13:35:18,885 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 30 treesize of output 28 [2021-12-14 13:35:18,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:18,911 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 8 [2021-12-14 13:35:19,145 INFO L354 Elim1Store]: treesize reduction 61, result has 19.7 percent of original size [2021-12-14 13:35:19,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 65 [2021-12-14 13:35:19,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:19,154 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 13:35:19,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 52 [2021-12-14 13:35:19,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:19,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:19,170 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-14 13:35:19,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 44 [2021-12-14 13:35:19,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-14 13:35:19,381 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-14 13:35:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:19,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:35:19,541 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_998 (Array Int Int))) (not (= |c_~#gl_list~0.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_998) |c_~#gl_list~0.base|) (+ 4 |c_~#gl_list~0.offset|))))) is different from false [2021-12-14 13:35:19,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_list_add___list_add_~next#1.offset_5| Int) (v_ArrVal_998 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1015 Int) (v_ArrVal_1013 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_list_add___list_add_~prev#1.offset_5| Int)) (or (not (= |c_~#gl_list~0.base| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1013) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1014) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (+ |v_list_add___list_add_~next#1.offset_5| 4) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1012) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_5| v_ArrVal_1015))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_998) |c_~#gl_list~0.base|) (+ 4 |c_~#gl_list~0.offset|)))) (< |c_~#gl_list~0.offset| |v_list_add___list_add_~prev#1.offset_5|))) is different from false [2021-12-14 13:35:19,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247273423] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:35:19,709 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:35:19,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2021-12-14 13:35:19,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307889596] [2021-12-14 13:35:19,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:35:19,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-14 13:35:19,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:19,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-14 13:35:19,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=882, Unknown=23, NotChecked=122, Total=1122 [2021-12-14 13:35:19,713 INFO L87 Difference]: Start difference. First operand 253 states and 305 transitions. Second operand has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 18 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:35:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:22,146 INFO L93 Difference]: Finished difference Result 369 states and 437 transitions. [2021-12-14 13:35:22,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-14 13:35:22,146 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 18 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 40 [2021-12-14 13:35:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:22,148 INFO L225 Difference]: With dead ends: 369 [2021-12-14 13:35:22,149 INFO L226 Difference]: Without dead ends: 366 [2021-12-14 13:35:22,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=314, Invalid=1904, Unknown=46, NotChecked=186, Total=2450 [2021-12-14 13:35:22,152 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 1125 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 2021 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 2021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 446 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:22,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1125 Valid, 586 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 2021 Invalid, 0 Unknown, 446 Unchecked, 1.4s Time] [2021-12-14 13:35:22,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-12-14 13:35:22,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 338. [2021-12-14 13:35:22,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 295 states have (on average 1.2203389830508475) internal successors, (360), 311 states have internal predecessors, (360), 33 states have call successors, (33), 11 states have call predecessors, (33), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-14 13:35:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 408 transitions. [2021-12-14 13:35:22,175 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 408 transitions. Word has length 40 [2021-12-14 13:35:22,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:22,175 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 408 transitions. [2021-12-14 13:35:22,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 18 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:35:22,176 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 408 transitions. [2021-12-14 13:35:22,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 13:35:22,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:22,178 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:22,206 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-14 13:35:22,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:22,388 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:22,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:22,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1293265745, now seen corresponding path program 1 times [2021-12-14 13:35:22,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:22,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434793850] [2021-12-14 13:35:22,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:22,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:22,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-14 13:35:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:22,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:22,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434793850] [2021-12-14 13:35:22,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434793850] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:35:22,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:35:22,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-14 13:35:22,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841150894] [2021-12-14 13:35:22,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:35:22,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 13:35:22,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:22,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 13:35:22,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:35:22,778 INFO L87 Difference]: Start difference. First operand 338 states and 408 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:35:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:23,964 INFO L93 Difference]: Finished difference Result 351 states and 419 transitions. [2021-12-14 13:35:23,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 13:35:23,965 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2021-12-14 13:35:23,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:23,966 INFO L225 Difference]: With dead ends: 351 [2021-12-14 13:35:23,966 INFO L226 Difference]: Without dead ends: 348 [2021-12-14 13:35:23,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2021-12-14 13:35:23,967 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 353 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:23,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 355 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-14 13:35:23,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-12-14 13:35:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 338. [2021-12-14 13:35:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 295 states have (on average 1.2169491525423728) internal successors, (359), 311 states have internal predecessors, (359), 33 states have call successors, (33), 11 states have call predecessors, (33), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-14 13:35:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 407 transitions. [2021-12-14 13:35:23,994 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 407 transitions. Word has length 42 [2021-12-14 13:35:23,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:23,995 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 407 transitions. [2021-12-14 13:35:23,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:35:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 407 transitions. [2021-12-14 13:35:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 13:35:23,996 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:23,996 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:23,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 13:35:23,997 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:23,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:23,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1188127317, now seen corresponding path program 1 times [2021-12-14 13:35:23,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:23,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597562942] [2021-12-14 13:35:23,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:23,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:24,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-14 13:35:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:24,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 13:35:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:35:24,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:35:24,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597562942] [2021-12-14 13:35:24,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597562942] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:35:24,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326358476] [2021-12-14 13:35:24,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:24,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:35:24,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:35:24,497 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:35:24,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 13:35:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:35:24,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 140 conjunts are in the unsatisfiable core [2021-12-14 13:35:24,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:35:24,748 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 13:35:24,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 13:35:24,834 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:35:24,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2021-12-14 13:35:24,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:24,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 13:35:24,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:35:24,877 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-14 13:35:25,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:25,090 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 47 [2021-12-14 13:35:25,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:25,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2021-12-14 13:35:25,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:25,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2021-12-14 13:35:25,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-14 13:35:25,191 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:35:25,192 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 57 treesize of output 52 [2021-12-14 13:35:25,335 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-12-14 13:35:25,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2021-12-14 13:35:25,411 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 50 treesize of output 44 [2021-12-14 13:35:25,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:25,435 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 12 [2021-12-14 13:35:25,572 INFO L354 Elim1Store]: treesize reduction 177, result has 36.1 percent of original size [2021-12-14 13:35:25,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 250 [2021-12-14 13:35:25,582 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 8 treesize of output 7 [2021-12-14 13:35:25,591 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 12 treesize of output 11 [2021-12-14 13:35:25,600 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 12 treesize of output 11 [2021-12-14 13:35:25,672 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-14 13:35:25,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 33 [2021-12-14 13:35:25,676 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 9 treesize of output 7 [2021-12-14 13:35:25,778 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:35:25,778 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 42 treesize of output 40 [2021-12-14 13:35:25,789 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 9 treesize of output 7 [2021-12-14 13:35:25,815 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 7 [2021-12-14 13:35:25,885 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-12-14 13:35:25,890 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 9 treesize of output 7 [2021-12-14 13:35:25,918 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:35:25,919 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 43 treesize of output 47 [2021-12-14 13:35:25,954 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 9 treesize of output 7 [2021-12-14 13:35:25,982 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-14 13:35:25,982 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 53 [2021-12-14 13:35:25,986 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 53 treesize of output 47 [2021-12-14 13:35:26,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:26,115 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-12-14 13:35:26,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 61 [2021-12-14 13:35:26,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:26,134 INFO L354 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2021-12-14 13:35:26,135 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 73 treesize of output 66 [2021-12-14 13:35:26,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:35:26,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2021-12-14 13:35:26,241 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-14 13:35:26,241 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 95 treesize of output 76 [2021-12-14 13:35:26,246 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 26 treesize of output 28 [2021-12-14 13:35:26,718 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-14 13:35:26,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 23 [2021-12-14 13:35:26,724 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 13:35:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:35:26,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:35:26,995 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1444 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1444) |c_~#gl_list~0.base|) (+ 4 |c_~#gl_list~0.offset|)) 0))) (forall ((v_ArrVal_1443 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1443) |c_~#gl_list~0.base|) (+ 4 |c_~#gl_list~0.offset|)) 0)))) is different from false [2021-12-14 13:35:27,202 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 102 treesize of output 100 [2021-12-14 13:35:27,205 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 130 treesize of output 122 [2021-12-14 13:35:27,209 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 137 treesize of output 133 [2021-12-14 13:35:27,212 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 148 treesize of output 144 [2021-12-14 13:35:27,216 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 144 treesize of output 140 [2021-12-14 13:35:27,241 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_list_add___list_add_~next#1.offset_8| Int) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1473 (Array Int Int)) (v_ArrVal_1468 Int)) (not (= (select (select (store (let ((.cse0 (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (+ |v_list_add___list_add_~next#1.offset_8| 4) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))))) (store (store .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1467) |c_~#gl_list~0.base| (store (select (store .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1473) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_1468))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1444) |c_~#gl_list~0.base|) (+ 4 |c_~#gl_list~0.offset|)) 0))) is different from false [2021-12-14 13:35:27,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326358476] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:35:27,242 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:35:27,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2021-12-14 13:35:27,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270470376] [2021-12-14 13:35:27,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:35:27,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-14 13:35:27,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:35:27,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-14 13:35:27,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1026, Unknown=6, NotChecked=130, Total=1260 [2021-12-14 13:35:27,245 INFO L87 Difference]: Start difference. First operand 338 states and 407 transitions. Second operand has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 20 states have internal predecessors, (71), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:35:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:35:29,580 INFO L93 Difference]: Finished difference Result 410 states and 488 transitions. [2021-12-14 13:35:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 13:35:29,580 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 20 states have internal predecessors, (71), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 43 [2021-12-14 13:35:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:35:29,582 INFO L225 Difference]: With dead ends: 410 [2021-12-14 13:35:29,582 INFO L226 Difference]: Without dead ends: 407 [2021-12-14 13:35:29,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=207, Invalid=2239, Unknown=12, NotChecked=194, Total=2652 [2021-12-14 13:35:29,585 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 501 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 2288 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 4062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1678 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-14 13:35:29,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 925 Invalid, 4062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2288 Invalid, 0 Unknown, 1678 Unchecked, 1.4s Time] [2021-12-14 13:35:29,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-12-14 13:35:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 349. [2021-12-14 13:35:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 306 states have (on average 1.2091503267973855) internal successors, (370), 321 states have internal predecessors, (370), 33 states have call successors, (33), 12 states have call predecessors, (33), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-14 13:35:29,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 418 transitions. [2021-12-14 13:35:29,605 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 418 transitions. Word has length 43 [2021-12-14 13:35:29,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:35:29,606 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 418 transitions. [2021-12-14 13:35:29,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 20 states have internal predecessors, (71), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:35:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 418 transitions. [2021-12-14 13:35:29,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 13:35:29,607 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:35:29,607 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:29,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 13:35:29,837 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,SelfDestructingSolverStorable10 [2021-12-14 13:35:29,838 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:35:29,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:35:29,838 INFO L85 PathProgramCache]: Analyzing trace with hash -2001574846, now seen corresponding path program 1 times [2021-12-14 13:35:29,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:35:29,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123481423] [2021-12-14 13:35:29,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:35:29,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:35:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 13:35:29,874 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 13:35:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 13:35:29,921 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 13:35:29,921 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 13:35:29,922 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 13:35:29,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 13:35:29,926 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:35:29,928 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 13:35:29,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:35:29 BoogieIcfgContainer [2021-12-14 13:35:29,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 13:35:29,984 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 13:35:29,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 13:35:29,984 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 13:35:29,984 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:35:09" (3/4) ... [2021-12-14 13:35:29,986 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 13:35:30,030 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 13:35:30,030 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 13:35:30,030 INFO L158 Benchmark]: Toolchain (without parser) took 22217.72ms. Allocated memory was 83.9MB in the beginning and 218.1MB in the end (delta: 134.2MB). Free memory was 51.4MB in the beginning and 147.7MB in the end (delta: -96.3MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2021-12-14 13:35:30,031 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory was 41.3MB in the beginning and 41.2MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 13:35:30,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.31ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 51.2MB in the beginning and 62.3MB in the end (delta: -11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 13:35:30,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.45ms. Allocated memory is still 102.8MB. Free memory was 62.3MB in the beginning and 60.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:35:30,032 INFO L158 Benchmark]: Boogie Preprocessor took 52.37ms. Allocated memory is still 102.8MB. Free memory was 60.2MB in the beginning and 57.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:35:30,032 INFO L158 Benchmark]: RCFGBuilder took 511.07ms. Allocated memory is still 102.8MB. Free memory was 57.6MB in the beginning and 72.6MB in the end (delta: -15.1MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2021-12-14 13:35:30,032 INFO L158 Benchmark]: TraceAbstraction took 20933.86ms. Allocated memory was 102.8MB in the beginning and 218.1MB in the end (delta: 115.3MB). Free memory was 72.6MB in the beginning and 150.9MB in the end (delta: -78.2MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2021-12-14 13:35:30,033 INFO L158 Benchmark]: Witness Printer took 46.37ms. Allocated memory is still 218.1MB. Free memory was 150.9MB in the beginning and 147.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:35:30,034 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory was 41.3MB in the beginning and 41.2MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.31ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 51.2MB in the beginning and 62.3MB in the end (delta: -11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.45ms. Allocated memory is still 102.8MB. Free memory was 62.3MB in the beginning and 60.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.37ms. Allocated memory is still 102.8MB. Free memory was 60.2MB in the beginning and 57.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 511.07ms. Allocated memory is still 102.8MB. Free memory was 57.6MB in the beginning and 72.6MB in the end (delta: -15.1MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 20933.86ms. Allocated memory was 102.8MB in the beginning and 218.1MB in the end (delta: 115.3MB). Free memory was 72.6MB in the beginning and 150.9MB in the end (delta: -78.2MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. * Witness Printer took 46.37ms. Allocated memory is still 218.1MB. Free memory was 150.9MB in the beginning and 147.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 840]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; VAL [gl_list={3:0}] [L949] CALL gl_read() [L909] CALL gl_insert(__VERIFIER_nondet_int()) [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) VAL [\old(value)=5, gl_list={3:0}, node={-1:0}, value=5] [L902] node->value = value VAL [\old(value)=5, gl_list={3:0}, node={-1:0}, value=5] [L903] CALL list_add(&node->linkage, &gl_list) VAL [gl_list={3:0}] [L890] EXPR head->next [L890] CALL __list_add(new, head, head->next) [L878] next->prev = new [L879] new->next = next [L880] new->prev = prev [L881] prev->next = new VAL [gl_list={3:0}, new={-1:4}, new={-1:4}, next={3:0}, next={3:0}, prev={3:0}, prev={3:0}] [L890] RET __list_add(new, head, head->next) [L903] RET list_add(&node->linkage, &gl_list) VAL [\old(value)=5, gl_list={3:0}, node={-1:0}, value=5] [L904] (&node->nested)->next = (&node->nested) [L904] (&node->nested)->next = (&node->nested) VAL [\old(value)=5, gl_list={3:0}, node={-1:0}, value=5] [L909] RET gl_insert(__VERIFIER_nondet_int()) [L911] COND FALSE !(__VERIFIER_nondet_int()) [L949] RET gl_read() [L950] CALL inspect(&gl_list) VAL [gl_list={3:0}, head={3:0}] [L853] COND FALSE !(!(head)) VAL [gl_list={3:0}, head={3:0}, head={3:0}] [L854] EXPR head->next VAL [gl_list={3:0}, head={3:0}, head={3:0}, head->next={-1:4}] [L854] COND FALSE !(!(head->next != head)) [L855] EXPR head->prev VAL [gl_list={3:0}, head={3:0}, head={3:0}, head->prev={-1:4}] [L855] COND FALSE !(!(head->prev != head)) [L856] EXPR head->prev [L856] head = head->prev [L857] COND FALSE !(!(head)) VAL [gl_list={3:0}, head={3:0}, head={-1:4}] [L858] EXPR head->next VAL [gl_list={3:0}, head={3:0}, head={-1:4}, head->next={3:0}] [L858] COND FALSE !(!(head->next != head)) [L859] EXPR head->prev VAL [gl_list={3:0}, head={-1:4}, head={3:0}, head->prev={3:0}] [L859] COND FALSE !(!(head->prev != head)) [L860] const struct node *node = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); VAL [gl_list={3:0}, head={3:0}, head={-1:4}, node={-1:0}] [L861] COND FALSE !(!(node)) VAL [gl_list={3:0}, head={3:0}, head={-1:4}, node={-1:0}] [L862] EXPR node->nested.next VAL [gl_list={3:0}, head={3:0}, head={-1:4}, node={-1:0}, node->nested.next={-1:12}] [L862] COND FALSE !(!(node->nested.next == &node->nested)) [L863] EXPR node->nested.prev VAL [gl_list={3:0}, head={3:0}, head={-1:4}, node={-1:0}, node->nested.prev={55:53}] [L863] COND TRUE !(node->nested.prev == &node->nested) [L863] CALL fail() VAL [gl_list={3:0}] [L840] reach_error() VAL [gl_list={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4403 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4385 mSDsluCounter, 4156 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2124 IncrementalHoareTripleChecker+Unchecked, 3082 mSDsCounter, 916 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11254 IncrementalHoareTripleChecker+Invalid, 14294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 916 mSolverCounterUnsat, 1074 mSDtfsCounter, 11254 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 236 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=11, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 196 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 414 ConstructedInterpolants, 30 QuantifiedInterpolants, 11162 SizeOfPredicates, 77 NumberOfNonLiveVariables, 838 ConjunctsInSsa, 257 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 2/52 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-14 13:35:30,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE