./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/forester-heap/dll-01-1.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/forester-heap/dll-01-1.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 --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 dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:33:59,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:33:59,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 21:33:59,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:33:59,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:33:59,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:33:59,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:33:59,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:33:59,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:33:59,649 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:33:59,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:33:59,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:33:59,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:33:59,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:33:59,653 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:33:59,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:33:59,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:33:59,654 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 21:33:59,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 21:33:59,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 21:33:59,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:33:59,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:33:59,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:33:59,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:33:59,656 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 21:33:59,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:33:59,656 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:33:59,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:33:59,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:33:59,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:33:59,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:33:59,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:33:59,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:33:59,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:33:59,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:33:59,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 21:33:59,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 21:33:59,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:33:59,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:33:59,660 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:33:59,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:33:59,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:33:59,661 INFO L153 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 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 -> dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 21:33:59,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:33:59,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:33:59,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:33:59,968 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:33:59,969 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:33:59,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-1.i [2023-11-22 21:34:01,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:34:01,367 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:34:01,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i [2023-11-22 21:34:01,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/527343240/88badb0b4ee84cfe96fb2d02db549fda/FLAG3c06562a4 [2023-11-22 21:34:01,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/527343240/88badb0b4ee84cfe96fb2d02db549fda [2023-11-22 21:34:01,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:34:01,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:34:01,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:34:01,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:34:01,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:34:01,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:34:01" (1/1) ... [2023-11-22 21:34:01,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc459e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:01, skipping insertion in model container [2023-11-22 21:34:01,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:34:01" (1/1) ... [2023-11-22 21:34:01,449 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:34:01,750 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22080,22093] [2023-11-22 21:34:01,768 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22353,22366] [2023-11-22 21:34:01,773 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22587,22600] [2023-11-22 21:34:01,773 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22657,22670] [2023-11-22 21:34:01,779 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22924,22937] [2023-11-22 21:34:01,781 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23032,23045] [2023-11-22 21:34:01,783 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23263,23276] [2023-11-22 21:34:01,785 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23343,23356] [2023-11-22 21:34:01,786 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23422,23435] [2023-11-22 21:34:01,787 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23512,23525] [2023-11-22 21:34:01,788 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23690,23703] [2023-11-22 21:34:01,789 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23768,23781] [2023-11-22 21:34:01,790 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23845,23858] [2023-11-22 21:34:01,793 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:34:01,804 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:34:01,828 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22080,22093] [2023-11-22 21:34:01,830 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22353,22366] [2023-11-22 21:34:01,835 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22587,22600] [2023-11-22 21:34:01,836 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22657,22670] [2023-11-22 21:34:01,839 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22924,22937] [2023-11-22 21:34:01,840 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23032,23045] [2023-11-22 21:34:01,841 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23263,23276] [2023-11-22 21:34:01,842 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23343,23356] [2023-11-22 21:34:01,843 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23422,23435] [2023-11-22 21:34:01,843 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23512,23525] [2023-11-22 21:34:01,845 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23690,23703] [2023-11-22 21:34:01,845 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23768,23781] [2023-11-22 21:34:01,846 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23845,23858] [2023-11-22 21:34:01,848 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:34:01,870 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:34:01,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:01 WrapperNode [2023-11-22 21:34:01,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:34:01,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:34:01,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:34:01,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:34:01,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:01" (1/1) ... [2023-11-22 21:34:01,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:01" (1/1) ... [2023-11-22 21:34:01,919 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 228 [2023-11-22 21:34:01,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:34:01,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:34:01,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:34:01,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:34:01,930 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:01" (1/1) ... [2023-11-22 21:34:01,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:01" (1/1) ... [2023-11-22 21:34:01,934 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:01" (1/1) ... [2023-11-22 21:34:01,955 INFO L189 HeapSplitter]: Split 34 memory accesses to 2 slices as follows [2, 32] [2023-11-22 21:34:01,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:01" (1/1) ... [2023-11-22 21:34:01,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:01" (1/1) ... [2023-11-22 21:34:01,971 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:01" (1/1) ... [2023-11-22 21:34:01,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:01" (1/1) ... [2023-11-22 21:34:01,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:01" (1/1) ... [2023-11-22 21:34:01,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:01" (1/1) ... [2023-11-22 21:34:01,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:34:01,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:34:01,982 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:34:01,982 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:34:01,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:01" (1/1) ... [2023-11-22 21:34:01,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:34:02,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:34:02,021 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-11-22 21:34:02,027 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-11-22 21:34:02,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 21:34:02,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:34:02,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-22 21:34:02,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-22 21:34:02,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-22 21:34:02,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-22 21:34:02,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 21:34:02,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 21:34:02,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-22 21:34:02,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:34:02,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:34:02,171 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:34:02,172 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:34:02,482 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:34:02,505 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:34:02,506 INFO L309 CfgBuilder]: Removed 30 assume(true) statements. [2023-11-22 21:34:02,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:34:02 BoogieIcfgContainer [2023-11-22 21:34:02,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:34:02,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:34:02,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:34:02,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:34:02,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:34:01" (1/3) ... [2023-11-22 21:34:02,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@919b74b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:34:02, skipping insertion in model container [2023-11-22 21:34:02,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:01" (2/3) ... [2023-11-22 21:34:02,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@919b74b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:34:02, skipping insertion in model container [2023-11-22 21:34:02,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:34:02" (3/3) ... [2023-11-22 21:34:02,514 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2023-11-22 21:34:02,529 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:34:02,530 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2023-11-22 21:34:02,570 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:34:02,576 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=LoopHeads, 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;@9141761, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:34:02,576 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-22 21:34:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:02,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-22 21:34:02,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:02,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-22 21:34:02,588 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-11-22 21:34:02,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:02,593 INFO L85 PathProgramCache]: Analyzing trace with hash 348139, now seen corresponding path program 1 times [2023-11-22 21:34:02,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:02,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992075468] [2023-11-22 21:34:02,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:02,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:34:02,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:34:02,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992075468] [2023-11-22 21:34:02,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992075468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:02,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:34:02,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 21:34:02,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645259105] [2023-11-22 21:34:02,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:02,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:34:02,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:02,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:34:02,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:34:02,858 INFO L87 Difference]: Start difference. First operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:02,957 INFO L93 Difference]: Finished difference Result 175 states and 291 transitions. [2023-11-22 21:34:02,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:34:02,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-22 21:34:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:02,969 INFO L225 Difference]: With dead ends: 175 [2023-11-22 21:34:02,969 INFO L226 Difference]: Without dead ends: 94 [2023-11-22 21:34:02,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:34:02,977 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 83 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:02,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 93 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:34:02,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-22 21:34:03,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2023-11-22 21:34:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.328125) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-11-22 21:34:03,020 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 3 [2023-11-22 21:34:03,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:03,021 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-11-22 21:34:03,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:03,022 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-11-22 21:34:03,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-22 21:34:03,023 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:03,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:34:03,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 21:34:03,023 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-11-22 21:34:03,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:03,025 INFO L85 PathProgramCache]: Analyzing trace with hash -85138699, now seen corresponding path program 1 times [2023-11-22 21:34:03,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:03,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567672414] [2023-11-22 21:34:03,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:03,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:34:03,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:34:03,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567672414] [2023-11-22 21:34:03,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567672414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:03,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:34:03,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:34:03,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713908958] [2023-11-22 21:34:03,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:03,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:34:03,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:03,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:34:03,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:34:03,239 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:03,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:03,355 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2023-11-22 21:34:03,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:34:03,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-22 21:34:03,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:03,357 INFO L225 Difference]: With dead ends: 200 [2023-11-22 21:34:03,357 INFO L226 Difference]: Without dead ends: 131 [2023-11-22 21:34:03,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:34:03,359 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 58 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:03,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 200 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:34:03,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-22 21:34:03,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 78. [2023-11-22 21:34:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 77 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2023-11-22 21:34:03,370 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 9 [2023-11-22 21:34:03,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:03,370 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2023-11-22 21:34:03,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:03,371 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2023-11-22 21:34:03,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-22 21:34:03,371 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:03,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:34:03,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 21:34:03,372 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-11-22 21:34:03,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:03,373 INFO L85 PathProgramCache]: Analyzing trace with hash -85136777, now seen corresponding path program 1 times [2023-11-22 21:34:03,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:03,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561768904] [2023-11-22 21:34:03,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:03,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:34:03,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:34:03,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561768904] [2023-11-22 21:34:03,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561768904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:03,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:34:03,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:34:03,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340592758] [2023-11-22 21:34:03,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:03,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:34:03,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:03,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:34:03,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:34:03,563 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:03,682 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2023-11-22 21:34:03,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 21:34:03,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-22 21:34:03,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:03,687 INFO L225 Difference]: With dead ends: 132 [2023-11-22 21:34:03,687 INFO L226 Difference]: Without dead ends: 130 [2023-11-22 21:34:03,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:34:03,690 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 55 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:03,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 198 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:34:03,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-22 21:34:03,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 79. [2023-11-22 21:34:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 78 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2023-11-22 21:34:03,713 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 9 [2023-11-22 21:34:03,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:03,713 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2023-11-22 21:34:03,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:03,713 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2023-11-22 21:34:03,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-22 21:34:03,714 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:03,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:34:03,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 21:34:03,716 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-11-22 21:34:03,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:03,718 INFO L85 PathProgramCache]: Analyzing trace with hash -83289735, now seen corresponding path program 1 times [2023-11-22 21:34:03,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:03,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595146687] [2023-11-22 21:34:03,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:03,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:34:03,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:34:03,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595146687] [2023-11-22 21:34:03,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595146687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:03,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:34:03,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:34:03,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941757484] [2023-11-22 21:34:03,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:03,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:34:03,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:03,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:34:03,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:34:03,898 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:03,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:03,945 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2023-11-22 21:34:03,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:34:03,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-22 21:34:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:03,946 INFO L225 Difference]: With dead ends: 79 [2023-11-22 21:34:03,946 INFO L226 Difference]: Without dead ends: 77 [2023-11-22 21:34:03,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:34:03,948 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:03,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 138 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:34:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-22 21:34:03,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2023-11-22 21:34:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-11-22 21:34:03,954 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 9 [2023-11-22 21:34:03,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:03,955 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-11-22 21:34:03,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:03,955 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-11-22 21:34:03,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-22 21:34:03,956 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:03,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:34:03,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 21:34:03,956 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-11-22 21:34:03,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:03,957 INFO L85 PathProgramCache]: Analyzing trace with hash -198671904, now seen corresponding path program 1 times [2023-11-22 21:34:03,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:03,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336462859] [2023-11-22 21:34:03,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:03,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:34:04,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:34:04,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336462859] [2023-11-22 21:34:04,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336462859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:04,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:34:04,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:34:04,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982241349] [2023-11-22 21:34:04,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:04,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:34:04,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:04,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:34:04,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:34:04,135 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:04,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:04,236 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2023-11-22 21:34:04,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 21:34:04,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-22 21:34:04,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:04,238 INFO L225 Difference]: With dead ends: 121 [2023-11-22 21:34:04,238 INFO L226 Difference]: Without dead ends: 117 [2023-11-22 21:34:04,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:34:04,239 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 151 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:04,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 154 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:34:04,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-22 21:34:04,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 72. [2023-11-22 21:34:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2023-11-22 21:34:04,247 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 14 [2023-11-22 21:34:04,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:04,248 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2023-11-22 21:34:04,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2023-11-22 21:34:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-22 21:34:04,252 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:04,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:34:04,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 21:34:04,252 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-11-22 21:34:04,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:04,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1863857528, now seen corresponding path program 1 times [2023-11-22 21:34:04,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:04,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858149743] [2023-11-22 21:34:04,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:04,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:04,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:34:04,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:34:04,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858149743] [2023-11-22 21:34:04,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858149743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:04,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:34:04,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:34:04,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167547770] [2023-11-22 21:34:04,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:04,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:34:04,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:04,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:34:04,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:34:04,319 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:04,386 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2023-11-22 21:34:04,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:34:04,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-22 21:34:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:04,387 INFO L225 Difference]: With dead ends: 131 [2023-11-22 21:34:04,387 INFO L226 Difference]: Without dead ends: 111 [2023-11-22 21:34:04,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:34:04,392 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 131 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:04,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 112 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:34:04,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-22 21:34:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 71. [2023-11-22 21:34:04,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2023-11-22 21:34:04,410 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 15 [2023-11-22 21:34:04,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:04,410 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2023-11-22 21:34:04,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:04,411 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2023-11-22 21:34:04,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 21:34:04,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:04,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:34:04,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 21:34:04,412 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-11-22 21:34:04,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:04,412 INFO L85 PathProgramCache]: Analyzing trace with hash -219174669, now seen corresponding path program 1 times [2023-11-22 21:34:04,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:04,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094890916] [2023-11-22 21:34:04,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:04,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:34:04,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:34:04,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094890916] [2023-11-22 21:34:04,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094890916] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:04,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:34:04,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:34:04,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222931443] [2023-11-22 21:34:04,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:04,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:34:04,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:04,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:34:04,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:34:04,454 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:04,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:04,470 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2023-11-22 21:34:04,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:34:04,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-22 21:34:04,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:04,472 INFO L225 Difference]: With dead ends: 117 [2023-11-22 21:34:04,472 INFO L226 Difference]: Without dead ends: 76 [2023-11-22 21:34:04,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:34:04,473 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:04,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 144 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:34:04,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-22 21:34:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2023-11-22 21:34:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 73 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2023-11-22 21:34:04,486 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 19 [2023-11-22 21:34:04,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:04,487 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2023-11-22 21:34:04,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2023-11-22 21:34:04,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-22 21:34:04,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:04,488 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] [2023-11-22 21:34:04,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-22 21:34:04,488 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-11-22 21:34:04,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:04,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1795515351, now seen corresponding path program 1 times [2023-11-22 21:34:04,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:04,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487511520] [2023-11-22 21:34:04,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:04,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:34:04,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:34:04,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487511520] [2023-11-22 21:34:04,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487511520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:04,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:34:04,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:34:04,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482335354] [2023-11-22 21:34:04,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:04,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:34:04,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:04,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:34:04,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:34:04,531 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:04,549 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2023-11-22 21:34:04,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:34:04,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-22 21:34:04,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:04,550 INFO L225 Difference]: With dead ends: 74 [2023-11-22 21:34:04,550 INFO L226 Difference]: Without dead ends: 72 [2023-11-22 21:34:04,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:34:04,552 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 13 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:04,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 125 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:34:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-22 21:34:04,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-22 21:34:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 71 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2023-11-22 21:34:04,562 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 20 [2023-11-22 21:34:04,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:04,562 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2023-11-22 21:34:04,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:04,563 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2023-11-22 21:34:04,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-22 21:34:04,563 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:04,564 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] [2023-11-22 21:34:04,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-22 21:34:04,565 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-11-22 21:34:04,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:04,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1692801264, now seen corresponding path program 1 times [2023-11-22 21:34:04,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:04,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645228119] [2023-11-22 21:34:04,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:04,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:34:04,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:34:04,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645228119] [2023-11-22 21:34:04,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645228119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:04,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:34:04,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:34:04,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98797678] [2023-11-22 21:34:04,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:04,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:34:04,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:04,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:34:04,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:34:04,709 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:04,767 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2023-11-22 21:34:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:34:04,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-22 21:34:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:04,768 INFO L225 Difference]: With dead ends: 73 [2023-11-22 21:34:04,768 INFO L226 Difference]: Without dead ends: 71 [2023-11-22 21:34:04,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:34:04,770 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:04,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:34:04,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-22 21:34:04,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2023-11-22 21:34:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 64 states have (on average 1.25) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2023-11-22 21:34:04,778 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 22 [2023-11-22 21:34:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:04,778 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2023-11-22 21:34:04,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2023-11-22 21:34:04,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 21:34:04,780 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:04,780 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] [2023-11-22 21:34:04,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-22 21:34:04,780 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-11-22 21:34:04,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:04,781 INFO L85 PathProgramCache]: Analyzing trace with hash 679211624, now seen corresponding path program 1 times [2023-11-22 21:34:04,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:04,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156943911] [2023-11-22 21:34:04,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:04,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:34:04,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:34:04,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156943911] [2023-11-22 21:34:04,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156943911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:04,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:34:04,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 21:34:04,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716819201] [2023-11-22 21:34:04,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:04,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:34:04,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:04,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:34:04,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:34:04,975 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:05,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:05,147 INFO L93 Difference]: Finished difference Result 174 states and 198 transitions. [2023-11-22 21:34:05,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 21:34:05,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-22 21:34:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:05,148 INFO L225 Difference]: With dead ends: 174 [2023-11-22 21:34:05,148 INFO L226 Difference]: Without dead ends: 132 [2023-11-22 21:34:05,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-22 21:34:05,152 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 70 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:05,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 245 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:34:05,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-22 21:34:05,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 80. [2023-11-22 21:34:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 79 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2023-11-22 21:34:05,163 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 23 [2023-11-22 21:34:05,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:05,164 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2023-11-22 21:34:05,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2023-11-22 21:34:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 21:34:05,168 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:05,168 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] [2023-11-22 21:34:05,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-22 21:34:05,168 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-11-22 21:34:05,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:05,169 INFO L85 PathProgramCache]: Analyzing trace with hash 578615784, now seen corresponding path program 1 times [2023-11-22 21:34:05,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:05,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993153383] [2023-11-22 21:34:05,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:05,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:34:05,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:34:05,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993153383] [2023-11-22 21:34:05,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993153383] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:05,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:34:05,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:34:05,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809297877] [2023-11-22 21:34:05,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:05,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 21:34:05,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:05,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 21:34:05,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:34:05,682 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:06,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:06,024 INFO L93 Difference]: Finished difference Result 185 states and 206 transitions. [2023-11-22 21:34:06,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 21:34:06,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-22 21:34:06,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:06,027 INFO L225 Difference]: With dead ends: 185 [2023-11-22 21:34:06,027 INFO L226 Difference]: Without dead ends: 183 [2023-11-22 21:34:06,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:34:06,028 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 198 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:06,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 385 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 21:34:06,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-11-22 21:34:06,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 92. [2023-11-22 21:34:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 91 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2023-11-22 21:34:06,046 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 23 [2023-11-22 21:34:06,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:06,046 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2023-11-22 21:34:06,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2023-11-22 21:34:06,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 21:34:06,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:06,047 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] [2023-11-22 21:34:06,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-22 21:34:06,047 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-11-22 21:34:06,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:06,048 INFO L85 PathProgramCache]: Analyzing trace with hash -751953218, now seen corresponding path program 1 times [2023-11-22 21:34:06,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:06,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347927270] [2023-11-22 21:34:06,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:06,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 21:34:06,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:34:06,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347927270] [2023-11-22 21:34:06,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347927270] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:06,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:34:06,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:34:06,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074973774] [2023-11-22 21:34:06,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:06,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:34:06,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:06,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:34:06,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:34:06,147 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:06,256 INFO L93 Difference]: Finished difference Result 138 states and 157 transitions. [2023-11-22 21:34:06,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 21:34:06,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-22 21:34:06,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:06,258 INFO L225 Difference]: With dead ends: 138 [2023-11-22 21:34:06,258 INFO L226 Difference]: Without dead ends: 120 [2023-11-22 21:34:06,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:34:06,259 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 22 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:06,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 186 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:34:06,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-22 21:34:06,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2023-11-22 21:34:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 106 states have (on average 1.2452830188679245) internal successors, (132), 111 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2023-11-22 21:34:06,281 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 25 [2023-11-22 21:34:06,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:06,282 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2023-11-22 21:34:06,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:06,282 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2023-11-22 21:34:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 21:34:06,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:06,284 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] [2023-11-22 21:34:06,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-22 21:34:06,285 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-11-22 21:34:06,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:06,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1359692350, now seen corresponding path program 1 times [2023-11-22 21:34:06,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:06,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190745895] [2023-11-22 21:34:06,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:06,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:34:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 21:34:06,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:34:06,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190745895] [2023-11-22 21:34:06,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190745895] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:34:06,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:34:06,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:34:06,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37245240] [2023-11-22 21:34:06,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:34:06,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:34:06,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:34:06,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:34:06,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:34:06,330 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:06,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:34:06,379 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2023-11-22 21:34:06,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:34:06,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-22 21:34:06,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:34:06,381 INFO L225 Difference]: With dead ends: 112 [2023-11-22 21:34:06,381 INFO L226 Difference]: Without dead ends: 110 [2023-11-22 21:34:06,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:34:06,382 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 49 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:34:06,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 73 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:34:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-22 21:34:06,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-11-22 21:34:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 109 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2023-11-22 21:34:06,403 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 25 [2023-11-22 21:34:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:34:06,405 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2023-11-22 21:34:06,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 21:34:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2023-11-22 21:34:06,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 21:34:06,407 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:34:06,407 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] [2023-11-22 21:34:06,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-22 21:34:06,408 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-11-22 21:34:06,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:34:06,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1843174537, now seen corresponding path program 1 times [2023-11-22 21:34:06,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:34:06,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883592515] [2023-11-22 21:34:06,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:34:06,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:34:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 21:34:06,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 21:34:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 21:34:06,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 21:34:06,480 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 21:34:06,481 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2023-11-22 21:34:06,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2023-11-22 21:34:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2023-11-22 21:34:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2023-11-22 21:34:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2023-11-22 21:34:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2023-11-22 21:34:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2023-11-22 21:34:06,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2023-11-22 21:34:06,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2023-11-22 21:34:06,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2023-11-22 21:34:06,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2023-11-22 21:34:06,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2023-11-22 21:34:06,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2023-11-22 21:34:06,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-22 21:34:06,488 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:34:06,492 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 21:34:06,510 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem6 [2023-11-22 21:34:06,512 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short8 could not be translated [2023-11-22 21:34:06,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:34:06 BoogieIcfgContainer [2023-11-22 21:34:06,525 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 21:34:06,525 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 21:34:06,525 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 21:34:06,526 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 21:34:06,526 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:34:02" (3/4) ... [2023-11-22 21:34:06,527 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-22 21:34:06,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem6 [2023-11-22 21:34:06,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short8 could not be translated [2023-11-22 21:34:06,558 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 21:34:06,558 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 21:34:06,559 INFO L158 Benchmark]: Toolchain (without parser) took 5163.64ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 104.6MB in the beginning and 59.9MB in the end (delta: 44.7MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. [2023-11-22 21:34:06,559 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 21:34:06,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.11ms. Allocated memory is still 146.8MB. Free memory was 104.2MB in the beginning and 84.0MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-22 21:34:06,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.74ms. Allocated memory is still 146.8MB. Free memory was 84.0MB in the beginning and 81.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:34:06,560 INFO L158 Benchmark]: Boogie Preprocessor took 60.71ms. Allocated memory is still 146.8MB. Free memory was 81.6MB in the beginning and 78.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:34:06,560 INFO L158 Benchmark]: RCFGBuilder took 524.90ms. Allocated memory is still 146.8MB. Free memory was 78.3MB in the beginning and 102.2MB in the end (delta: -23.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-22 21:34:06,560 INFO L158 Benchmark]: TraceAbstraction took 4016.89ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 101.0MB in the beginning and 62.0MB in the end (delta: 39.0MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. [2023-11-22 21:34:06,561 INFO L158 Benchmark]: Witness Printer took 32.90ms. Allocated memory is still 192.9MB. Free memory was 62.0MB in the beginning and 59.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:34:06,562 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.11ms. Allocated memory is still 146.8MB. Free memory was 104.2MB in the beginning and 84.0MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.74ms. Allocated memory is still 146.8MB. Free memory was 84.0MB in the beginning and 81.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.71ms. Allocated memory is still 146.8MB. Free memory was 81.6MB in the beginning and 78.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 524.90ms. Allocated memory is still 146.8MB. Free memory was 78.3MB in the beginning and 102.2MB in the end (delta: -23.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4016.89ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 101.0MB in the beginning and 62.0MB in the end (delta: 39.0MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. * Witness Printer took 32.90ms. Allocated memory is still 192.9MB. Free memory was 62.0MB in the beginning and 59.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short8 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short8 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 1040]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1003] SLL* list = malloc(sizeof(SLL)); [L1004] list->next = ((void*)0) [L1005] list->prev = ((void*)0) [L1006] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1006] list->inner = malloc(sizeof(SLL)) [L1006] EXPR list->inner [L1006] list->inner->next = ((void*)0) [L1006] EXPR list->inner [L1006] list->inner->inner = ((void*)0) [L1006] EXPR list->inner [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}] [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L1006] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1008] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1022] end = ((void*)0) [L1023] end = list VAL [end={-1:0}, list={-1:0}] [L1026] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1028] COND TRUE ((void*)0) != end [L1030] int len = 0; [L1031] EXPR end->inner [L1031] SLL* inner = end->inner; [L1032] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1034] COND TRUE len == 0 [L1035] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1039] EXPR inner->inner [L1039] COND FALSE !(!(((void*)0) == inner->inner)) [L1040] EXPR inner->next [L1040] COND TRUE !(((void*)0) != inner->next) [L1040] reach_error() VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] - UnprovableResult [Line: 1006]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 834 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 834 mSDsluCounter, 2230 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1322 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 696 IncrementalHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 908 mSDtfsCounter, 696 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=12, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 362 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 1415 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2/2 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-11-22 21:34:06,589 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