./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:04:03,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:04:03,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:04:03,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:04:03,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:04:03,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:04:03,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:04:03,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:04:03,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:04:03,541 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:04:03,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:04:03,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:04:03,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:04:03,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:04:03,543 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:04:03,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:04:03,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:04:03,544 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:04:03,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:04:03,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:04:03,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:04:03,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:04:03,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:04:03,550 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:04:03,550 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:04:03,550 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:04:03,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:04:03,551 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:04:03,551 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:04:03,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:04:03,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:04:03,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:04:03,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:04:03,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:04:03,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:04:03,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:04:03,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:04:03,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:04:03,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:04:03,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:04:03,554 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:04:03,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:04:03,554 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 -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2024-11-09 22:04:03,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:04:03,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:04:03,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:04:03,789 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:04:03,790 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:04:03,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-2.i [2024-11-09 22:04:05,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:04:05,280 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:04:05,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2024-11-09 22:04:05,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9314535f/818dca3d0afe4141bf99e0e386bbbc5a/FLAG7593e573f [2024-11-09 22:04:05,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9314535f/818dca3d0afe4141bf99e0e386bbbc5a [2024-11-09 22:04:05,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:04:05,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:04:05,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:04:05,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:04:05,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:04:05,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:04:05" (1/1) ... [2024-11-09 22:04:05,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761b3184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:05, skipping insertion in model container [2024-11-09 22:04:05,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:04:05" (1/1) ... [2024-11-09 22:04:05,664 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:04:05,899 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2024-11-09 22:04:05,906 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2024-11-09 22:04:05,908 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2024-11-09 22:04:05,909 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2024-11-09 22:04:05,911 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2024-11-09 22:04:05,912 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2024-11-09 22:04:05,914 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2024-11-09 22:04:05,914 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2024-11-09 22:04:05,915 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2024-11-09 22:04:05,916 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2024-11-09 22:04:05,917 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2024-11-09 22:04:05,918 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2024-11-09 22:04:05,919 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2024-11-09 22:04:05,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:04:05,928 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:04:05,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2024-11-09 22:04:05,961 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2024-11-09 22:04:05,965 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2024-11-09 22:04:05,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2024-11-09 22:04:05,968 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2024-11-09 22:04:05,969 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2024-11-09 22:04:05,972 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2024-11-09 22:04:05,975 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2024-11-09 22:04:05,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2024-11-09 22:04:05,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2024-11-09 22:04:05,980 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2024-11-09 22:04:05,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2024-11-09 22:04:05,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2024-11-09 22:04:05,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:04:06,041 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:04:06,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:06 WrapperNode [2024-11-09 22:04:06,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:04:06,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:04:06,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:04:06,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:04:06,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:06" (1/1) ... [2024-11-09 22:04:06,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:06" (1/1) ... [2024-11-09 22:04:06,092 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 210 [2024-11-09 22:04:06,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:04:06,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:04:06,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:04:06,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:04:06,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:06" (1/1) ... [2024-11-09 22:04:06,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:06" (1/1) ... [2024-11-09 22:04:06,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:06" (1/1) ... [2024-11-09 22:04:06,119 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2024-11-09 22:04:06,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:06" (1/1) ... [2024-11-09 22:04:06,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:06" (1/1) ... [2024-11-09 22:04:06,127 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:06" (1/1) ... [2024-11-09 22:04:06,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:06" (1/1) ... [2024-11-09 22:04:06,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:06" (1/1) ... [2024-11-09 22:04:06,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:06" (1/1) ... [2024-11-09 22:04:06,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:04:06,132 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:04:06,132 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:04:06,133 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:04:06,136 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:06" (1/1) ... [2024-11-09 22:04:06,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:04:06,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:04:06,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 22:04:06,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 22:04:06,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 22:04:06,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:04:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 22:04:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 22:04:06,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 22:04:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 22:04:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 22:04:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:04:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:04:06,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:04:06,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:04:06,317 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:04:06,319 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:04:06,609 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-09 22:04:06,609 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:04:06,620 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:04:06,620 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:04:06,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:04:06 BoogieIcfgContainer [2024-11-09 22:04:06,621 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:04:06,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:04:06,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:04:06,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:04:06,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:04:05" (1/3) ... [2024-11-09 22:04:06,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56134f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:04:06, skipping insertion in model container [2024-11-09 22:04:06,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:04:06" (2/3) ... [2024-11-09 22:04:06,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56134f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:04:06, skipping insertion in model container [2024-11-09 22:04:06,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:04:06" (3/3) ... [2024-11-09 22:04:06,630 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2024-11-09 22:04:06,645 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:04:06,646 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-09 22:04:06,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:04:06,701 INFO L333 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, 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;@51191384, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:04:06,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-09 22:04:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 106 states have internal predecessors, (160), 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) [2024-11-09 22:04:06,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 22:04:06,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:06,710 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 22:04:06,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:06,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:06,715 INFO L85 PathProgramCache]: Analyzing trace with hash 186056641, now seen corresponding path program 1 times [2024-11-09 22:04:06,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:06,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665737127] [2024-11-09 22:04:06,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:06,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:06,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:06,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:06,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665737127] [2024-11-09 22:04:06,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665737127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:06,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:06,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:04:06,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134183818] [2024-11-09 22:04:06,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:06,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:04:06,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:06,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:04:06,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:04:06,904 INFO L87 Difference]: Start difference. First operand has 107 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 106 states have internal predecessors, (160), 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.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-09 22:04:06,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:06,974 INFO L93 Difference]: Finished difference Result 217 states and 335 transitions. [2024-11-09 22:04:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:04:06,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-09 22:04:06,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:06,984 INFO L225 Difference]: With dead ends: 217 [2024-11-09 22:04:06,984 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 22:04:06,987 INFO L431 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 [2024-11-09 22:04:06,991 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 94 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:06,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 115 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:04:07,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 22:04:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2024-11-09 22:04:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 87 states have internal predecessors, (98), 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) [2024-11-09 22:04:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2024-11-09 22:04:07,030 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 5 [2024-11-09 22:04:07,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:07,031 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2024-11-09 22:04:07,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-09 22:04:07,031 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2024-11-09 22:04:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 22:04:07,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:07,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:07,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:04:07,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:07,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:07,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1125819241, now seen corresponding path program 1 times [2024-11-09 22:04:07,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:07,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701325672] [2024-11-09 22:04:07,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:07,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:07,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:07,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701325672] [2024-11-09 22:04:07,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701325672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:07,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:07,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:04:07,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761994785] [2024-11-09 22:04:07,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:07,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:04:07,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:07,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:04:07,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:04:07,232 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2024-11-09 22:04:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:07,304 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2024-11-09 22:04:07,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:04:07,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2024-11-09 22:04:07,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:07,306 INFO L225 Difference]: With dead ends: 89 [2024-11-09 22:04:07,306 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 22:04:07,306 INFO L431 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 [2024-11-09 22:04:07,307 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 164 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:07,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 164 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:04:07,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 22:04:07,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-11-09 22:04:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.28) internal successors, (96), 85 states have internal predecessors, (96), 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) [2024-11-09 22:04:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2024-11-09 22:04:07,321 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 11 [2024-11-09 22:04:07,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:07,321 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2024-11-09 22:04:07,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2024-11-09 22:04:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2024-11-09 22:04:07,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 22:04:07,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:07,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:07,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:04:07,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:07,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:07,323 INFO L85 PathProgramCache]: Analyzing trace with hash 960821322, now seen corresponding path program 1 times [2024-11-09 22:04:07,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:07,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720114680] [2024-11-09 22:04:07,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:07,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:07,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:07,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720114680] [2024-11-09 22:04:07,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720114680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:07,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:07,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:04:07,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181711859] [2024-11-09 22:04:07,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:07,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:04:07,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:07,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:04:07,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:04:07,373 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2024-11-09 22:04:07,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:07,415 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2024-11-09 22:04:07,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:04:07,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2024-11-09 22:04:07,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:07,416 INFO L225 Difference]: With dead ends: 89 [2024-11-09 22:04:07,416 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 22:04:07,417 INFO L431 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 [2024-11-09 22:04:07,417 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 17 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:07,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 148 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:04:07,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 22:04:07,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-09 22:04:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 81 states have internal predecessors, (92), 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) [2024-11-09 22:04:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2024-11-09 22:04:07,425 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 17 [2024-11-09 22:04:07,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:07,426 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2024-11-09 22:04:07,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2024-11-09 22:04:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2024-11-09 22:04:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 22:04:07,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:07,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:07,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:04:07,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:07,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:07,428 INFO L85 PathProgramCache]: Analyzing trace with hash -282111340, now seen corresponding path program 1 times [2024-11-09 22:04:07,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:07,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671367190] [2024-11-09 22:04:07,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:07,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:07,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:07,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671367190] [2024-11-09 22:04:07,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671367190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:07,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:07,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:04:07,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766362710] [2024-11-09 22:04:07,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:07,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:04:07,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:07,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:04:07,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:04:07,519 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2024-11-09 22:04:07,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:07,610 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2024-11-09 22:04:07,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:04:07,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-09 22:04:07,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:07,611 INFO L225 Difference]: With dead ends: 150 [2024-11-09 22:04:07,612 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 22:04:07,613 INFO L431 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 [2024-11-09 22:04:07,614 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 156 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:07,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 139 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:04:07,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 22:04:07,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 82. [2024-11-09 22:04:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 81 states have internal predecessors, (92), 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) [2024-11-09 22:04:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2024-11-09 22:04:07,620 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 18 [2024-11-09 22:04:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:07,620 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2024-11-09 22:04:07,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2024-11-09 22:04:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2024-11-09 22:04:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 22:04:07,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:07,621 INFO L215 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] [2024-11-09 22:04:07,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 22:04:07,622 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:07,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash -959187645, now seen corresponding path program 1 times [2024-11-09 22:04:07,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:07,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552121719] [2024-11-09 22:04:07,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:07,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:07,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:07,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552121719] [2024-11-09 22:04:07,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552121719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:07,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:07,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:04:07,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930515926] [2024-11-09 22:04:07,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:07,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:04:07,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:07,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:04:07,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:04:07,673 INFO L87 Difference]: Start difference. First operand 82 states and 92 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) [2024-11-09 22:04:07,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:07,696 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2024-11-09 22:04:07,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:04:07,697 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 [2024-11-09 22:04:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:07,698 INFO L225 Difference]: With dead ends: 137 [2024-11-09 22:04:07,699 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 22:04:07,699 INFO L431 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 [2024-11-09 22:04:07,700 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:07,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 169 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:04:07,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 22:04:07,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-09 22:04:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.240506329113924) internal successors, (98), 86 states have internal predecessors, (98), 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) [2024-11-09 22:04:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2024-11-09 22:04:07,709 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 25 [2024-11-09 22:04:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:07,709 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2024-11-09 22:04:07,709 INFO L472 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) [2024-11-09 22:04:07,709 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2024-11-09 22:04:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 22:04:07,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:07,711 INFO L215 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] [2024-11-09 22:04:07,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 22:04:07,711 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:07,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:07,711 INFO L85 PathProgramCache]: Analyzing trace with hash 331862698, now seen corresponding path program 1 times [2024-11-09 22:04:07,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:07,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885302274] [2024-11-09 22:04:07,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:07,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:07,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:07,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885302274] [2024-11-09 22:04:07,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885302274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:07,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:07,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:04:07,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357246259] [2024-11-09 22:04:07,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:07,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:04:07,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:07,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:04:07,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:04:07,754 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2024-11-09 22:04:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:07,773 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2024-11-09 22:04:07,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:04:07,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-11-09 22:04:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:07,774 INFO L225 Difference]: With dead ends: 87 [2024-11-09 22:04:07,774 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 22:04:07,775 INFO L431 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 [2024-11-09 22:04:07,775 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 13 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 150 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 [2024-11-09 22:04:07,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 150 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:04:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 22:04:07,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 22:04:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 84 states have internal predecessors, (96), 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) [2024-11-09 22:04:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2024-11-09 22:04:07,788 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 26 [2024-11-09 22:04:07,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:07,788 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2024-11-09 22:04:07,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2024-11-09 22:04:07,788 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2024-11-09 22:04:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 22:04:07,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:07,790 INFO L215 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] [2024-11-09 22:04:07,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 22:04:07,790 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:07,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:07,791 INFO L85 PathProgramCache]: Analyzing trace with hash -84343413, now seen corresponding path program 1 times [2024-11-09 22:04:07,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:07,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200395911] [2024-11-09 22:04:07,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:07,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:07,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:07,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200395911] [2024-11-09 22:04:07,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200395911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:07,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:07,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:04:07,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483067168] [2024-11-09 22:04:07,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:07,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:04:07,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:07,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:04:07,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:04:07,934 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2024-11-09 22:04:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:07,986 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2024-11-09 22:04:07,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:04:07,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2024-11-09 22:04:07,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:07,987 INFO L225 Difference]: With dead ends: 86 [2024-11-09 22:04:07,988 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 22:04:07,989 INFO L431 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 [2024-11-09 22:04:07,989 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 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 [2024-11-09 22:04:07,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:04:07,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 22:04:07,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-11-09 22:04:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 82 states have internal predecessors, (94), 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) [2024-11-09 22:04:07,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2024-11-09 22:04:07,996 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 26 [2024-11-09 22:04:07,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:07,996 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2024-11-09 22:04:07,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2024-11-09 22:04:07,996 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2024-11-09 22:04:07,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 22:04:07,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:07,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:07,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 22:04:07,997 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:07,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:07,997 INFO L85 PathProgramCache]: Analyzing trace with hash -492206465, now seen corresponding path program 1 times [2024-11-09 22:04:07,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:07,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218120177] [2024-11-09 22:04:07,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:07,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:08,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:08,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218120177] [2024-11-09 22:04:08,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218120177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:08,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:08,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 22:04:08,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438558032] [2024-11-09 22:04:08,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:08,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:04:08,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:08,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:04:08,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:04:08,173 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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) [2024-11-09 22:04:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:08,365 INFO L93 Difference]: Finished difference Result 239 states and 269 transitions. [2024-11-09 22:04:08,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 22:04:08,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 29 [2024-11-09 22:04:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:08,366 INFO L225 Difference]: With dead ends: 239 [2024-11-09 22:04:08,368 INFO L226 Difference]: Without dead ends: 188 [2024-11-09 22:04:08,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:04:08,369 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 240 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:08,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 318 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:04:08,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-09 22:04:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 112. [2024-11-09 22:04:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 111 states have internal predecessors, (128), 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) [2024-11-09 22:04:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2024-11-09 22:04:08,385 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 29 [2024-11-09 22:04:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:08,386 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2024-11-09 22:04:08,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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) [2024-11-09 22:04:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2024-11-09 22:04:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 22:04:08,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:08,389 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:08,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 22:04:08,389 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:08,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:08,390 INFO L85 PathProgramCache]: Analyzing trace with hash 963908929, now seen corresponding path program 1 times [2024-11-09 22:04:08,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:08,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573573340] [2024-11-09 22:04:08,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:08,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:08,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:08,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573573340] [2024-11-09 22:04:08,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573573340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:08,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:08,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 22:04:08,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653442231] [2024-11-09 22:04:08,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:08,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:04:08,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:08,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:04:08,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:04:08,961 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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) [2024-11-09 22:04:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:09,318 INFO L93 Difference]: Finished difference Result 264 states and 295 transitions. [2024-11-09 22:04:09,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:04:09,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 29 [2024-11-09 22:04:09,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:09,321 INFO L225 Difference]: With dead ends: 264 [2024-11-09 22:04:09,321 INFO L226 Difference]: Without dead ends: 262 [2024-11-09 22:04:09,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:04:09,322 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 236 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:09,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 505 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 22:04:09,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-09 22:04:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 128. [2024-11-09 22:04:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 122 states have (on average 1.1967213114754098) internal successors, (146), 127 states have internal predecessors, (146), 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) [2024-11-09 22:04:09,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2024-11-09 22:04:09,347 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 29 [2024-11-09 22:04:09,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:09,348 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2024-11-09 22:04:09,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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) [2024-11-09 22:04:09,348 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2024-11-09 22:04:09,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 22:04:09,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:09,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:09,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 22:04:09,352 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:09,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash -339573345, now seen corresponding path program 1 times [2024-11-09 22:04:09,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:09,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327560551] [2024-11-09 22:04:09,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:09,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:09,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327560551] [2024-11-09 22:04:09,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327560551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:09,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:09,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 22:04:09,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221330485] [2024-11-09 22:04:09,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:09,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:04:09,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:09,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:04:09,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:04:09,718 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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) [2024-11-09 22:04:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:10,002 INFO L93 Difference]: Finished difference Result 246 states and 275 transitions. [2024-11-09 22:04:10,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:04:10,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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 32 [2024-11-09 22:04:10,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:10,003 INFO L225 Difference]: With dead ends: 246 [2024-11-09 22:04:10,003 INFO L226 Difference]: Without dead ends: 244 [2024-11-09 22:04:10,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:04:10,004 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 218 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:10,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 487 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 22:04:10,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-09 22:04:10,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 131. [2024-11-09 22:04:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 125 states have (on average 1.192) internal successors, (149), 130 states have internal predecessors, (149), 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) [2024-11-09 22:04:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2024-11-09 22:04:10,018 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 32 [2024-11-09 22:04:10,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:10,019 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2024-11-09 22:04:10,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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) [2024-11-09 22:04:10,019 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2024-11-09 22:04:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 22:04:10,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:10,022 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:10,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 22:04:10,022 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:10,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:10,023 INFO L85 PathProgramCache]: Analyzing trace with hash 533791555, now seen corresponding path program 1 times [2024-11-09 22:04:10,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:10,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735293405] [2024-11-09 22:04:10,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:10,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 22:04:10,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:10,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735293405] [2024-11-09 22:04:10,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735293405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:10,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:10,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:04:10,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163626810] [2024-11-09 22:04:10,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:10,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:04:10,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:10,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:04:10,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:04:10,103 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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) [2024-11-09 22:04:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:10,204 INFO L93 Difference]: Finished difference Result 194 states and 219 transitions. [2024-11-09 22:04:10,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:04:10,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 34 [2024-11-09 22:04:10,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:10,205 INFO L225 Difference]: With dead ends: 194 [2024-11-09 22:04:10,206 INFO L226 Difference]: Without dead ends: 174 [2024-11-09 22:04:10,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:04:10,207 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 27 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:10,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 284 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:04:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-09 22:04:10,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 167. [2024-11-09 22:04:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 161 states have (on average 1.1987577639751552) internal successors, (193), 166 states have internal predecessors, (193), 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) [2024-11-09 22:04:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2024-11-09 22:04:10,225 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 34 [2024-11-09 22:04:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:10,225 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2024-11-09 22:04:10,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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) [2024-11-09 22:04:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2024-11-09 22:04:10,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 22:04:10,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:10,226 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:10,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 22:04:10,226 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:10,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:10,226 INFO L85 PathProgramCache]: Analyzing trace with hash 310074817, now seen corresponding path program 1 times [2024-11-09 22:04:10,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:10,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896219074] [2024-11-09 22:04:10,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:10,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 22:04:10,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:10,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896219074] [2024-11-09 22:04:10,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896219074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:10,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:10,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:04:10,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571583361] [2024-11-09 22:04:10,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:10,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:04:10,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:10,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:04:10,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:04:10,257 INFO L87 Difference]: Start difference. First operand 167 states and 193 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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) [2024-11-09 22:04:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:10,299 INFO L93 Difference]: Finished difference Result 167 states and 193 transitions. [2024-11-09 22:04:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:04:10,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 34 [2024-11-09 22:04:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:10,301 INFO L225 Difference]: With dead ends: 167 [2024-11-09 22:04:10,301 INFO L226 Difference]: Without dead ends: 165 [2024-11-09 22:04:10,301 INFO L431 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 [2024-11-09 22:04:10,301 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 57 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:10,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 93 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:04:10,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-09 22:04:10,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-09 22:04:10,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.19375) internal successors, (191), 164 states have internal predecessors, (191), 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) [2024-11-09 22:04:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2024-11-09 22:04:10,317 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 34 [2024-11-09 22:04:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:10,317 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2024-11-09 22:04:10,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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) [2024-11-09 22:04:10,318 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2024-11-09 22:04:10,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 22:04:10,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:10,318 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:10,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 22:04:10,319 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:10,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:10,319 INFO L85 PathProgramCache]: Analyzing trace with hash -80036924, now seen corresponding path program 1 times [2024-11-09 22:04:10,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:10,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10551982] [2024-11-09 22:04:10,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:10,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:10,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:10,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10551982] [2024-11-09 22:04:10,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10551982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:04:10,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656196902] [2024-11-09 22:04:10,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:10,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:04:10,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:04:10,421 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:04:10,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 22:04:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:10,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 22:04:10,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:04:10,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:04:10,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:04:10,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 22:04:10,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 22:04:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:10,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:04:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:11,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656196902] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:04:11,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:04:11,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 8 [2024-11-09 22:04:11,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174184638] [2024-11-09 22:04:11,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:04:11,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 22:04:11,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:11,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 22:04:11,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 22:04:11,012 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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) [2024-11-09 22:04:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:11,251 INFO L93 Difference]: Finished difference Result 292 states and 332 transitions. [2024-11-09 22:04:11,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:04:11,252 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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 37 [2024-11-09 22:04:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:11,253 INFO L225 Difference]: With dead ends: 292 [2024-11-09 22:04:11,253 INFO L226 Difference]: Without dead ends: 215 [2024-11-09 22:04:11,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:04:11,254 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 138 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:11,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 352 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:04:11,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-09 22:04:11,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 168. [2024-11-09 22:04:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 163 states have (on average 1.177914110429448) internal successors, (192), 167 states have internal predecessors, (192), 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) [2024-11-09 22:04:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 192 transitions. [2024-11-09 22:04:11,273 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 192 transitions. Word has length 37 [2024-11-09 22:04:11,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:11,273 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 192 transitions. [2024-11-09 22:04:11,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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) [2024-11-09 22:04:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 192 transitions. [2024-11-09 22:04:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 22:04:11,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:11,273 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:11,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 22:04:11,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 22:04:11,474 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:11,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:11,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1034955304, now seen corresponding path program 1 times [2024-11-09 22:04:11,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:11,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77381500] [2024-11-09 22:04:11,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:11,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:11,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:11,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77381500] [2024-11-09 22:04:11,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77381500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:04:11,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449550164] [2024-11-09 22:04:11,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:11,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:04:11,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:04:11,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:04:11,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 22:04:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:11,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 22:04:11,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:04:11,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:04:11,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 70 [2024-11-09 22:04:11,916 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2024-11-09 22:04:11,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 153 [2024-11-09 22:04:11,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2024-11-09 22:04:11,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 87 [2024-11-09 22:04:11,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:04:11,941 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2024-11-09 22:04:11,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 78 [2024-11-09 22:04:11,957 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 22:04:11,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 22:04:11,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 102 [2024-11-09 22:04:11,988 INFO L349 Elim1Store]: treesize reduction 101, result has 1.0 percent of original size [2024-11-09 22:04:11,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 203 [2024-11-09 22:04:11,996 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 22:04:12,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 96 [2024-11-09 22:04:12,010 INFO L349 Elim1Store]: treesize reduction 101, result has 1.0 percent of original size [2024-11-09 22:04:12,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 213 treesize of output 199 [2024-11-09 22:04:12,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 74 [2024-11-09 22:04:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:12,449 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:04:12,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:04:12,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2024-11-09 22:04:12,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:04:12,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 60 [2024-11-09 22:04:12,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 153 [2024-11-09 22:04:12,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 176 [2024-11-09 22:04:12,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2024-11-09 22:04:12,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-09 22:04:12,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:04:12,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 22:04:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:12,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449550164] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 22:04:12,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:04:12,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 18 [2024-11-09 22:04:12,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964659107] [2024-11-09 22:04:12,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:12,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 22:04:12,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:12,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 22:04:12,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-09 22:04:12,656 INFO L87 Difference]: Start difference. First operand 168 states and 192 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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) [2024-11-09 22:04:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:12,867 INFO L93 Difference]: Finished difference Result 300 states and 337 transitions. [2024-11-09 22:04:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:04:12,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 37 [2024-11-09 22:04:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:12,868 INFO L225 Difference]: With dead ends: 300 [2024-11-09 22:04:12,868 INFO L226 Difference]: Without dead ends: 282 [2024-11-09 22:04:12,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2024-11-09 22:04:12,869 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 397 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:12,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 348 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:04:12,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-09 22:04:12,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 193. [2024-11-09 22:04:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.202127659574468) internal successors, (226), 192 states have internal predecessors, (226), 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) [2024-11-09 22:04:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2024-11-09 22:04:12,886 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 37 [2024-11-09 22:04:12,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:12,887 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2024-11-09 22:04:12,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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) [2024-11-09 22:04:12,887 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2024-11-09 22:04:12,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 22:04:12,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:12,887 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:12,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 22:04:13,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 22:04:13,088 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:13,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:13,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1153729529, now seen corresponding path program 1 times [2024-11-09 22:04:13,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:13,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973938257] [2024-11-09 22:04:13,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:13,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:13,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:13,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973938257] [2024-11-09 22:04:13,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973938257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:13,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:13,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:04:13,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125304028] [2024-11-09 22:04:13,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:13,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:04:13,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:13,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:04:13,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:04:13,125 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2024-11-09 22:04:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:13,169 INFO L93 Difference]: Finished difference Result 348 states and 417 transitions. [2024-11-09 22:04:13,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:04:13,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 39 [2024-11-09 22:04:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:13,170 INFO L225 Difference]: With dead ends: 348 [2024-11-09 22:04:13,170 INFO L226 Difference]: Without dead ends: 251 [2024-11-09 22:04:13,171 INFO L431 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 [2024-11-09 22:04:13,171 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:13,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 163 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:04:13,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-09 22:04:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 237. [2024-11-09 22:04:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 232 states have (on average 1.2025862068965518) internal successors, (279), 236 states have internal predecessors, (279), 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) [2024-11-09 22:04:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 279 transitions. [2024-11-09 22:04:13,194 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 279 transitions. Word has length 39 [2024-11-09 22:04:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:13,194 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 279 transitions. [2024-11-09 22:04:13,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2024-11-09 22:04:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 279 transitions. [2024-11-09 22:04:13,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 22:04:13,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:13,195 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:13,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 22:04:13,195 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:13,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:13,195 INFO L85 PathProgramCache]: Analyzing trace with hash -222400331, now seen corresponding path program 1 times [2024-11-09 22:04:13,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:13,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665831002] [2024-11-09 22:04:13,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:13,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:13,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:13,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665831002] [2024-11-09 22:04:13,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665831002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:04:13,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542247554] [2024-11-09 22:04:13,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:13,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:04:13,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:04:13,286 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:04:13,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 22:04:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:13,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 22:04:13,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:04:13,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:04:13,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:04:13,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 22:04:13,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 22:04:13,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 22:04:13,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:04:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 22:04:13,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542247554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:04:13,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:04:13,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 7 [2024-11-09 22:04:13,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904738259] [2024-11-09 22:04:13,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:04:13,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:04:13,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:13,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:04:13,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:04:13,662 INFO L87 Difference]: Start difference. First operand 237 states and 279 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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) [2024-11-09 22:04:13,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:13,920 INFO L93 Difference]: Finished difference Result 436 states and 503 transitions. [2024-11-09 22:04:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 22:04:13,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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 41 [2024-11-09 22:04:13,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:13,922 INFO L225 Difference]: With dead ends: 436 [2024-11-09 22:04:13,922 INFO L226 Difference]: Without dead ends: 378 [2024-11-09 22:04:13,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:04:13,924 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 107 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:13,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 454 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:04:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-09 22:04:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 277. [2024-11-09 22:04:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 272 states have (on average 1.2058823529411764) internal successors, (328), 276 states have internal predecessors, (328), 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) [2024-11-09 22:04:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 328 transitions. [2024-11-09 22:04:13,950 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 328 transitions. Word has length 41 [2024-11-09 22:04:13,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:13,951 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 328 transitions. [2024-11-09 22:04:13,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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) [2024-11-09 22:04:13,951 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 328 transitions. [2024-11-09 22:04:13,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 22:04:13,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:13,951 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:13,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 22:04:14,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:04:14,152 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:14,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:14,153 INFO L85 PathProgramCache]: Analyzing trace with hash 106135314, now seen corresponding path program 1 times [2024-11-09 22:04:14,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:14,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626195199] [2024-11-09 22:04:14,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:14,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:14,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:14,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626195199] [2024-11-09 22:04:14,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626195199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:14,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:14,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:04:14,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799662354] [2024-11-09 22:04:14,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:14,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:04:14,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:14,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:04:14,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:04:14,337 INFO L87 Difference]: Start difference. First operand 277 states and 328 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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) [2024-11-09 22:04:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:14,450 INFO L93 Difference]: Finished difference Result 467 states and 555 transitions. [2024-11-09 22:04:14,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:04:14,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 43 [2024-11-09 22:04:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:14,452 INFO L225 Difference]: With dead ends: 467 [2024-11-09 22:04:14,452 INFO L226 Difference]: Without dead ends: 286 [2024-11-09 22:04:14,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 22:04:14,452 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 14 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:14,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 275 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:04:14,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-09 22:04:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 279. [2024-11-09 22:04:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 274 states have (on average 1.2043795620437956) internal successors, (330), 278 states have internal predecessors, (330), 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) [2024-11-09 22:04:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 330 transitions. [2024-11-09 22:04:14,477 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 330 transitions. Word has length 43 [2024-11-09 22:04:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:14,477 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 330 transitions. [2024-11-09 22:04:14,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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) [2024-11-09 22:04:14,477 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 330 transitions. [2024-11-09 22:04:14,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 22:04:14,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:14,478 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:14,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 22:04:14,478 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:14,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:14,479 INFO L85 PathProgramCache]: Analyzing trace with hash -302688911, now seen corresponding path program 1 times [2024-11-09 22:04:14,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:14,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531087138] [2024-11-09 22:04:14,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:14,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:15,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:15,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531087138] [2024-11-09 22:04:15,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531087138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:04:15,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662824338] [2024-11-09 22:04:15,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:15,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:04:15,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:04:15,026 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:04:15,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 22:04:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:15,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 22:04:15,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:04:15,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:04:15,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:04:15,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:04:15,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:04:15,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-09 22:04:15,290 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 22:04:15,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 22:04:15,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:04:15,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-09 22:04:15,319 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 22:04:15,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2024-11-09 22:04:15,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:04:15,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:04:15,353 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 22:04:15,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 22:04:15,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:04:15,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2024-11-09 22:04:15,523 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-09 22:04:15,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 72 [2024-11-09 22:04:15,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:04:15,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2024-11-09 22:04:15,540 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-09 22:04:15,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2024-11-09 22:04:15,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:04:15,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:04:15,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:04:15,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2024-11-09 22:04:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:15,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:04:16,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:04:16,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 191 treesize of output 200 [2024-11-09 22:04:20,735 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:04:20,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:04:20,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-09 22:04:20,746 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:04:20,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:04:20,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 62 [2024-11-09 22:04:20,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-09 22:04:20,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2024-11-09 22:04:20,779 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:04:20,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:04:20,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2024-11-09 22:04:20,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 74 [2024-11-09 22:04:20,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:04:20,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 72 [2024-11-09 22:04:20,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2024-11-09 22:04:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:04:20,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662824338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:04:20,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:04:20,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2024-11-09 22:04:20,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046778418] [2024-11-09 22:04:20,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:04:20,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 22:04:20,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:20,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 22:04:20,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=395, Unknown=4, NotChecked=0, Total=506 [2024-11-09 22:04:20,998 INFO L87 Difference]: Start difference. First operand 279 states and 330 transitions. Second operand has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 23 states have internal predecessors, (109), 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) [2024-11-09 22:04:25,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:04:29,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:04:33,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:04:38,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:04:42,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:04:46,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:04:51,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 22:04:53,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 22:04:53,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:53,343 INFO L93 Difference]: Finished difference Result 672 states and 784 transitions. [2024-11-09 22:04:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 22:04:53,347 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 23 states have internal predecessors, (109), 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 43 [2024-11-09 22:04:53,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:53,349 INFO L225 Difference]: With dead ends: 672 [2024-11-09 22:04:53,349 INFO L226 Difference]: Without dead ends: 561 [2024-11-09 22:04:53,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=342, Invalid=914, Unknown=4, NotChecked=0, Total=1260 [2024-11-09 22:04:53,353 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 657 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 46 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.8s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:53,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1021 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 465 Invalid, 7 Unknown, 0 Unchecked, 30.8s Time] [2024-11-09 22:04:53,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-11-09 22:04:53,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 300. [2024-11-09 22:04:53,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.2) internal successors, (354), 299 states have internal predecessors, (354), 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) [2024-11-09 22:04:53,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 354 transitions. [2024-11-09 22:04:53,387 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 354 transitions. Word has length 43 [2024-11-09 22:04:53,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:53,387 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 354 transitions. [2024-11-09 22:04:53,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 23 states have internal predecessors, (109), 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) [2024-11-09 22:04:53,388 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 354 transitions. [2024-11-09 22:04:53,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 22:04:53,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:53,388 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:53,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 22:04:53,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 22:04:53,593 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:53,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:53,593 INFO L85 PathProgramCache]: Analyzing trace with hash 27076850, now seen corresponding path program 1 times [2024-11-09 22:04:53,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:53,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493411600] [2024-11-09 22:04:53,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:53,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:04:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 22:04:53,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:04:53,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493411600] [2024-11-09 22:04:53,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493411600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:04:53,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:04:53,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:04:53,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794019461] [2024-11-09 22:04:53,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:04:53,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:04:53,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:04:53,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:04:53,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:04:53,759 INFO L87 Difference]: Start difference. First operand 300 states and 354 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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) [2024-11-09 22:04:53,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:04:53,935 INFO L93 Difference]: Finished difference Result 539 states and 626 transitions. [2024-11-09 22:04:53,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:04:53,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 43 [2024-11-09 22:04:53,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:04:53,937 INFO L225 Difference]: With dead ends: 539 [2024-11-09 22:04:53,937 INFO L226 Difference]: Without dead ends: 329 [2024-11-09 22:04:53,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 22:04:53,938 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 179 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:04:53,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 248 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:04:53,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-09 22:04:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 281. [2024-11-09 22:04:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 276 states have (on average 1.1992753623188406) internal successors, (331), 280 states have internal predecessors, (331), 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) [2024-11-09 22:04:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 331 transitions. [2024-11-09 22:04:53,968 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 331 transitions. Word has length 43 [2024-11-09 22:04:53,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:04:53,968 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 331 transitions. [2024-11-09 22:04:53,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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) [2024-11-09 22:04:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 331 transitions. [2024-11-09 22:04:53,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 22:04:53,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:04:53,969 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:53,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 22:04:53,969 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 22:04:53,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:04:53,969 INFO L85 PathProgramCache]: Analyzing trace with hash -124910218, now seen corresponding path program 1 times [2024-11-09 22:04:53,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:04:53,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555381688] [2024-11-09 22:04:53,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:04:53,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:04:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:04:53,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 22:04:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:04:54,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 22:04:54,011 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 22:04:54,013 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2024-11-09 22:04:54,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2024-11-09 22:04:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2024-11-09 22:04:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2024-11-09 22:04:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2024-11-09 22:04:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2024-11-09 22:04:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2024-11-09 22:04:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2024-11-09 22:04:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2024-11-09 22:04:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2024-11-09 22:04:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2024-11-09 22:04:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2024-11-09 22:04:54,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2024-11-09 22:04:54,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 22:04:54,018 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:04:54,053 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 22:04:54,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:04:54 BoogieIcfgContainer [2024-11-09 22:04:54,057 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 22:04:54,057 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 22:04:54,057 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 22:04:54,057 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 22:04:54,058 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:04:06" (3/4) ... [2024-11-09 22:04:54,058 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 22:04:54,102 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 22:04:54,102 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 22:04:54,102 INFO L158 Benchmark]: Toolchain (without parser) took 48475.37ms. Allocated memory was 132.1MB in the beginning and 390.1MB in the end (delta: 257.9MB). Free memory was 77.7MB in the beginning and 293.3MB in the end (delta: -215.6MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2024-11-09 22:04:54,102 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 132.1MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:04:54,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.86ms. Allocated memory is still 132.1MB. Free memory was 77.4MB in the beginning and 102.2MB in the end (delta: -24.8MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2024-11-09 22:04:54,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.20ms. Allocated memory was 132.1MB in the beginning and 186.6MB in the end (delta: 54.5MB). Free memory was 102.1MB in the beginning and 158.4MB in the end (delta: -56.2MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-11-09 22:04:54,103 INFO L158 Benchmark]: Boogie Preprocessor took 38.01ms. Allocated memory is still 186.6MB. Free memory was 158.4MB in the beginning and 155.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:04:54,103 INFO L158 Benchmark]: IcfgBuilder took 488.31ms. Allocated memory is still 186.6MB. Free memory was 155.3MB in the beginning and 132.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 22:04:54,103 INFO L158 Benchmark]: TraceAbstraction took 47434.48ms. Allocated memory was 186.6MB in the beginning and 390.1MB in the end (delta: 203.4MB). Free memory was 132.2MB in the beginning and 296.5MB in the end (delta: -164.3MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2024-11-09 22:04:54,103 INFO L158 Benchmark]: Witness Printer took 44.86ms. Allocated memory is still 390.1MB. Free memory was 295.4MB in the beginning and 293.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:04:54,104 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.11ms. Allocated memory is still 132.1MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.86ms. Allocated memory is still 132.1MB. Free memory was 77.4MB in the beginning and 102.2MB in the end (delta: -24.8MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.20ms. Allocated memory was 132.1MB in the beginning and 186.6MB in the end (delta: 54.5MB). Free memory was 102.1MB in the beginning and 158.4MB in the end (delta: -56.2MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.01ms. Allocated memory is still 186.6MB. Free memory was 158.4MB in the beginning and 155.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 488.31ms. Allocated memory is still 186.6MB. Free memory was 155.3MB in the beginning and 132.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 47434.48ms. Allocated memory was 186.6MB in the beginning and 390.1MB in the end (delta: 203.4MB). Free memory was 132.2MB in the beginning and 296.5MB in the end (delta: -164.3MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. * Witness Printer took 44.86ms. Allocated memory is still 390.1MB. Free memory was 295.4MB in the beginning and 293.3MB 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.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: 1036]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1004] COND FALSE !(0) VAL [list={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) [L1004] EXPR list->inner [L1004] list->inner->next = ((void*)0) [L1004] EXPR list->inner [L1004] list->inner->inner = ((void*)0) [L1004] EXPR list->inner [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}] [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1004] COND FALSE !(0) VAL [list={-1:0}] [L1006] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(0) VAL [end={-1:0}, list={-1:0}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; [L1028] EXPR end->inner [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(0) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1036] EXPR inner->inner [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1036] COND FALSE !(0) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1037] EXPR inner->next [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1037] COND FALSE !(0) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] EXPR inner->inner [L1038] inner = inner->inner [L1039] COND TRUE len == 1 [L1040] EXPR inner->inner [L1040] inner = inner->inner VAL [end={-1:0}, inner={50:5}, len=1, list={-1:0}] [L1029] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={50:5}, len=1, list={-1:0}] [L1031] COND FALSE !(len == 0) [L1034] len = 2 VAL [end={-1:0}, inner={50:5}, len=2, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={50:5}, len=2, list={-1:0}] [L1035] COND FALSE !(0) VAL [end={-1:0}, inner={50:5}, len=2, list={-1:0}] [L1036] EXPR inner->inner [L1036] COND TRUE !(((void*)0) == inner->inner) [L1036] reach_error() VAL [end={-1:0}, inner={50:5}, len=2, list={-1:0}] - 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: 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: 1054]: 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: 1042]: 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: 1037]: 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: 1035]: 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: 1023]: 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: 1016]: 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: 1016]: 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: 1015]: 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: 1004]: 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: 1004]: 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, 107 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 47.3s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 34.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 2561 SdHoareTripleChecker+Valid, 32.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2561 mSDsluCounter, 5649 SdHoareTripleChecker+Invalid, 31.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3979 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1917 IncrementalHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 1670 mSDtfsCounter, 1917 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=300occurred in iteration=18, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 970 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 770 NumberOfCodeBlocks, 770 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 858 ConstructedInterpolants, 63 QuantifiedInterpolants, 12971 SizeOfPredicates, 26 NumberOfNonLiveVariables, 640 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 25/49 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! [2024-11-09 22:04:54,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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