./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 e8d55036 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-?-e8d5503-m [2023-02-15 19:26:40,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:26:40,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:26:40,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:26:40,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:26:40,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:26:40,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:26:40,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:26:40,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:26:40,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:26:40,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:26:40,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:26:40,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:26:40,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:26:40,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:26:40,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:26:40,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:26:40,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:26:40,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:26:40,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:26:40,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:26:40,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:26:40,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:26:40,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:26:40,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:26:40,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:26:40,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:26:40,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:26:40,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:26:40,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:26:40,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:26:40,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:26:40,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:26:40,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:26:40,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:26:40,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:26:40,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:26:40,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:26:40,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:26:40,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:26:40,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:26:40,841 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:26:40,872 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:26:40,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:26:40,873 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:26:40,873 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:26:40,874 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:26:40,881 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:26:40,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:26:40,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:26:40,883 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:26:40,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:26:40,884 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:26:40,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:26:40,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:26:40,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:26:40,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:26:40,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:26:40,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:26:40,885 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:26:40,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:26:40,886 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:26:40,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:26:40,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:26:40,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:26:40,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:26:40,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:26:40,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:26:40,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:26:40,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:26:40,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:26:40,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:26:40,888 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:26:40,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:26:40,889 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:26:40,889 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:26:40,889 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:26:40,889 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-02-15 19:26:41,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:26:41,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:26:41,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:26:41,163 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:26:41,163 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:26:41,164 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 [2023-02-15 19:26:42,265 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:26:42,526 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:26:42,527 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2023-02-15 19:26:42,542 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc99456a7/09d4a2588a1242d9a5f78824812586a0/FLAG66b375c64 [2023-02-15 19:26:42,555 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc99456a7/09d4a2588a1242d9a5f78824812586a0 [2023-02-15 19:26:42,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:26:42,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:26:42,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:26:42,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:26:42,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:26:42,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:26:42" (1/1) ... [2023-02-15 19:26:42,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2456b333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:42, skipping insertion in model container [2023-02-15 19:26:42,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:26:42" (1/1) ... [2023-02-15 19:26:42,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:26:42,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:26:43,014 WARN L237 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] [2023-02-15 19:26:43,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:26:43,056 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:26:43,089 WARN L237 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] [2023-02-15 19:26:43,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:26:43,146 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:26:43,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:43 WrapperNode [2023-02-15 19:26:43,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:26:43,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:26:43,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:26:43,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:26:43,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:43" (1/1) ... [2023-02-15 19:26:43,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:43" (1/1) ... [2023-02-15 19:26:43,187 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 116 [2023-02-15 19:26:43,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:26:43,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:26:43,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:26:43,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:26:43,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:43" (1/1) ... [2023-02-15 19:26:43,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:43" (1/1) ... [2023-02-15 19:26:43,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:43" (1/1) ... [2023-02-15 19:26:43,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:43" (1/1) ... [2023-02-15 19:26:43,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:43" (1/1) ... [2023-02-15 19:26:43,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:43" (1/1) ... [2023-02-15 19:26:43,220 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:43" (1/1) ... [2023-02-15 19:26:43,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:43" (1/1) ... [2023-02-15 19:26:43,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:26:43,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:26:43,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:26:43,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:26:43,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:43" (1/1) ... [2023-02-15 19:26:43,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:26:43,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:26:43,280 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) [2023-02-15 19:26:43,324 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 [2023-02-15 19:26:43,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:26:43,339 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-02-15 19:26:43,340 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-02-15 19:26:43,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:26:43,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 19:26:43,342 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-02-15 19:26:43,342 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-02-15 19:26:43,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 19:26:43,343 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-02-15 19:26:43,343 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-02-15 19:26:43,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 19:26:43,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:26:43,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:26:43,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:26:43,344 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-02-15 19:26:43,344 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-02-15 19:26:43,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:26:43,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:26:43,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:26:43,499 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:26:43,501 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:26:43,867 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:26:43,873 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:26:43,874 INFO L300 CfgBuilder]: Removed 41 assume(true) statements. [2023-02-15 19:26:43,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:26:43 BoogieIcfgContainer [2023-02-15 19:26:43,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:26:43,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:26:43,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:26:43,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:26:43,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:26:42" (1/3) ... [2023-02-15 19:26:43,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682f7c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:26:43, skipping insertion in model container [2023-02-15 19:26:43,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:43" (2/3) ... [2023-02-15 19:26:43,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682f7c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:26:43, skipping insertion in model container [2023-02-15 19:26:43,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:26:43" (3/3) ... [2023-02-15 19:26:43,891 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2023-02-15 19:26:43,907 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:26:43,907 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:26:43,963 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:26:43,968 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6466f869, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:26:43,968 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:26:43,972 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) [2023-02-15 19:26:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 19:26:43,976 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:43,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:43,977 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:43,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:43,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1761516263, now seen corresponding path program 1 times [2023-02-15 19:26:43,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:43,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247051337] [2023-02-15 19:26:43,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:43,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:44,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:44,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247051337] [2023-02-15 19:26:44,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247051337] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:44,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:44,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 19:26:44,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080947062] [2023-02-15 19:26:44,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:44,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 19:26:44,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:44,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 19:26:44,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:26:44,133 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) [2023-02-15 19:26:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:44,169 INFO L93 Difference]: Finished difference Result 230 states and 397 transitions. [2023-02-15 19:26:44,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 19:26:44,171 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 [2023-02-15 19:26:44,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:44,177 INFO L225 Difference]: With dead ends: 230 [2023-02-15 19:26:44,178 INFO L226 Difference]: Without dead ends: 107 [2023-02-15 19:26:44,182 INFO L412 NwaCegarLoop]: 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 [2023-02-15 19:26:44,184 INFO L413 NwaCegarLoop]: 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 [2023-02-15 19:26:44,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:26:44,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-15 19:26:44,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-02-15 19:26:44,218 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) [2023-02-15 19:26:44,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2023-02-15 19:26:44,221 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 9 [2023-02-15 19:26:44,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:44,221 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2023-02-15 19:26:44,222 INFO L496 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) [2023-02-15 19:26:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2023-02-15 19:26:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 19:26:44,223 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:44,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:44,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:26:44,224 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:44,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:44,224 INFO L85 PathProgramCache]: Analyzing trace with hash 849043181, now seen corresponding path program 1 times [2023-02-15 19:26:44,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:44,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512729060] [2023-02-15 19:26:44,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:44,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:44,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:26:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:44,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:44,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512729060] [2023-02-15 19:26:44,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512729060] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:44,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:44,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 19:26:44,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807548860] [2023-02-15 19:26:44,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:44,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:26:44,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:44,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:26:44,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:26:44,639 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) [2023-02-15 19:26:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:44,900 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2023-02-15 19:26:44,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 19:26:44,901 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 [2023-02-15 19:26:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:44,902 INFO L225 Difference]: With dead ends: 109 [2023-02-15 19:26:44,902 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 19:26:44,903 INFO L412 NwaCegarLoop]: 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 [2023-02-15 19:26:44,904 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 242 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:44,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 133 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:26:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 19:26:44,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-15 19:26:44,916 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) [2023-02-15 19:26:44,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2023-02-15 19:26:44,917 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 21 [2023-02-15 19:26:44,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:44,918 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2023-02-15 19:26:44,919 INFO L496 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) [2023-02-15 19:26:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2023-02-15 19:26:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 19:26:44,920 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:44,920 INFO L195 NwaCegarLoop]: 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] [2023-02-15 19:26:44,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:26:44,920 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:44,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:44,921 INFO L85 PathProgramCache]: Analyzing trace with hash 502050183, now seen corresponding path program 1 times [2023-02-15 19:26:44,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:44,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123915488] [2023-02-15 19:26:44,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:44,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:45,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:26:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:45,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:45,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123915488] [2023-02-15 19:26:45,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123915488] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:45,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:45,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 19:26:45,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298840550] [2023-02-15 19:26:45,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:45,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 19:26:45,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:45,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 19:26:45,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 19:26:45,616 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) [2023-02-15 19:26:46,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:46,324 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2023-02-15 19:26:46,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 19:26:46,325 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 [2023-02-15 19:26:46,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:46,326 INFO L225 Difference]: With dead ends: 196 [2023-02-15 19:26:46,326 INFO L226 Difference]: Without dead ends: 190 [2023-02-15 19:26:46,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-02-15 19:26:46,328 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 493 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:46,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 169 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 19:26:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-15 19:26:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 172. [2023-02-15 19:26:46,348 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) [2023-02-15 19:26:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2023-02-15 19:26:46,350 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 24 [2023-02-15 19:26:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:46,350 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2023-02-15 19:26:46,350 INFO L496 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) [2023-02-15 19:26:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2023-02-15 19:26:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 19:26:46,351 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:46,351 INFO L195 NwaCegarLoop]: 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] [2023-02-15 19:26:46,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 19:26:46,352 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:46,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:46,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1234303898, now seen corresponding path program 1 times [2023-02-15 19:26:46,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:46,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160114838] [2023-02-15 19:26:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:46,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:47,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:26:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:47,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:47,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160114838] [2023-02-15 19:26:47,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160114838] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:47,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:47,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 19:26:47,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011860051] [2023-02-15 19:26:47,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:47,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 19:26:47,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:47,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 19:26:47,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-15 19:26:47,346 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) [2023-02-15 19:26:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:48,144 INFO L93 Difference]: Finished difference Result 274 states and 329 transitions. [2023-02-15 19:26:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 19:26:48,145 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 [2023-02-15 19:26:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:48,146 INFO L225 Difference]: With dead ends: 274 [2023-02-15 19:26:48,146 INFO L226 Difference]: Without dead ends: 271 [2023-02-15 19:26:48,146 INFO L412 NwaCegarLoop]: 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 [2023-02-15 19:26:48,147 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 307 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:48,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 247 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 19:26:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-02-15 19:26:48,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 253. [2023-02-15 19:26:48,177 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) [2023-02-15 19:26:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2023-02-15 19:26:48,178 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 27 [2023-02-15 19:26:48,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:48,179 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2023-02-15 19:26:48,179 INFO L496 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) [2023-02-15 19:26:48,179 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2023-02-15 19:26:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 19:26:48,180 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:48,180 INFO L195 NwaCegarLoop]: 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] [2023-02-15 19:26:48,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 19:26:48,180 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:48,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1680148119, now seen corresponding path program 1 times [2023-02-15 19:26:48,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:48,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843840004] [2023-02-15 19:26:48,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:48,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:48,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:26:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:49,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:49,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843840004] [2023-02-15 19:26:49,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843840004] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:49,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:49,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 19:26:49,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218656312] [2023-02-15 19:26:49,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:49,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 19:26:49,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:49,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 19:26:49,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:26:49,238 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 8 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) [2023-02-15 19:26:50,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:50,154 INFO L93 Difference]: Finished difference Result 273 states and 327 transitions. [2023-02-15 19:26:50,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 19:26:50,156 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 8 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 [2023-02-15 19:26:50,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:50,158 INFO L225 Difference]: With dead ends: 273 [2023-02-15 19:26:50,158 INFO L226 Difference]: Without dead ends: 270 [2023-02-15 19:26:50,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2023-02-15 19:26:50,159 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 345 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:50,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 243 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 19:26:50,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-15 19:26:50,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 253. [2023-02-15 19:26:50,185 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) [2023-02-15 19:26:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 308 transitions. [2023-02-15 19:26:50,187 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 308 transitions. Word has length 30 [2023-02-15 19:26:50,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:50,187 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 308 transitions. [2023-02-15 19:26:50,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 8 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) [2023-02-15 19:26:50,187 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 308 transitions. [2023-02-15 19:26:50,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 19:26:50,188 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:50,188 INFO L195 NwaCegarLoop]: 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] [2023-02-15 19:26:50,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 19:26:50,189 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:50,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:50,189 INFO L85 PathProgramCache]: Analyzing trace with hash -493122043, now seen corresponding path program 1 times [2023-02-15 19:26:50,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:50,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164595112] [2023-02-15 19:26:50,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:50,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:51,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:26:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:51,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:51,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164595112] [2023-02-15 19:26:51,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164595112] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:51,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:51,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-15 19:26:51,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117174681] [2023-02-15 19:26:51,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:51,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 19:26:51,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:51,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 19:26:51,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-02-15 19:26:51,917 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) [2023-02-15 19:26:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:53,088 INFO L93 Difference]: Finished difference Result 272 states and 325 transitions. [2023-02-15 19:26:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 19:26:53,089 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 [2023-02-15 19:26:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:53,090 INFO L225 Difference]: With dead ends: 272 [2023-02-15 19:26:53,090 INFO L226 Difference]: Without dead ends: 269 [2023-02-15 19:26:53,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2023-02-15 19:26:53,092 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 475 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:53,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 280 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 19:26:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-02-15 19:26:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 253. [2023-02-15 19:26:53,135 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) [2023-02-15 19:26:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 307 transitions. [2023-02-15 19:26:53,137 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 307 transitions. Word has length 33 [2023-02-15 19:26:53,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:53,138 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 307 transitions. [2023-02-15 19:26:53,138 INFO L496 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) [2023-02-15 19:26:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 307 transitions. [2023-02-15 19:26:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 19:26:53,139 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:53,139 INFO L195 NwaCegarLoop]: 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] [2023-02-15 19:26:53,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 19:26:53,140 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:53,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:53,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2033122620, now seen corresponding path program 1 times [2023-02-15 19:26:53,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:53,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547392120] [2023-02-15 19:26:53,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:53,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:54,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:26:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:54,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:54,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:54,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547392120] [2023-02-15 19:26:54,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547392120] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:54,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:54,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 19:26:54,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248625838] [2023-02-15 19:26:54,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:54,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 19:26:54,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:54,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 19:26:54,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:26:54,579 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) [2023-02-15 19:26:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:55,612 INFO L93 Difference]: Finished difference Result 271 states and 323 transitions. [2023-02-15 19:26:55,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 19:26:55,613 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 [2023-02-15 19:26:55,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:55,614 INFO L225 Difference]: With dead ends: 271 [2023-02-15 19:26:55,615 INFO L226 Difference]: Without dead ends: 268 [2023-02-15 19:26:55,615 INFO L412 NwaCegarLoop]: 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 [2023-02-15 19:26:55,616 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 333 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:55,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 271 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 19:26:55,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-02-15 19:26:55,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 253. [2023-02-15 19:26:55,641 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) [2023-02-15 19:26:55,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 306 transitions. [2023-02-15 19:26:55,643 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 306 transitions. Word has length 36 [2023-02-15 19:26:55,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:55,643 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 306 transitions. [2023-02-15 19:26:55,644 INFO L496 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) [2023-02-15 19:26:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 306 transitions. [2023-02-15 19:26:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 19:26:55,645 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:55,645 INFO L195 NwaCegarLoop]: 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] [2023-02-15 19:26:55,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 19:26:55,645 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:55,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1335339115, now seen corresponding path program 1 times [2023-02-15 19:26:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:55,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681966901] [2023-02-15 19:26:55,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:56,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:26:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:56,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:56,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:56,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681966901] [2023-02-15 19:26:56,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681966901] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:56,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:56,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 19:26:56,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931128606] [2023-02-15 19:26:56,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:56,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 19:26:56,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:56,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 19:26:56,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:26:56,643 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) [2023-02-15 19:26:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:57,568 INFO L93 Difference]: Finished difference Result 270 states and 321 transitions. [2023-02-15 19:26:57,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 19:26:57,571 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 [2023-02-15 19:26:57,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:57,572 INFO L225 Difference]: With dead ends: 270 [2023-02-15 19:26:57,572 INFO L226 Difference]: Without dead ends: 267 [2023-02-15 19:26:57,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2023-02-15 19:26:57,573 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 553 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:57,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 225 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 19:26:57,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-02-15 19:26:57,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 253. [2023-02-15 19:26:57,602 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) [2023-02-15 19:26:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 305 transitions. [2023-02-15 19:26:57,604 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 305 transitions. Word has length 39 [2023-02-15 19:26:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:57,604 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 305 transitions. [2023-02-15 19:26:57,604 INFO L496 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) [2023-02-15 19:26:57,605 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 305 transitions. [2023-02-15 19:26:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 19:26:57,605 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:57,606 INFO L195 NwaCegarLoop]: 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] [2023-02-15 19:26:57,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 19:26:57,606 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:57,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:57,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1154705564, now seen corresponding path program 1 times [2023-02-15 19:26:57,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:57,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693211908] [2023-02-15 19:26:57,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:57,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:58,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:26:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:59,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:26:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:27:00,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:00,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693211908] [2023-02-15 19:27:00,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693211908] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:00,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927688390] [2023-02-15 19:27:00,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:00,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:27:00,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:27:00,461 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) [2023-02-15 19:27:00,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 19:27:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:00,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 133 conjunts are in the unsatisfiable core [2023-02-15 19:27:00,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:27:00,777 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:27:00,777 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:27:00,862 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:27:00,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2023-02-15 19:27:00,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:00,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 19:27:00,898 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:27:00,902 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:27:01,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:01,035 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 47 [2023-02-15 19:27:01,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:01,045 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 30 [2023-02-15 19:27:01,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:01,050 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 25 treesize of output 27 [2023-02-15 19:27:01,054 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:27:01,104 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:27:01,104 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 29 [2023-02-15 19:27:01,189 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:27:01,190 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:27:01,258 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 24 [2023-02-15 19:27:01,272 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 8 [2023-02-15 19:27:01,417 INFO L321 Elim1Store]: treesize reduction 177, result has 36.1 percent of original size [2023-02-15 19:27:01,417 INFO L350 Elim1Store]: Elim1 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 397 [2023-02-15 19:27:01,432 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:27:01,446 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:27:01,459 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:27:01,526 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:27:01,530 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:27:01,544 INFO L321 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2023-02-15 19:27:01,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 152 treesize of output 153 [2023-02-15 19:27:01,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 19:27:01,596 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:27:01,612 INFO L321 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2023-02-15 19:27:01,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 152 treesize of output 151 [2023-02-15 19:27:01,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 19:27:01,684 INFO L321 Elim1Store]: treesize reduction 80, result has 13.0 percent of original size [2023-02-15 19:27:01,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 163 treesize of output 116 [2023-02-15 19:27:01,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 19:27:01,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 19:27:01,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:01,887 INFO L321 Elim1Store]: treesize reduction 58, result has 24.7 percent of original size [2023-02-15 19:27:01,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 124 [2023-02-15 19:27:01,896 INFO L350 Elim1Store]: Elim1 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 109 treesize of output 89 [2023-02-15 19:27:01,903 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:27:01,922 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-02-15 19:27:01,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 24 [2023-02-15 19:27:01,927 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:27:01,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-15 19:27:01,986 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:27:02,178 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 8 [2023-02-15 19:27:02,202 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:27:02,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:27:02,556 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1029 Int)) (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_1028) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1033) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1026) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1027) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_1029))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1002) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4))))) is different from false [2023-02-15 19:27:02,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927688390] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:02,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:27:02,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2023-02-15 19:27:02,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721014581] [2023-02-15 19:27:02,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:27:02,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-15 19:27:02,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:02,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-15 19:27:02,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=813, Unknown=6, NotChecked=58, Total=992 [2023-02-15 19:27:02,561 INFO L87 Difference]: Start difference. First operand 253 states and 305 transitions. Second operand has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 19 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) [2023-02-15 19:27:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:05,882 INFO L93 Difference]: Finished difference Result 465 states and 552 transitions. [2023-02-15 19:27:05,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 19:27:05,882 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 19 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 [2023-02-15 19:27:05,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:05,885 INFO L225 Difference]: With dead ends: 465 [2023-02-15 19:27:05,885 INFO L226 Difference]: Without dead ends: 462 [2023-02-15 19:27:05,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=383, Invalid=2065, Unknown=6, NotChecked=96, Total=2550 [2023-02-15 19:27:05,887 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1416 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 245 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1422 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 2461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:05,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1422 Valid, 422 Invalid, 2461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 2215 Invalid, 1 Unknown, 0 Unchecked, 1.7s Time] [2023-02-15 19:27:05,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2023-02-15 19:27:05,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 347. [2023-02-15 19:27:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 303 states have (on average 1.2178217821782178) internal successors, (369), 319 states have internal predecessors, (369), 34 states have call successors, (34), 11 states have call predecessors, (34), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-15 19:27:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 419 transitions. [2023-02-15 19:27:05,932 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 419 transitions. Word has length 40 [2023-02-15 19:27:05,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:05,933 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 419 transitions. [2023-02-15 19:27:05,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 19 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) [2023-02-15 19:27:05,933 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 419 transitions. [2023-02-15 19:27:05,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 19:27:05,934 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:05,934 INFO L195 NwaCegarLoop]: 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] [2023-02-15 19:27:05,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 19:27:06,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:27:06,140 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:06,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1293265745, now seen corresponding path program 1 times [2023-02-15 19:27:06,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:06,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66047028] [2023-02-15 19:27:06,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:06,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:07,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:27:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:07,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:27:07,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:07,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66047028] [2023-02-15 19:27:07,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66047028] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:07,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:07,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 19:27:07,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306264668] [2023-02-15 19:27:07,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:07,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 19:27:07,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:07,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 19:27:07,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2023-02-15 19:27:07,394 INFO L87 Difference]: Start difference. First operand 347 states and 419 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) [2023-02-15 19:27:08,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:08,509 INFO L93 Difference]: Finished difference Result 360 states and 430 transitions. [2023-02-15 19:27:08,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 19:27:08,510 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 [2023-02-15 19:27:08,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:08,514 INFO L225 Difference]: With dead ends: 360 [2023-02-15 19:27:08,533 INFO L226 Difference]: Without dead ends: 357 [2023-02-15 19:27:08,533 INFO L412 NwaCegarLoop]: 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 [2023-02-15 19:27:08,534 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 379 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:08,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 295 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 19:27:08,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2023-02-15 19:27:08,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 347. [2023-02-15 19:27:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 303 states have (on average 1.2145214521452146) internal successors, (368), 319 states have internal predecessors, (368), 34 states have call successors, (34), 11 states have call predecessors, (34), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-15 19:27:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 418 transitions. [2023-02-15 19:27:08,622 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 418 transitions. Word has length 42 [2023-02-15 19:27:08,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:08,623 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 418 transitions. [2023-02-15 19:27:08,623 INFO L496 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) [2023-02-15 19:27:08,623 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 418 transitions. [2023-02-15 19:27:08,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 19:27:08,624 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:08,625 INFO L195 NwaCegarLoop]: 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] [2023-02-15 19:27:08,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 19:27:08,625 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:08,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:08,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1188127317, now seen corresponding path program 1 times [2023-02-15 19:27:08,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:08,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331863619] [2023-02-15 19:27:08,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:08,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:09,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:27:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:09,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:27:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:27:09,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:09,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331863619] [2023-02-15 19:27:09,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331863619] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:09,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68926370] [2023-02-15 19:27:09,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:09,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:27:09,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:27:09,889 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) [2023-02-15 19:27:09,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 19:27:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:10,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 166 conjunts are in the unsatisfiable core [2023-02-15 19:27:10,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:27:10,152 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:27:10,153 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:27:10,206 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 23 [2023-02-15 19:27:10,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:10,228 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 7 [2023-02-15 19:27:10,312 INFO L321 Elim1Store]: treesize reduction 69, result has 33.0 percent of original size [2023-02-15 19:27:10,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 100 [2023-02-15 19:27:10,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 91 [2023-02-15 19:27:10,519 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-15 19:27:10,519 INFO L350 Elim1Store]: Elim1 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 142 treesize of output 151 [2023-02-15 19:27:10,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:10,549 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 19:27:10,550 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 123 [2023-02-15 19:27:11,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:11,039 INFO L350 Elim1Store]: Elim1 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 163 treesize of output 161 [2023-02-15 19:27:11,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:11,045 INFO L350 Elim1Store]: Elim1 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 121 treesize of output 119 [2023-02-15 19:27:11,057 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-15 19:27:11,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 126 [2023-02-15 19:27:11,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:11,084 INFO L321 Elim1Store]: treesize reduction 22, result has 52.2 percent of original size [2023-02-15 19:27:11,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 130 [2023-02-15 19:27:11,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:11,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 114 [2023-02-15 19:27:11,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:11,099 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 109 [2023-02-15 19:27:11,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:11,107 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 102 [2023-02-15 19:27:11,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 92 [2023-02-15 19:27:11,236 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 5 [2023-02-15 19:27:11,267 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 5 [2023-02-15 19:27:11,282 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 5 [2023-02-15 19:27:11,291 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:27:11,294 INFO L350 Elim1Store]: Elim1 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 57 treesize of output 49 [2023-02-15 19:27:11,420 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:27:11,421 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:27:11,497 INFO L350 Elim1Store]: Elim1 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 57 treesize of output 59 [2023-02-15 19:27:11,500 INFO L350 Elim1Store]: Elim1 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 57 treesize of output 51 [2023-02-15 19:27:11,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:11,532 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 8 [2023-02-15 19:27:11,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:11,706 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-15 19:27:11,706 INFO L350 Elim1Store]: Elim1 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 157 treesize of output 109 [2023-02-15 19:27:11,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:11,728 INFO L321 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-02-15 19:27:11,728 INFO L350 Elim1Store]: Elim1 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 131 treesize of output 120 [2023-02-15 19:27:11,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:11,741 INFO L350 Elim1Store]: Elim1 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 107 treesize of output 89 [2023-02-15 19:27:11,757 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 19:27:11,758 INFO L350 Elim1Store]: Elim1 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 76 treesize of output 68 [2023-02-15 19:27:11,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:11,779 INFO L321 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-02-15 19:27:11,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 66 [2023-02-15 19:27:11,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:11,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 49 [2023-02-15 19:27:11,796 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 19:27:11,805 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 19:27:11,915 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 19:27:11,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 74 [2023-02-15 19:27:11,932 INFO L321 Elim1Store]: treesize reduction 37, result has 36.2 percent of original size [2023-02-15 19:27:11,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 75 [2023-02-15 19:27:12,182 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 15 [2023-02-15 19:27:12,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 19:27:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:27:12,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:27:12,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68926370] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:12,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:27:12,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2023-02-15 19:27:12,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653337843] [2023-02-15 19:27:12,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:27:12,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-15 19:27:12,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:12,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-15 19:27:12,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1051, Unknown=9, NotChecked=0, Total=1190 [2023-02-15 19:27:12,808 INFO L87 Difference]: Start difference. First operand 347 states and 418 transitions. Second operand has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 19 states have internal predecessors, (73), 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) [2023-02-15 19:27:13,227 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#gl_list~0.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|))) (let ((.cse0 (select .cse6 |c_~#gl_list~0.offset|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|)) (.cse5 (select .cse6 .cse4)) (.cse1 (select |c_#valid| 3))) (and (= 3 |c_~#gl_list~0.base|) (not (= |c_~#gl_list~0.base| .cse0)) (= 1 .cse1) (= 1 (select |c_#valid| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= |c_~#gl_list~0.base| 3) (let ((.cse2 (not (= .cse0 3)))) (or (and .cse2 (= 4 (select .cse3 .cse4)) (= .cse5 .cse0)) (and (= .cse5 |c_~#gl_list~0.base|) .cse2))) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| 3)) (or (and (exists ((v_ArrVal_1447 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (and (= .cse6 (store (select (store (store (store (store |c_#memory_$Pointer$.base| |c_~#gl_list~0.base| v_DerPreprocessor_7) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_8) |c_~#gl_list~0.base| v_DerPreprocessor_7) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1447) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select v_DerPreprocessor_7 |c_~#gl_list~0.offset|) |c_~#gl_list~0.base|) (= (select v_DerPreprocessor_7 .cse4) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_ArrVal_1450 Int) (v_ArrVal_1444 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (and (= .cse3 (store (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base| v_DerPreprocessor_6) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_5) |c_~#gl_list~0.base| v_DerPreprocessor_6) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1444) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_1450)) (= 4 (select v_DerPreprocessor_6 .cse4))))) (and (exists ((v_ArrVal_1447 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (and (= (select v_DerPreprocessor_7 |c_~#gl_list~0.offset|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= .cse6 (store (select (store (store (store (store |c_#memory_$Pointer$.base| |c_~#gl_list~0.base| v_DerPreprocessor_7) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_8) |c_~#gl_list~0.base| v_DerPreprocessor_7) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1447) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select v_DerPreprocessor_7 .cse4) |c_~#gl_list~0.base|))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_ArrVal_1450 Int) (v_ArrVal_1444 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (and (= 4 (select v_DerPreprocessor_6 |c_~#gl_list~0.offset|)) (= .cse3 (store (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base| v_DerPreprocessor_6) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_5) |c_~#gl_list~0.base| v_DerPreprocessor_6) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1444) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_1450))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_ArrVal_1450 Int) (v_ArrVal_1444 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (and (exists ((|list_add___list_add_~next#1.offset| Int)) (let ((.cse7 (+ |list_add___list_add_~next#1.offset| 4))) (and (= 4 (select v_DerPreprocessor_6 .cse7)) (exists ((v_ArrVal_1447 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (and (= (select v_DerPreprocessor_7 .cse7) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= .cse6 (store (select (store (store (store (store |c_#memory_$Pointer$.base| |c_~#gl_list~0.base| v_DerPreprocessor_7) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_8) |c_~#gl_list~0.base| v_DerPreprocessor_7) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1447) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select v_DerPreprocessor_7 .cse4) |c_~#gl_list~0.base|) (= (select v_DerPreprocessor_7 |c_~#gl_list~0.offset|) |c_~#gl_list~0.base|)))))) (= .cse3 (store (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base| v_DerPreprocessor_6) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_5) |c_~#gl_list~0.base| v_DerPreprocessor_6) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1444) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_1450))))) (not (= 0 .cse5)) (= .cse1 1) (not (= |c_~#gl_list~0.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= 0 |c_ULTIMATE.start_gl_insert_~node~1#1.offset|) (= |c_~#gl_list~0.offset| 0)))) is different from true [2023-02-15 19:27:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:15,934 INFO L93 Difference]: Finished difference Result 396 states and 469 transitions. [2023-02-15 19:27:15,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 19:27:15,935 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 19 states have internal predecessors, (73), 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 [2023-02-15 19:27:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:15,937 INFO L225 Difference]: With dead ends: 396 [2023-02-15 19:27:15,937 INFO L226 Difference]: Without dead ends: 393 [2023-02-15 19:27:15,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=368, Invalid=2267, Unknown=21, NotChecked=100, Total=2756 [2023-02-15 19:27:15,938 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1490 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 2532 mSolverCounterSat, 271 mSolverCounterUnsat, 99 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 2903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2532 IncrementalHoareTripleChecker+Invalid, 99 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:15,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 685 Invalid, 2903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 2532 Invalid, 99 Unknown, 1 Unchecked, 2.0s Time] [2023-02-15 19:27:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2023-02-15 19:27:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 351. [2023-02-15 19:27:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 306 states have (on average 1.2058823529411764) internal successors, (369), 322 states have internal predecessors, (369), 34 states have call successors, (34), 12 states have call predecessors, (34), 10 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-15 19:27:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 419 transitions. [2023-02-15 19:27:15,995 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 419 transitions. Word has length 43 [2023-02-15 19:27:15,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:15,995 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 419 transitions. [2023-02-15 19:27:15,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 19 states have internal predecessors, (73), 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) [2023-02-15 19:27:15,995 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 419 transitions. [2023-02-15 19:27:15,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 19:27:15,996 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:15,996 INFO L195 NwaCegarLoop]: 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] [2023-02-15 19:27:16,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 19:27:16,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-15 19:27:16,202 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:16,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:16,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2001574846, now seen corresponding path program 1 times [2023-02-15 19:27:16,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:16,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215316530] [2023-02-15 19:27:16,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:16,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 19:27:16,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 19:27:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 19:27:16,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 19:27:16,273 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 19:27:16,274 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 19:27:16,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 19:27:16,278 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:27:16,280 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 19:27:16,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 07:27:16 BoogieIcfgContainer [2023-02-15 19:27:16,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 19:27:16,318 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 19:27:16,318 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 19:27:16,318 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 19:27:16,319 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:26:43" (3/4) ... [2023-02-15 19:27:16,320 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 19:27:16,353 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 19:27:16,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 19:27:16,353 INFO L158 Benchmark]: Toolchain (without parser) took 33795.34ms. Allocated memory was 123.7MB in the beginning and 436.2MB in the end (delta: 312.5MB). Free memory was 76.0MB in the beginning and 188.3MB in the end (delta: -112.4MB). Peak memory consumption was 201.9MB. Max. memory is 16.1GB. [2023-02-15 19:27:16,354 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 123.7MB. Free memory was 93.4MB in the beginning and 93.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 19:27:16,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 587.76ms. Allocated memory is still 123.7MB. Free memory was 76.0MB in the beginning and 49.6MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-02-15 19:27:16,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.81ms. Allocated memory is still 123.7MB. Free memory was 49.2MB in the beginning and 46.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 19:27:16,354 INFO L158 Benchmark]: Boogie Preprocessor took 37.25ms. Allocated memory is still 123.7MB. Free memory was 46.9MB in the beginning and 44.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 19:27:16,355 INFO L158 Benchmark]: RCFGBuilder took 649.87ms. Allocated memory was 123.7MB in the beginning and 161.5MB in the end (delta: 37.7MB). Free memory was 44.2MB in the beginning and 111.3MB in the end (delta: -67.1MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2023-02-15 19:27:16,355 INFO L158 Benchmark]: TraceAbstraction took 32433.84ms. Allocated memory was 161.5MB in the beginning and 436.2MB in the end (delta: 274.7MB). Free memory was 111.3MB in the beginning and 191.5MB in the end (delta: -80.2MB). Peak memory consumption was 195.3MB. Max. memory is 16.1GB. [2023-02-15 19:27:16,355 INFO L158 Benchmark]: Witness Printer took 35.05ms. Allocated memory is still 436.2MB. Free memory was 191.5MB in the beginning and 188.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 19:27:16,356 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.18ms. Allocated memory is still 123.7MB. Free memory was 93.4MB in the beginning and 93.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 587.76ms. Allocated memory is still 123.7MB. Free memory was 76.0MB in the beginning and 49.6MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.81ms. Allocated memory is still 123.7MB. Free memory was 49.2MB in the beginning and 46.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.25ms. Allocated memory is still 123.7MB. Free memory was 46.9MB in the beginning and 44.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 649.87ms. Allocated memory was 123.7MB in the beginning and 161.5MB in the end (delta: 37.7MB). Free memory was 44.2MB in the beginning and 111.3MB in the end (delta: -67.1MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * TraceAbstraction took 32433.84ms. Allocated memory was 161.5MB in the beginning and 436.2MB in the end (delta: 274.7MB). Free memory was 111.3MB in the beginning and 191.5MB in the end (delta: -80.2MB). Peak memory consumption was 195.3MB. Max. memory is 16.1GB. * Witness Printer took 35.05ms. Allocated memory is still 436.2MB. Free memory was 191.5MB in the beginning and 188.3MB 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)=-1, gl_list={3:0}, node={5:0}, value=-1] [L902] node->value = value VAL [\old(value)=-1, gl_list={3:0}, node={5:0}, value=-1] [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={5:4}, new={5: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)=-1, gl_list={3:0}, node={5:0}, value=-1] [L904] (&node->nested)->next = (&node->nested) [L904] (&node->nested)->next = (&node->nested) VAL [\old(value)=-1, gl_list={3:0}, node={5:0}, value=-1] [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={5:4}] [L854] COND FALSE !(!(head->next != head)) [L855] EXPR head->prev VAL [gl_list={3:0}, head={3:0}, head={3:0}, head->prev={5: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={5:4}, head={3:0}] [L858] EXPR head->next VAL [gl_list={3:0}, head={3:0}, head={5:4}, head->next={3:0}] [L858] COND FALSE !(!(head->next != head)) [L859] EXPR head->prev VAL [gl_list={3:0}, head={3:0}, head={5:4}, 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={5:4}, node={5:0}] [L861] COND FALSE !(!(node)) VAL [gl_list={3:0}, head={5:4}, head={3:0}, node={5:0}] [L862] EXPR node->nested.next VAL [gl_list={3:0}, head={3:0}, head={5:4}, node={5:0}, node->nested.next={5:12}] [L862] COND FALSE !(!(node->nested.next == &node->nested)) [L863] EXPR node->nested.prev VAL [gl_list={3:0}, head={5:4}, head={3:0}, node={5:0}, node->nested.prev={51:52}] [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: 32.3s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 100 mSolverCounterUnknown, 6061 SdHoareTripleChecker+Valid, 9.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6033 mSDsluCounter, 3106 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1 IncrementalHoareTripleChecker+Unchecked, 2624 mSDsCounter, 975 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11809 IncrementalHoareTripleChecker+Invalid, 12885 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 975 mSolverCounterUnsat, 482 mSDtfsCounter, 11809 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 236 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=11, InterpolantAutomatonStates: 160, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 265 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 414 ConstructedInterpolants, 14 QuantifiedInterpolants, 24309 SizeOfPredicates, 83 NumberOfNonLiveVariables, 838 ConjunctsInSsa, 299 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! [2023-02-15 19:27:16,379 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